Advances in Cryptology
Crypto '94

Edited by Yvo Desmedt

• The first experimental crypt analysis of the Data Encryption Standard, Matsui, M.
• Linear cryptanalysis of the Fast Data Encipherment Algorithm, Ohta, K. and Aoki, K.
• Differential-linear cryptanalysis, Langford, S. K. and Hellman, M. E.
• Linear cryptanalysis using multiple approximations, Kaliski, B. S. and Robshaw, M. J. B.
• Hashing with SL₂, Tillich, Jean-Pierre and Zemor, G.
• Design of elliptic curves with controllable lower boundary of extension degree for reduction attacks, Chao, J., Tanada, K. and Tsujii, S.
• Cryptographic protocols based on discrete logarithms in real-quadratic orders, Biehl, I., Buchmann, J. A. and Thiel, C.
• Designated confirmer signatures and public-key encryption are equivalent, Okamoto, T.
• Directed acyclic graphs, one-way functions and digital signatures, Bleichenbacher, D. and Maurer, U. M.
• An identity-based signature scheme with bounded life-span, Delos, O. and Quisquater, J. J.
• More flexible exponentiation with precomputation, Lim, C. H. and Lee, P. J.
• A parallel permutation multiplier for a PGM crypto-chip, Horvath, T., Magliveras, S. S. and van Trung, T.
• Cryptographic randomness from air turbulence in disk drives, Davis, D., Ihaka, R. and Fenstermacher, P.
• Cryptanalysis of the Gemmell and Naor multiround authentication protocol, Gehrmann, C.
• LFSR-based hashing and authentication, Krawczyk, H.
• New bound on authentication code with arbitration, Kurosawa, K.
• Multi-secret sharing schemes, Blundo, C., De Santis, A., Di Crescenzo, G., Gaggia, A. Giorgio and Vaccaro, U.
• Designing identification schemes with keys of short size, Stern, J.
• Proofs of partial knowledge and simplified design of witness hiding protocols, Cramer, R., Damgård, I. B. and Schoenmakers, B.
• Language dependent secure bit commitment, Itoh, T., Ohta, Y. and Shizuya, H.
• On the length of cryptographic hash-values used in identification schemes, Girault, M. and Stern, J.
• Incremental cryptography: the case of hashing and signing, Bellare, M., Goldreich, O. and Goldwasser, S.
• An efficient existentially unforgeable signature scheme and its applications, Dwork, C. and Naor, M.
• Bounds for resilient functions and orthogonal arrays, Bierbrauer, J., Gopalakrishnan, K. and Stinson, D. R.
• Tracing traitors, Chor, B., Fiat, A. and Naor, M.
• Towards the equivalence of breaking the Diffie-Hellman protocol and computing discrete logarithms, Maurer, U. M.
• Fast generation of provable primes using search in arithmetic progressions, Mihailescu, P.
• Attack on the cryptographic scheme NIKS-TAS, Coppersmith, D.
• On the risk of opening distributed keys, Burmester, M. V. D.
• Cryptanalysis of cryptosystems based on remote chaos replication, Beth, T., Lazic, D. E. and Mathias, A.
• A Fourier transform approach to the linear complexity of nonlinearly filtered sequences, Massey, J. L. and Serconek, S.
• The security of cipher block chaining, Bellare, M., Kilian, J. and Rogaway, P.
• A chosen plaintext attack of the 16-round cryptosystem, Gilbert, H. and Chauvaud, P.
• Ciphertext only attack for one-way function of the MAP using one ciphertext, Tsunoo, Y., Okamoto, E. and Uyematsu, T.
• Pitfalls in designing substitution boxes, Seberry, J., Zhang, X. M. and Zheng, Y.
• A randomness-rounds tradeoff in private computation, Kushilevitz, E. and Rosen, A.
• Secure voting using partially compatible homomorphisms, Sako, K. and Kilian, J.
• Maintaining security in the presence of transient faults, Canetti, R. and Herzberg, A.

  ---

  Copyright © 1998, Springer-Verlag.