Advances in Cryptology
Crypto '93
Edited by Douglas R. Stinson
- Efficient signature schemes based on birational permutations, Shamir, A.
- A new identification scheme based on syndrome decoding, Stern, J.
- The shrinking generator, Coppersmith, D., Krawczyk, H. and Mansour, Y.
- An integrity check value algorithm for stream ciphers, Taylor, R.
- Nonlinearly balanced boolean functions and their propagation characteristics, Seberry, J., Zhang, X. M. and Zheng, Y.
- A low communication competitive interactive proof system for promised quadratic residuosity, Itoh, T., Hoshi, M. and Tsujii, S.
- Secret sharing and perfect zero-knowledge, De Santis, A., Di Crescenzo, G. and Persiano, G.
- One message proof systems with known space verifiers, Aumann, Y. and Feige, U.
- Interactive hashing can simplify zero-knowledge protocol design without computational assumptions, Damgård, I. B.
- Fully dynamic secret sharing schemes, Blundo, C., Cresti, A., De Santis, A. and Vaccaro, U.
- Multisecret threshold schemes, Jackson, W. A., Martin, K. M. and O'Keefe, C. M.
- Secret sharing made short, Krawczyk, H.
- A subexponential algorithm for discrete logarithms over all finite fields, Adleman, L. M. and DeMarrais, J.
- An implementation of the general number field sieve, Buchmann, J. A., Loho, J. and Zayer, J.
- On the factorization of RSA-120, Denny, T., Dodson, B., Lenstra, A. K. and Manasse, M. S.
- Comparison of three modular reduction functions, Bosselaers, A., Govaerts, R. and Vandewalle, J.
- Differential cryptanalysis of Lucifer, Ben Aroya, I. and Biham, E.
- Differential attack on message authentication codes, Ohta, K. and Matsui, M.
- Cryptanalysis of the CFB mode of the DES with a reduced number of rounds, Preneel, B., Nuttin, M., Rijmen, V. and Buelens, J.
- Weak keys for IDEA, Daemen, J., Govaerts, R. and Vandewalle, J.
- Entity authentication and key distribution, Bellare, M. and Rogaway, P.
- On the existence of statistically hiding bit commitment schemes and fail-stop signatures, Damgård, I. B., Pedersen, T. P. and Pfitzmann, B.
- Joint encryption and message-efficient secure computation, Franklin, M. K. and Haber, S.
- Cryptographic primitives based on hard learning problems, Blum, A., Furst, M., Kearns, M. and Lipton, R. J.
- Extensions of single-term coins, Ferguson, N.
- Untraceable off-line cash in wallets with observers, Brands, S.
- Discreet solitary games, Crépeau, C. and Kilian, J.
- On families of hash functions via geometric codes and concatenation, Bierbrauer, J., Johansson, T., Kabatianski, G. A. and Smeets, B.
- On the construction of perfect authentication codes that permit arbitration, Johansson, T.
- Codes for interactive authentication, Gemmell, P. and Naor, M.
- Hashfunctions based on block ciphers: a synthetic approach, Preneel, B., Govaerts, R. and Vandewalle, J.
- Security of iterated hash functions based on block ciphers, Hohl, W., Lai, X., Meier, T. and Waldvogel, C.
- Improved algorithms for the permuted kernel problem, Patarin, J. and Chauvaud, P.
- On the distribution of characteristics in composite permutations, O'Connor, L.
- Remark on the threshold RSA signature scheme, Li, C. M., Hwang, T. and Lee, N. Y.
- Another method for attaining security against adaptively chosen ciphertext attacks, Lim, C. H. and Lee, P. J.
- Attacks on the birational permutation signature schemes, Coppersmith, D., Stern, J. and Vaudenay, S.
- Interaction in key distribution schemes, Beimel, A. and Chor, B.
- Secret-key agreement without public-key cryptography, Leighton, T. and Micali, S.
- Broadcast encryption, Fiat, A. and Naor, M.
Copyright © 1998, Springer-Verlag.