CRYPTO 1996

Santa Barbara, California, USA

Neal Koblitz (Ed.): Advances in Cryptology - CRYPTO '96, 16th Annual International Cryptology Conference, Santa Barbara, California, USA, August 18-22, 1996, Proceedings. Lecture Notes in Computer Science, Vol. 1109, Springer, 1996, ISBN 3-540-61512-1

Hashing and Authentication I

• Mihir Bellare, Ran Canetti, Hugo Krawczyk: Keying Hash Functions for Message Authentication. 1-15
• M. Atici, Douglas R. Stinson: Universal Hashing and Multiple Authentication. 16-30
• Tor Helleseth, Thomas Johansson: Universal Hash Functions from Exponential Sums over Finite Fields and Galois Rings. 31-44

New Systems

• Jacques Patarin: Asymmetric Cryptography with a Hidden Monomial. 45-60
• Daniel R. Simon: Anonymous Communication and Anonymous Cash. 61-73

Cryptanalysis I: Aysmmetric Systems

• Susan K. Langford: Weakness in Some Threshold Cryptosystems. 74-82
• Serge Vaudenay: Hidden Collisions on DSS. 83-88
• Adam Young, Moti Yung: The Dark Side of "Black-Box" Cryptography, or: Should We Trust Capstone? 89-103
• Paul C. Kocher: Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems. 104-113

Hard Bits

• Mats Näslund: All Bits ax+b mod p are Hard (Extended Abstract). 114-128
• Dan Boneh, Ramarathnam Venkatesan: Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes. 129-142

Signatures

• Claus-Peter Schnorr: Security of 2^t-Root Identification and Signatures. 143-156
• Rosario Gennaro, Stanislaw Jarecki, Hugo Krawczyk, Tal Rabin: Robust and Efficient Sharing of RSA Functions. 157-172
• Ronald Crames, Ivan Damgård: New Generation of Secure and Practical RSA-Based Signatures. 173-185

Zero Knowledge

• Markus Jakobsson, Moti Yung: Proving Without Knowing: On Oblivious, Agnostic and Blindolded Provers. 186-200
• Shai Halevi, Silvio Micali: Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing. 201-215

Cryptanalysis II: Symmetric Systems

• Lars R. Knudsen, Willi Meier: Improved Differential Attacks on RC5. 216-228
• Paul C. van Oorschot, Michael J. Wiener: Improving Implementable Meet-in-the-Middle Attacks by Orders of Magnitude. 229-236

More on Symmetric Systems

• John Kelsey, Bruce Schneider, David Wagner: Key-Schedule Cryptanalysis of IDEA, G-DES, GOST, SAFER, and Triple-DES. Or here. 237-251
• Joe Kilian, Phillip Rogaway: How to Protect DES Against Exhaustive Key Search. Also here. Or just the abstract. 252-267

Diffie-Hellman Oracle

• Ueli M. Maurer, Stefan Wolf: Diffie-Hellman Oracles. For related papers try here. 268-282
• Dan Boneh, Richard J. Lipton: Algorithms for Black-Box Fields and their Application to Cryptography (Extended Abstract). 283-297

Hashing and Authentication II

• Antoon Bosselaers, René Govaerts, Joos Vandewalle: Fast Hashing on the Pentium. 298-312
• Victor Shoup: On Fast and Provably Secure Message Authentication Based on Universal Hashing. 313-328

Quantum Crypto

• R. J. Hughes, G. G. Luther, G. L. Morgan, C. G. Peterson, C. Simmons: Quantum Cryptography over Underground Optical Fibers. Related info here. 329-342
• Dominic Mayers: Quantum Key Distribution and String Oblivious Transfer in Noisy Channels. 343-357

Stream Ciphers

• James L. Massey, Shirlei Serconek: Linear Complexity of Periodic Sequences: A General Theory. 358-371
• Paul Camion, Anne Canteaut: Generalization of Siegenthaler Inequality and Schnorr-Vaudenay Multipermutations. 372-386

Secret Sharing

• Carlo Blundo, Luiz A. Frota Mattos, Douglas R. Stinson: Trade-offs Between Communication and Storage in Unconditionally Secure Schemes for Broadcast Encryption and Interactive Key Distribution. 387-400
• Stefan Droste: New Results on Visual Cryptography. General info on visual crypto here. 401-415

Rump Session

• Marc Joye and Jean-Jacques Quisquater: On the importance of securing your bins: The garbage-man-in-the-middle attack.