EUROCRYEVr '97, the 15th annual EUROCRYPT conference on the theory and application of cryptographic techniques, was organized and sponsored by the International Association for Cryptologic Research (IACR). The IACR organizes two series of international conferences each year, the EUROCRYPT meeting in Europe and CRWTO in the United States. The history of EUROCRYFT started 15 years ago in Germany with the Burg Feuerstein Workshop (see Springer LNCS 149 for the proceedings). It was due to Thomas Beth's initiative and hard work that the 76 participants from 14 countries gathered in Burg Feuerstein for the first open meeting in Europe devoted to modem cryptography. I am proud to have been one of the participants and still fondly remember my first encounters with some of the celebrities in cryptography. Since those early days the conference has been held in a different location in Europe each year (Udine, Paris, Linz, Linkoping, Amsterdam, Davos, Houthalen, Aarhus, Brighton, Balantonfiired, Lofthus, Perugia, Saint-Malo, Saragossa) and it has enjoyed a steady growth, Since the second conference (Udine, 1983) the IACR has been involved, since the Paris meeting in 1984, the name EUROCRYPT has been used. For its 15th anniversary, EUROCRYPT finally returned to Germany. The scientific program for EUROCRYPT '97 was put together by a 18-member program committee whch considered 104 high-quality submissions. These proceedings contain the revised versions of the 34 papers that were accepted for presentation. In addition, there were two invited talks by Ernst Bovelander and by Gerhard Frey.
Author(s): Johan Borst, Lars R. Knudsen, Vincent Rijmen (auth.), Walter Fumy (eds.)
Series: Lecture Notes in Computer Science 1233
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 1997
Language: English
Pages: 509
Tags: Computer Science, general
Two Attacks on Reduced IDEA....Pages 1-13
Combinatorial Properties of Basic Encryption Operations....Pages 14-26
A New Public-Key Cryptosystem....Pages 27-36
On the Importance of Checking Cryptographic Protocols for Faults....Pages 37-51
Lattice Attacks on NTRU....Pages 52-61
Kleptography: Using Cryptography Against Cryptography....Pages 62-74
Fast and Secure Immunization Against Adaptive Man-in-the-Middle Impersonation....Pages 75-87
Anonymous Fingerprinting....Pages 88-102
A Secure and Optimally Efficient Multi-Authority Election Scheme....Pages 103-118
Binding ElGamal: A Fraud-Detectable Alternative to Key-Escrow Proposals....Pages 119-133
The GCHQ Protocol and Its Problems....Pages 134-148
Bucket Hashing with a Small Key Size....Pages 149-162
A New Paradigm for Collision-Free Hashing: Incrementality at Reduced Cost....Pages 163-192
Smooth Entropy and Rényi Entropy....Pages 193-208
Information-Theoretically Secure Secret-Key Agreement by NOT Authenticated Public Discussion....Pages 209-225
Linear Statistical Weakness of Alleged RC4 Keystream Generator....Pages 226-238
Cryptanalysis of Alleged A5 Stream Cipher....Pages 239-255
Lower Bounds for Discrete Logarithms and Related Problems....Pages 256-266
Stronger Security Proofs for RSA and Rabin Bits....Pages 267-279
Round-Optimal Zero-Knowledge Arguments Based on Any One-Way Function....Pages 280-305
Efficient Cryptographic Protocols Based on Noisy Channels....Pages 306-317
Rapid Demonstration of Linear Relations Connected by Boolean Operators....Pages 318-333
Oblivious Transfers and Privacy Amplification....Pages 334-347
SHA: A Design for Parallel Architectures?....Pages 348-362
Fast Arithmetic Architectures for Public-Key Algorithms over Galois Fields GF ((2 n ) m )....Pages 363-378
Incremental Cryptography and Memory Checkers....Pages 379-392
Almost k -wise Independent Sample Spaces and Their Cryptologic Applications....Pages 393-408
More Correlation-Immune and Resilient Functions over Galois Fields and Galois Rings....Pages 409-421
Design of SAC/PC( l ) of Order k Boolean Functions and Three Other Cryptographic Criteria....Pages 422-433
Distributed “Magic Ink” Signatures....Pages 434-449
Efficient and Generalized Group Signatures....Pages 450-464
Collision-Free Accumulators and Fail-Stop Signature Schemes Without Trees....Pages 465-479
Selective Forgery of RSA Signatures Using Redundancy....Pages 480-494
....Pages 495-507
