International Association for Cryptologic Research

Publications by Conference

Advances in Cryptology - EUROCRYPT '97, International Conference on the Theory and Application of Cryptographic Techniques, Konstanz, Germany, May 11-15, 1997, Proceeding

Page	Title
1-13	Two Attacks on Reduced IDEA
14-26	Combinatorial Properties of Basic Encryption Operations (Extended Abstract)
27-36	A New Public-Key Cryptosystem
37-51	On the Importance of Checking Cryptographic Protocols for Faults (Extended Abstract)
52-61	Lattice Attacks on NTRU
62-74	Kleptography: Using Cryptography Against Cryptography
75-87	Fast and Secure Immunization Against Adaptive Man-in-the-Middle Impersonation
88-102	Anonymous Fingerprinting
103-118	A Secure and Optimally Efficient Multi-Authority Election Scheme
119-133	Binding ElGamal: A Fraud-Detectable Alternative to Key-Escrow Proposals
134-148	The GCHQ Protocol and Its Problems
149-162	Bucket Hashing with a Small Key Size
163-192	A New Paradigm for Collision-Free Hashing: Incrementality at Reduced Cost
193-208	Smooth Entropy and Rényi Entropy
209-225	Information-Theoretically Secure Secret-Key Agreement by NOT Authenticated Public Discussion
226-238	Linear Statistical Weakness of Alleged RC4 Keystream Generator
239-255	Cryptanalysis of Alleged A5 Stream Cipher
256-266	Lower Bounds for Discrete Logarithms and Related Problems
267-279	Stronger Security Proofs for RSA and Rabin Bits
280-305	Round-Optimal Zero-Knowledge Arguments Based on any One-Way Function
293-408	Incremental Cryptography and Memory Checkers
306-317	Efficient Cryptographic Protocols Based on Noisy Channels
318-333	Rapid Demonstration of Linear Relations Connected by Boolean Operators
334-347	Oblivious Transfers and Privacy Amplification
348-362	SHA: A Design for Parallel Architectures?
363-378	Fast Arithmetic Architectures for Public-Key Algorithms over Galois Fields GF((2ⁿ)^m)
379-392	Finding Good Random Elliptic Curves for Cryptosystems Defined over F₂ⁿ
409-421	Almost k-wise Independent Sample Spaces and Their Cryptologic Applications
422-433	More Correlation-Immune and Resilient Functions over Galois Fields and Galois Rings
434-449	Design of SAC/PC(l) of Order k Boolean Functions and Three Other Cryptographic Criteria
450-464	Distributed "Magic Ink" Signatures
465-479	Efficient and Generalized Group Signatures
480-494	Collision-Free Accumulators and Fail-Stop Signature Schemes Without Trees
495-507	Selective Forgery of RSA Signatures Using Redundancy