Advances in Cryptology
Crypto '91
Edited by Joan Feigenbaum
- A calculus for access control in distributed systems, Abadi, M., Burrows, M., Lampson, B. and Plotkin, G.
- Deriving the complete knowledge of participants in cryptographic protocols, Toussaint, M.-J.
- Systematic design of two-party authentication protocols, Bird, R., Gopal, I., Herzberg, A., Janson, P., Kutten, S., Molva, R. and Yung, M.
- Combinatorial characterizations of authentication codes, Stinson, D. R.
- Universal hashing and authentication codes, Stinson, D. R.
- On correlation-immune functions, Camion, P., Carlet, C., Charpin, P. and Sendrier, N.
- On the size of shares for secret sharing schemes, Capocelli, R. M., De Santis, A., Gargano, L. and Vaccaro, U.
- On verification in secret sharing, Dwork, C.
- Non-interactive and information-theoretic secure verifiable secret sharing, Pedersen, T. P.
- Multiparty secret key exchange using a random deal of cards, Fischer, M. J. and Wright, R. N.
- Differential cryptanalysis of Snefru, Khafre, REDOC-II, LOKI and Lucifer (Extended abstract), Biham, E. and Shamir, A.
- A known plaintext attack of FEAL and FEAL-6, Tardy-Corfdir, A. and Gilbert, H.
- A switching closure test to analyze cryptosystems (Extended abstract), Morita, H., Ohta, K. and Miyaguchi, S.
- An attack on the last two rounds of MD4, den Boer, B. and Bosselaers, A.
- The cryptanalysis of a new public-key cryptosystem based on modular knapsacks, Chee, Y. Meng, Joux, A. and Stern, J.
- A one-round, two-prover, zero-knowledge protocol for NP, Lapidot, D. and Shamir, A.
- Interactive proofs with space bounded provers, Kilian, J. and Rubinfeld, R.
- Functional inversion and communication complexity, Teng, S. H.
- The use of interaction in public cryptosystems (Extended abstract), Rudich, S.
- New public-key schemes based on elliptic curves over the ring Zn, Koyama, K., Maurer, U. M., Okamoto, T. and Vanstone, S. A.
- Efficient algorithms for the construction of hyperelliptic cryptosystems, Okamoto, T. and Sakurai, K.
- CM-curves with good cryptographic properties, Koblitz, N.
- A new ID-based key sharing system, Tsujii, S. and Chao, J.
- Psuedo-random generators from one-way functions, Luby, M.
- New results on pseudorandom permutation generators based on the DES scheme, Patarin, J.
- Faster modular multiplication by operand scaling, Walter, C. D.
- Universal electronic cash, Okamoto, T. and Ohta, K.
- How to break and repair a "provably secure" untraceable payment system, Pfitzmann, B. and Waidner, M.
- Practical quantum oblivious transfer, Bennett, C. H., Brassard, G., Crépeau, C. and Skubiszewska, M. H.
- Exploiting parallelism in hardware implementation of the DES, Broscius, A. G. and Smith, J. M.
- Foundations of secure interactive computing, Beaver, D.
- Secure computation, Micali, S. and Rogaway, P.
- A cryptographic scheme for computerized general elections, Iversen, K. R.
- Efficient multiparty protocols using circuit randomization, Beaver, D.
- Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack, Rackoff, C. and Simon, D. R.
- Towards practical public key systems secure against chosen ciphertext attacks, Damgård, I. B.
- Shared generation of authenticators and signatures, Desmedt, Y. and Frankel, Y.
- Cryptographically strong undeniable signatures, unconditionally secure for the signer, Chaum, D., van Heijst, E. and Pfitzmann, B.
Copyright © 1998, Springer-Verlag.