EUROCRYPT 1997

Konstanz, Germany

Walter Fumy (Ed.): Advances in Cryptology - EUROCRYPT '97, International Conference on the Theory and Application of Cryptographic Techniques, Konstanz, Germany, May 11-15, 1997, Proceeding. Lecture Notes in Computer Science, Vol. 1233, Springer, 1997, ISBN 3-540-62975-0

Block Ciphers

• Johan Borst, Lars R. Knudsen, Vincent Rijmen: Two Attacks on Reduced IDEA. 1-13
• Thilo Zieschang: Combinatorial Properties of Basic Encryption Operations (Extended Abstract). 14-26

Public Key Systems

• David Naccache, Jacques Stern: A New Public-Key Cryptosystem. 27-36
• Dan Boneh, Richard A. DeMillo, Richard J. Lipton: On the Importance of Checking Cryptographic Protocols for Faults (Extended Abstract). 37-51
• Don Coppersmith, Adi Shamir: Lattice Attacks on NTRU. 52-61

Protocols

• Adam Young, Moti Yung: Kleptography: Using Cryptography Against Cryptography. 62-74
• Ronald Cramer, Ivan Damgård: Fast and Secure Immunization Against Adaptive Man-in-the-Middle Impersonation. 75-87
• Birgit Pfitzmann, Michael Waidner: Anonymous Fingerprinting. Or just the abstract. 88-102
• Ronald Cramer, Rosario Gennaro, Berry Schoenmakers: A Secure and Optimally Efficient Multi-Authority Election Scheme. 103-118

Key Escrow

• Eric R. Verheul, Henk C. A. van Tilborg: Binding ElGamal: A Fraud-Detectable Alternative to Key-Escrow Proposals. 119-133
• Ross J. Anderson, Michael Roe: The GCHQ Protocol and Its Problems. 134-148

Hash-Functions

• Thomas Johansson: Bucket Hashing with a Small Key Size. 149-162
• Mihir Bellare, Daniele Micciancio: A New Paradigm for Collision-Free Hashing: Incrementality at Reduced Cost. 163-192

Information Theory

• Christian Cachin: Smooth Entropy and Rényi Entropy. 193-208
• Ueli M. Maurer: Information-Theoretically Secure Secret-Key Agreement by NOT Authenticated Public Discussion. 209-225

Stream Ciphers

• Jovan Dj. Goli: Linear Statistical Weakness of Alleged RC4 Keystream Generator. 226-238
• Jovan Dj. Goli: Cryptanalysis of Alleged A5 Stream Cipher. 239-255

Complexity Theory

• Victor Shoup: Lower Bounds for Discrete Logarithms and Related Problems. 256-266
• Roger Fischlin, Claus-Peter Schnorr: Stronger Security Proofs for RSA and Rabin Bits. 267-279
• Mihir Bellare, Markus Jakobsson, Moti Yung: Round-Optimal Zero-Knowledge Arguments Based on any One-Way Function. 280-305
• Claude Crépeau: Efficient Cryptographic Protocols Based on Noisy Channels. 306-317
• Stefan Brands: Rapid Demonstration of Linear Relations Connected by Boolean Operators. 318-333
• Gilles Brassard, Claude Crépeau: Oblivious Transfers and Privacy Amplification. 334-347

Implementation

• Antoon Bosselaers, René Govaerts, Joos Vandewalle: SHA: A Design for Parallel Architectures? 348-362
• Christof Paar, Pedro Soria Rodriguez: Fast Arithmetic Architectures for Public-Key Algorithms over Galois Fields GF((2ⁿ)^m). 363-378
• Reynald Lercier: Finding Good Random Elliptic Curves for Cryptosystems Defined over F₂ⁿ. 379-392

Authentication

• Marc Fischlin: Incremental Cryptography and Memory Checkers. Or .dvi or gnuzipped or just the abstract. 293-408
• Kaoru Kurosawa, Thomas Johansson, Douglas R. Stinson: Almost k-wise Independent Sample Spaces and Their Cryptologic Applications. Also here. 409-421

Boolean Functions

• Claude Carlet: More Correlation-Immune and Resilient Functions over Galois Fields and Galois Rings. 422-433
• Kaoru Kurosawa, Takashi Satoh: Design of SAC/PC(l) of Order k Boolean Functions and Three Other Cryptographic Criteria. Also here. 434-449

Signatures

• Markus Jakobsson, Moti Yung: Distributed "Magic Ink" Signatures. 450-464
• Jan Camenisch: Efficient and Generalized Group Signatures. 465-479
• Niko Bari, Birgit Pfitzmann: Collision-Free Accumulators and Fail-Stop Signature Schemes Without Trees. Or just the abstract. 480-494
• Marc Girault, Jean-François Misarsky: Selective Forgery of RSA Signatures Using Redundancy. 495-507

Rump Session

• A. Bosselaers, R. Govaerts, J. Vandewalle, Even faster hashing on the Pentium, which includes updated performance figures from Fast hashing on the Pentium, from Crypto'96
• Birgit Pfitzmann, Michael Waidner: How to Break "Fraud-Detectable Key-Escrow" (similar version: IBM Research Report RZ 2970 11/03/1997) Or PDF. Or abstract and slides.
• Marc Joye, François Koeune and Jean-Jacques Quisquater: Further results on Chinese remaindering.