CRYPTO 2000

Santa Barbara, California, USA

M. Bellare (Ed.): Advances in Cryptology - CRYPTO '00, 20th Annual International Cryptology Conference, Santa Barbara, California, USA, August 20-24, 2000. Proceedings. Lecture Notes in Computer Science Vol. 1880, Springer, 2000, ISBN 3-540-67907-3

Read the paper abstracts. More »

XTR and NTRU

• Arjen K. Lenstra and Eric R. Verheul: The XTR Public Key System p. 1
• Éliane Jaulmes and Antoine Joux: A Chosen-Ciphertext Attack against NTRU p. 20

Privacy for Databases

• Yevgeniy Dodis and Silvio Micali: Parallel Reducibility for Information-Theoretically Secure Computation
  p. 74
• Christian Cachin and Jan Camenisch: Optimistic Fair Secure Computation: (Extended Abstract) p. 93
• Yevgeniy Dodis, Shai Halevi, Tal Rabin: A Cryptographic Solution to a Game Theoretic Problem p. 112

Algebraic Cryptosystems

• Ingrid Biehl, Bernd Meyer, Volker Müller: Differential Fault Attacks on Elliptic Curve Cryptosystems: (Extended Abstract) p. 131
• Tatsuaki Okamoto, Keisuke Tanaka, Shigenori Uchiyama: Quantum Public-Key Cryptosystems p. 147
• Ki Hyoung Ko, Sang Jin Lee, Jung Hee Cheon, et al.: New Public-Key Cryptosystem Using Braid Groups p. 166

Message Authentication

• Don Coppersmith, Lars R. Knudsen, Chris J. Mitchell: Key Recovery and Forgery Attacks on the MacDES MAC Algorithm p. 184
• John Black and Phillip Rogaway: CBC MACs for Arbitrary-Length Messages:The Three-Key Constructions p. 197
• Michael Semanko: L-collision Attacks against Randomized MACs p. 216

Digital Signatures

• Jean-Sébastien Coron: On the Exact Security of Full Domain Hash p. 229
• Dan Boneh and Moni Naor: Timed Commitments: (Extended Abstract) p. 236
• Giuseppe Ateniese, Jan Camenisch, Marc Joye, et al.: A Practical and Provably Secure Coalition-Resistant Group Signature Scheme p. 255
• Masayuki Abe and Tatsuaki Okamoto: Provably Secure Partially Blind Signatures p. 271

Cryptanalysis

• Rainer Steinwandt, Markus Grassl, Willi Geiselmann, et al.: Weaknesses in the $\mathrm{SL}_2(\bbbf_{2^n})$ Hashing Scheme p. 287
• Thomas Johansson and Fredrik Jönsson: Fast Correlation Attacks through Reconstruction of Linear Polynomials p. 300

Traitor Tracing and Broadcast Encryption

• Reihaneh Safavi-Naini and Yejing Wang : Sequential Traitor Tracing p. 316
• Juan A. Garay, Jessica Staddon, Avishai Wool: Long-Lived Broadcast Encryption p. 333

Invited Talk

• Martín Abadi: Taming the Adversary p. 353

Symmetric Encryption

• Anand Desai: The Security of All-or-Nothing Encryption: Protecting against Exhaustive Key Search p. 359
• Zulfikar Ramzan and Leonid Reyzin: On the Round Security of Symmetric-Key Cryptographic Primitives p. 376
• Anand Desai: New Paradigms for Constructing Symmetric Encryption Schemes Secure against Chosen-Ciphertext Attack p. 394

To Commit or Not to Commit

• Marc Fischlin and Roger Fischlin: Efficient Non-malleable Commitment Schemes p. 413
• Ivan Damgård and Jesper Buus Nielsen: Improved Non-committing Encryption Schemes Based on a General Complexity Assumption p. 432

Protocols

• Alon Rosen: A Note on the Round-Complexity of Concurrent Zero-Knowledge p. 451
• Rosario Gennaro: An Improved Pseudo-random Generator Based on Discrete Log p. 469
• Nicolas Gisin and Stefan Wolf: Classical and Quantum Key Agreement: Is There "Bound Information"? p. 482

Stream Ciphers and Boolean Functions

• Muxiang Zhang and Agnes Chan: Maximum Correlation Analysis of Nonlinear S-boxes in Stream Ciphers p. 501
• Palash Sarkar and Subhamoy Maitra: Nonlinearity Bounds and Constructions of Resilient Boolean Functions p. 515
• Jürgen Bierbrauer and Holger Schellwat: Almost Independent and Weakly Biased Arrays: Efficient Constructions and Cryptologic Applications p. 533