Advances in Cryptology
Crypto '89

Edited by Gilles Brassard

• Keying the German Navy's Enigma (invited), Kahn, D.
• Making conditionally secure cryptosystems unconditionally abuse-free in a general context, Desmedt, Y.
• On the existence of bit commitment schemes and zero-knowledge proofs, Damgård, I. B.
• Problems with the normal use of cryptography for providing security on unclassified networks (invited), Brand, R. L.
• The use of encryption in Kerberos for network authentication (invited), Kohl, J. T.
• UNIX password security---ten years later (invited), Feldmeier, D. C. and Karn, P. R.
• Practical problems with a cryptographic protection scheme (invited), Smith, J. M.
• The smart diskette -- A universal user token and personal crypto-engine, Barrett, P. and Eisele, R.
• On the quadratic spans of periodic sequences, Chan, A. H. and Games, R. A.
• The shortest feedback shift register that can generate a given sequence, Jensen, C. J. A. and Boekee, D. E.
• Perfect local randomness in pseudo-random sequences, Maurer, U. M. and Massey, J. L.
• Sparse pseudorandom distributions (extended abstract), Goldreich, O. and Krawczyk, H.
• Bit commitment using pseudo-randomness (extended abstract), Naor, M.
• How to predict congruential generators, Krawczyk, H.
• A chosen text attack on the modified cryptographic checksum algorithm of Cohen and Huang, Preneel, B., Bosselaers, A., Govaerts, R. and Vandewalle, J.
• On the linear consistency test (LCT) in cryptanalysis with applications, Zeng, K., Yang, C. H. and Rao, T. R. N.
• Batch RSA, Fiat, A.
• On the implementation of elliptic curve cryptosystems, Bender, A. and Castagnoli, G.
• New paradigms for digital signatures and message authentication based on non-interactive zero knowledge proofs, Bellare, M. and Goldwasser, S.
• Undeniable signatures, Chaum, D. and van Antwerpen, H.
• A certified digital signature, Merkle, R. C.
• Efficient identification and signatures for smart cards, Schnorr, C. P.
• A signature with shared verification scheme, De Soete, M., Quisquater, J. J. and Vedder, K.
• On-line/off-line digital signatures, Even, S., Goldreich, O. and Micali, S.
• On the classification of ideal secret sharing schemes (extended abstract), Brickell, E. F. and Davenport, D. M.
• Dynamic threshold scheme based on the definition of cross-product in an N-dimensional linear space, Laih, C. S., Harn, L., Lee, J. Y. and Hwang, T.
• Secret sharing over infinite domains (extended abstract), Chor, B. and Kushilevitz, E.
• Threshold cryptosystems, Desmedt, Y. and Frankel, Y.
• Flexible access control with master keys, Chick, G. C. and Tavares, S. E.
• Key distribution protocol for digital mobile communication systems, Tatebayashi, M., Matsuzaki, N. and Newman, D. B. Jr.
• A key exchange system based on real quadratic fields, Buchmann, J. A. and Williams, H. C.
• On key distribution systems, Yacobi, Y. and Shmuely, Z.
• SDNS architecture and end-to-end encryption, Nelson, R. and Heimann, J.
• A survey of hardware implementations of RSA (invited), Brickell, E. F.
• Modular exponentiation using recursive sums of residues, Findlay, P. A. and Johnson, B. A.
• A fast modular-multiplication algorithm based on a higher radix, Morita, H.
• Addition chain heuristics, Bos, J. N. E. and Coster, M. J.
• How easy is collision search. New results and applications to DES, Quisquater, J. J. and Delescaille, J. P.
• A design principle for hash functions, Damgård, I. B.
• One way hash functions and DES, Merkle, R. C.
• Properties of cryptosystem PGM, Magliveras, S. S. and Memon, N. D.
• On the construction of block ciphers provably secure and not relying on any unproved hypotheses (extended abstract), Zheng, Y., Matsumoto, T. and Imai, H.
• Disposable zero-knowledge authentications and their applications to untraceable electronic cash, Okamoto, T. and Ohta, K.
• Efficient identification schemes using two prover interactive proofs, Ben-Or, M., Goldwasser, S., Kilian, J. and Wigderson, A.
• On the concrete complexity of zero-knowledge proofs, Boyar, J. and Peralta, R.
• Zero knowledge proofs of knowledge in two rounds, Feige, U. and Shamir, A.
• Minimum resource zero-knowledge proofs (extended abstracts), Kilian, J., Micali, S. and Ostrovsky, R.
• Non-interactive oblivious transfer and applications, Bellare, M. and Micali, S.
• Multiparty protocols tolerating half faulty processors, Beaver, D.
• Controlled gradual disclosure schemes for random bits and their applications, Cleve, R.
• Multiparty computation with faulty majority, Beaver, D. and Goldwasser, S.
• The spymasters double-agent problem: Multiparty computations secure unconditionally from minorities and cryptograhically from majorities, Chaum, D.
• On the structure of secret key exchange protocols, Bellare, M., Cowen, L. and Goldwasser, S.
• An efficient identification scheme based on permuted kernels (extended abstract), Shamir, A.
• An efficient software protection scheme, Ostrovsky, R.
• Good S-boxes are easy to find, Adams, C. M. and Tavares, S. E.
• Convert distributed processing with computer viruses, White, S. R.
• Progress in data security standardisation, Price, W. L.
• The FEAL--8 cryptosystem and a call for attack, Miyaguchi, S.
• How to explain zero-knowledge protocols to your children, Quisquater, J. J., Guillou, L. C., Annick, M. and Berson, T. A.

  ---

  Copyright © 1998, Springer-Verlag.