Advances in Cryptology — CRYPTO ’95

1. Front Matter

   Pages I-XII

   PDF

2. MAC and Hash

   1. MDx-MAC and Building Fast MACs from Hash Functions

      • Bart Preneel, Paul C. van Oorschot

      Pages 1-14

   2. XOR MACs: New Methods for Message Authentication Using Finite Pseudorandom Functions

      • Mihir Bellare, Roch Guérin, Phillip Rogaway

      Pages 15-28

   3. Bucket Hashing and its Application to Fast Message Authentication

      • Phillip Rogaway

      Pages 29-42

3. Number Theory I

   1. Fast Key Exchange with Elliptic Curve Systems

      • Richard Schroeppel, Hilarie Orman, Sean O’Malley, Oliver Spatscheck

      Pages 43-56

   2. Fast Server-Aided RSA Signatures Secure Against Active Attacks

      • Philippe Béguin, Jean-Jacques Quisquater

      Pages 57-69

   3. Security and Performance of Server-Aided RSA Computation Protocols

      • Chae Hoon Lim, Pil Joong Lee

      Pages 70-83

4. Oblivious Transfer

   1. Efficient Commitment Schemes with Bounded Sender and Unbounded Receiver

      • Shai Halevi

      Pages 84-96

   2. Precomputing Oblivious Transfer

      • Donald Beaver

      Pages 97-109

   3. Committed Oblivious Transfer and Private Multi-Party Computation

      • Claude Crépeau, Jeroen van de Graaf, Alain Tapp

      Pages 110-123

   4. On the Security of the Quantum Oblivious Transfer and Key Distribution Protocols

      • Dominic Mayers

      Pages 124-135

5. Cryptanalysis I

   1. How to Break Shamir’s Asymmetric Basis

      • Thorsten Theobald

      Pages 136-147

   2. On the Security of the Gollmann Cascades

      • Sang-Joon Park, Sang-Jin Lee, Seung-Cheol Goh

      Pages 148-156

   3. Improving the Search Algorithm for the Best Linear Expression

      • Kazuo Ohta, Shiho Moriai, Kazumaro Aoki

      Pages 157-170

   4. On Differential and Linear Cryptanalysis of the RC5 Encryption Algorithm

      • Burton S. Kaliski Jr., Yiqun Lisa Yin

      Pages 171-184

6. Key Escrow

   1. A Simple Method for Generating and Sharing Pseudo-Random Functions, with Applications to Clipper-like Key Escrow Systems

      • Silvio Micali, Ray Sidney

      Pages 185-196

   2. A Key Escrow System with Warrant Bounds

      • Arjen K. Lenstra, Peter Winkler, Yacov Yacobi

      Pages 197-207

   3. Fair Cryptosystems, Revisited

      • Joe Kilian, Tom Leighton

      Pages 208-221

   4. Escrow Encryption Systems Visited: Attacks, Analysis and Designs

      • Yair Frankel, Moti Yung

      Pages 222-235

7. Protocols

   1. Robustness Principles for Public Key Protocols

      • Ross Anderson, Roger Needham

      Pages 236-247

The Crypto ’95 conference was sponsored by the International Association for Cryptologic Research (IACR), in cooperation with the IEEE Computer - ciety Technical Committee on Security and Privacy, and the Computer Science Department of the University of California, Santa Barbara. It took place at the University of California, Santa Barbara, from August 27-31, 1995. This was the fifteenth annual Crypto conference; all have been held at UCSB. For the second time, proceedings were available at the conference. The General Chair, Stafford Tavares, was responsible for local organization and registration. The Program Committee considered 151 papers and selected 36 for pres- tation. There were also two invited talks. Robert Morris, Sr. gave a talk on “Ways of Losing Information,” which included some non-cryptographic means of leaking secrets that are often overlooked by cryptographers. The second talk, “Cryptography - Myths and Realities,” was given by Adi Shamir, this year’s IACR Distinguished Lecturer. Shamir is the second person to receive this honor, the first having been Gus Simmons at Crypto ’94. These proceedings contain revised versions of the 36 contributed talks. Each paper was sent to at least three members of the program committee for c- ments. Revisions were not checked on their scientific aspects. Some authors will write final versions of their papers for publication in refereed journals. Of course, the authors bear full responsibility for the contents of their papers.

• Algorithmische Zahlentheorie
• Authentizität
• Cryptanalysis
• Key Escrow
• Kommunikationsprotokoll
• Kommunikationsprotokolle
• Kryptoanalysis
• Schlüsselhinterleg
• authentication
• communication protocols
• computational number theory
• cryptoanalysis
• cryptology
• combinatorics
• algorithm analysis and problem complexity

• IBM T.J. Watson Research Center, Yorktown Heights, USA

  Don Coppersmith