Advances in Cryptology
EuroCrypt '97
Edited by Walter Fumy
- Two Attacks on Reduced IDEA (Extended Abstract), Borst, J., Knudsen, L. R. and Rijmen, V.
- Combinatorial Properties of Basic Encryption Operations, Zieschang, T.
- A New Public-Key Cryptosystem, Naccache, D. and Stern, J.
- On the Importance of Checking Cryptographic Protocols for Faults (Extended Abstract), Boneh, D., DeMillo, R. A. and Lipton, R. J.
- Lattice Attacks on NTRU, Coppersmith, D. and Shamir, A.
- Kleptography: Using Cryptography Against Cryptography, Young, A. and Yung, M.
- Fast and Secure Immunization Against Adaptive Man-in-the-Middle Impersonation, Cramer, R. and Damgård, I. B.
- Anonymous Fingerprinting, Pfitzmann, B. and Waidner, M.
- A Secure and Optimally Efficient Multi-Authority Election Scheme, Cramer, R., Gennaro, R. and Schoenmakers, B.
- Binding ElGamal: A Fraud-Detectable Alternative to Key-Escrow Proposals, Verheul, E. R. and van Tilborg, H. C. A.
- The GCHQ Protocol and Its Problems, Anderson, R. and Roe, M.
- Bucket Hashing with a Small Key Size, Johansson, T.
- A New Paradigm for Collision-Free Hashing: Incrementality at Reduced Cost, Bellare, M. and Micciancio, D.
- Smooth Entropy and Renyi Entropy, Cachin, C.
- Information-Theoretically Secure Secret-Key Agreement by NOT Authenticated Public Discussion, Maurer, U. M.
- Linear Statistical Weakness of Alleged RC4 Keystream Generator, Golic, J. D.
- Cryptanalysis of Alleged A5 Stream Cipher, Golic, J. D.
- Lower Bounds for Discrete Logarithms and Related Problems, Shoup, V.
- Stronger Security Proofs for RSA and Rabin Bits, Fischlin, R. and Schnorr, C. P.
- Round-Optimal Zero-Knowledge Arguments Based on Any One-Way Function, Bellare, M., Jakobsson, M. and Yung, M.
- Efficient Cryptographic Protocols Based on Noisy Channels, Crépeau, C.
- Rapid Demonstration of Linear Relations Connected by Boolean Operators, Brands, S.
- Oblivious Transfers and Privacy Amplification, Brassard, G. and Crépeau, C.
- SHA: A Design for Parallel Architectures?, Bosselaers, A., Govaerts, R. and Vandewalle, J.
- Fast Arithmetic Architectures for Public-Key Algorithms over Galois Fields GF((2n)m), Paar, C. and Soria-Rodriguez, P.
- Finding Good Random Elliptic Curves for Cryptosystems Defined Over F2n, Lercier, R.
- Incremental Cryptography and Memory Checkers, Fischlin, M.
- Almost k-wise Independent Sample Spaces and Their Cryptologic Applications, Kurosawa, K., Johansson, T. and Stinson, D. R.
- More Correlation-Immune and Reslient Functions over Galois Fields and Galois Rings, Carlet, C.
- Design of SAC/PC(1) of Order k Boolean Functions and Three Other Cryptographic Criteria, Kurosawa, K. and Satoh, T.
- Distributed "Magic Ink" Signatures, Jakobsson, M. and Yung, M.
- Efficient and Generalized Group Signatures, Camenisch, J. L.
- Collision-Free Accumulators and Fail-Stop Signature Schemes Without Trees, Baric, N. and Pfitzmann, B.
- Selective Forgery of RSA Signatures Using Redundancy, Girault, M. and Misarsky, J.-F.
Copyright © 1998, Springer-Verlag.