Advances in Cryptology — CRYPTO ’96

1. Front Matter

   Pages I-XII

   PDF

2. Hashing and Authentication I

   1. Keying Hash Functions for Message Authentication

      • Mihir Bellare, Ran Canetti, Hugo Krawczyk

      Pages 1-15

   2. Universal Hashing and Multiple Authentication

      • M. Atici, D. R. Stinson

      Pages 16-30

   3. Universal Hash Functions from Exponential Sums over Finite Fields and Galois Rings

      • Tor Helleseth, Thomas Johansson

      Pages 31-44

3. New Systems

   1. Asymmetric Cryptography with a Hidden Monomial

      • Jacques Patarin

      Pages 45-60

   2. Anonymous Communication and Anonymous Cash

      • Daniel R. Simon

      Pages 61-73

4. Asymmetric Systems

   1. Weaknesses in Some Threshold Cryptosystems

      • Susan K. Langford

      Pages 74-82

   2. Hidden Collisions on DSS

      • Serge Vaudenay

      Pages 83-88

   3. The Dark Side of “Black-Box” Cryptography or: Should We Trust Capstone?

      • Adam Young, Moti Yung

      Pages 89-103

   4. Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems

      • Paul C. Kocher

      Pages 104-113

5. Hard Bits

   1. All Bits in ax + b mod p are Hard

      • Mats Näslund

      Pages 114-128

   2. Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes

      • Dan Boneh, Ramarathnam Venkatesan

      Pages 129-142

6. Signatures

   1. Security of 2t-Root Identification and Signatures

      • C. P. Schnorr

      Pages 143-156

   2. Robust and Efficient Sharing of RSA Functions

      • Rosario Gennaro, Stanisław Jarecki, Hugo Krawczyk, Tal Rabin

      Pages 157-172

   3. New Generation of Secure and Practical RSA-Based Signatures

      • Ronald Cramer, Ivan Damgård

      Pages 173-185

7. Zero Knowledge

   1. Proving Without Knowing: On Oblivious, Agnostic and Blindfolded Provers

      • Markus Jakobsson, Moti Yung

      Pages 186-200

   2. Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing

      • Shai Halevi, Silvio Micali

      Pages 201-215

8. Symmetric Systems

   1. Improved Differential Attacks on RC5

      • Lars R. Knudsen, Willi Meier

      Pages 216-228

   2. Improving Implementable Meet-in-the-Middle Attacks by Orders of Magnitude

      • Paul C. van Oorschot, Michael J. Wiener

      Pages 229-236

9. More on Symmetric Systems

   1. Key-Schedule Cryptanalysis of IDEA, G-DES, GOST, SAFER, and Triple-DES

      • John Kelsey, Bruce Schneier, David Wagner

      Pages 237-251

Crypto '96, the Sixteenth Annual Crypto Conference, is sponsored by the International Association for Cryptologic Research (IACR), in cooperation with the IEEE Computer Society Technical Committee on Security and P- vacy and the Computer Science Department of the University of California at Santa Barbara (UCSB). It takes place at UCSB from August 18 to 22, 1996. The General Chair, Richard Graveman, is responsible for local organization and registration. The scientific program was organized by the 16-member Program C- mittee. We considered 115 papers. (An additional 15 submissions had to be summarily rejected because of lateness or major noncompliance with the c- ditions in the Call for Papers.) Of these, 30 were accepted for presentation. In addition, there will be five invited talks by Ernest Brickell. Andrew Clark, Whitfield Diffie, Ronald Rivest, and Cliff Stoll. A Rump Session will be chaired by Stuart Haber. These proceedings contain the revised versions of the 30 contributed talks. least three com- The submitted version of each paper was examined by at mittee members and/or outside experts, and their comments were taken into account in the revisions. However, the authors (and not the committee) bear full responsibility for the content of their papers.

• Datenverschlüsselung
• Digitale Signaturen
• Kryptoanalyse
• Kryptographische Protokolle
• Quatencryptographi
• authentication
• cryptoanalysis
• cryptographic protocol
• cryptography
• cryptology
• data encryption
• digital signature
• digital signatures
• encryption
• algorithm analysis and problem complexity
• combinatorics

• Department of Mathematics Seattle, University of Washington, Washington, USA

  Neal Koblitz