Advances in Cryptology — CRYPTO ’96: 16th Annual International Cryptology Conference Santa Barbara, California, USA August 18–22, 1996 Proceedings

Mihir Bellare, Ran Canetti, Hugo Krawczyk (auth.), Neal Koblitz (eds.)3540615121, 9783540615125

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.

---

Table of contents :
Front Matter….Pages I-XII
Keying Hash Functions for Message Authentication….Pages 1-15
Universal Hashing and Multiple Authentication….Pages 16-30
Universal Hash Functions from Exponential Sums over Finite Fields and Galois Rings….Pages 31-44
Asymmetric Cryptography with a Hidden Monomial….Pages 45-60
Anonymous Communication and Anonymous Cash….Pages 61-73
Weaknesses in Some Threshold Cryptosystems….Pages 74-82
Hidden Collisions on DSS….Pages 83-88
The Dark Side of “Black-Box” Cryptography or: Should We Trust Capstone?….Pages 89-103
Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems….Pages 104-113
All Bits in ax + b mod p are Hard….Pages 114-128
Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes….Pages 129-142
Security of 2 t -Root Identification and Signatures….Pages 143-156
Robust and Efficient Sharing of RSA Functions….Pages 157-172
New Generation of Secure and Practical RSA-Based Signatures….Pages 173-185
Proving Without Knowing: On Oblivious, Agnostic and Blindfolded Provers….Pages 186-200
Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing….Pages 201-215
Improved Differential Attacks on RC5….Pages 216-228
Improving Implementable Meet-in-the-Middle Attacks by Orders of Magnitude….Pages 229-236
Key-Schedule Cryptanalysis of IDEA, G-DES, GOST, SAFER, and Triple-DES….Pages 237-251
How to Protect DES Against Exhaustive Key Search….Pages 252-267
Diffie-Hellman Oracles….Pages 268-282
Algorithms for Black-Box Fields and their Application to Cryptography….Pages 283-297
Fast Hashing on the Pentium….Pages 298-312
On Fast and Provably Secure Message Authentication Based on Universal Hashing….Pages 313-328
Quantum Cryptography over Underground Optical Fibers….Pages 329-342
Quantum Key Distribution and String Oblivious Transfer in Noisy Channels….Pages 343-357
Linear Complexity of Periodic Sequences: A General Theory….Pages 358-371
Generalization of Siegenthaler Inequality and Schnorr-Vaudenay Multipermutations….Pages 372-386
Trade-offs Between Communication and Storage in Unconditionally Secure Schemes for Broadcast Encryption and Interactive Key Distribution….Pages 387-400
New Results on Visual Cryptography….Pages 401-415
Back Matter….Pages 417-417