Advances in Cryptology
EuroCrypt '92
Edited by Rainer A. Rueppel
- Graph decompositions and secret sharing schemes, Blundo, C., De Santis, A., Stinson, D. R. and Vaccaro, U.
- Classification of ideal homomorphic threshold schemes over finite Abelian groups (Extended abstract), Frankel, Y. and Desmedt, Y.
- FFT hashing is not collision-free, Baritaud, T., Gilbert, H. and Girault, M.
- FFT-hash II, efficient cryptographic hashing, Schnorr, C. P.
- Hash functions based on block ciphers, Lai, X. and Massey, J. L.
- Differential cryptanalysis mod 232 with applications to MD5, Berson, T. A.
- A new method for known plaintext attack of FEAL cipher, Matsui, M. and Yamagishi, A.
- On the construction of highly nonlinear permutations, Nyberg, K.
- The one-round functions of the DES generate the alternating group, Wernsdorf, R.
- Correlation via linear sequential circuit approximation of combiners with memory, Golic, J. D.
- Convergence of a Bayesian iterative error-correction procedure on a noisy shift register sequence, Mihaljevic, M. J. and Golic, J. D.
- Suffix trees and string complexity, O'Connor, L. and Snider, T.
- Attacks on protocols for server-aided RSA computation, Pfitzmann, B. and Waidner, M.
- Public-key cryptosystems with very small key lengths, Harper, G., Menezes, A. and Vanstone, S. A.
- Resource requirements for the application of addition chains in modulo exponentiation, Sauerbrey, J. and Dietel, A.
- Massively parallel elliptic curve factoring, Dixon, B. and Lenstra, A. K.
- The Eurocrypt '92 Controversial Issue: Trapdoor Primes and Moduli, Desmedt, Y., Landrock, P., Lenstra, A. K., McCurley, K. S., Odlyzko, A. M., Rueppel, R. A. and Smid, M. E.
- Fast exponentiation with precomputation (Extended abstract), Brickell, E. F., Gordon, D. M., McCurley, K. S. and Wilson, D. B.
- Batch Diffie-Hellman key agreement systems and their application to portable communications, Beller, M. J. and Yacobi, Y.
- High-speed implementation methods for RSA scheme, Iwamura, K., Matsumoto, T. and Imai, H.
- A simplified and generalized treatment of Luby-Rackoff pseudorandom permutation generators, Maurer, U. M.
- How to construct pseudorandom and super pseudorandom permutations from one single pseudorandom function, Patarin, J.
- A construction of super pseudorandom permutations from a single pseudorandom function, Sadeghiyan, B. and Pieprzyk, J.
- How to break a "secure" oblivious transfer protocol, Beaver, D.
- Uniform results in polynomial-time security, Barbaroux, P.
- Cryptographic protocols provably secure against dynamic adversaries, Beaver, D. and Haber, S.
- Secure bit commitment function against divertibility, Ohta, K., Okamoto, T. and Fujioka, A.
- Non-interactive circuit based proofs and non-interactive perfect zero-knowledge with preprocessing, Damgård, I. B.
- Tools for proving zero knowledge, Biehl, I., Buchmann, J. A., Meyer, B., Thiel, C. and Thiel, C.
- How to make efficient fail-stop signatures, Heyst, E. van and Pedersen, T. P.
- Which new RSA signatures can be computed from RSA signatures, obtained in a specific interactive protocol?, Evertse, J. H. and Heyst, E. van
- Transferred cash grows in size, Chaum, D. and Pedersen, T. P.
- Local randomness in candidate one-way functions, Niederreiter, H. and Schnorr, C. P.
- How intractable is the discrete logarithm for a general finite group?, Okamoto, T., Sakurai, K. and Shizuya, H.
- Factoring with an oracle, Maurer, U. M.
- Secure Audio Teleconferencing: A Practical Solution, Heiman, Rafi
- Secure conference key distribution schemes for conspiracy attack, Koyama, K.
- A note on discrete logarithms with special structure, Heiman, R.
- A remark on a non-interactive public-key distribution system, Maurer, U. M. and Yacobi, Y.
- Security bounds for parallel versions of identification protocols, Chen, L. and Damgård, I. B.
- Information-theoretic bounds for authentication frauds, Sgarro, A.
- A generalized correlation attack with a probabilistic constrained edit distance, Golic, J. D. and Petrovic, S. V.
- Systolic-arrays for modular exponentiation using Montgomery method, Iwamura, K., Matsumoto, T. and Imai, H.
- On the development of a fast elliptic curve cryptosystem, Agnew, G. B., Mullin, R. C. and Vanstone, S. A.
- A Montgomery-suitable Fiat-Shamir-like authentication scheme, Naccache, D.
Copyright © 1998, Springer-Verlag.