IACR CRYPTO 2000: Santa Barbara, California, USA

---

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

This html page is provided courtesy of Michael Ley and his Computer Science Bibliography Database project.

The page numbers here are the "as published" numbers and are suitable for citations. The page numbers in the files linked from here may differ slightly.

---

Preface

XTR and NTRU

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

Privacy for Databases

• Yehuda Lindell, Benny Pinkas:
  Privacy Preserving Data Mining. 36-54
  BibTeX
• Amos Beimel, Yuval Ishai, Tal Malkin:
  Reducing the Servers Computation in Private Information Retrieval: PIR with Preprocessing. 55-73
  BibTeX

Secure Distributed Computation and Applications

• Yevgeniy Dodis, Silvio Micali:
  Parallel Reducibility for Information-Theoretically Secure Computation. 74-92
  BibTeX
• Christian Cachin, Jan Camenisch:
  Optimistic Fair Secure Computation. 93-111
  BibTeX
• Yevgeniy Dodis, Shai Halevi, Tal Rabin:
  A Cryptographic Solution to a Game Theoretic Problem. 112-130
  BibTeX

Algebraic Cryptosystems

• Ingrid Biehl, Bernd Meyer, Volker Müller:
  Differential Fault Attacks on Elliptic Curve Cryptosystems. 131-146
  BibTeX
• Tatsuaki Okamoto, Keisuke Tanaka, Shigenori Uchiyama:
  Quantum Public-Key Cryptosystems. 147-165
  BibTeX
• Ki Hyoung Ko, Sangjin Lee, Jung Hee Cheon, Jae Woo Han, Ju-Sung Kang, Choonsik Park:
  New Public-Key Cryptosystem Using Braid Groups. 166-183
  BibTeX

Message Authentication

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

Digital Signatures

• Jean-Sébastien Coron:
  On the Exact Security of Full Domain Hash. 229-235
  BibTeX
• Dan Boneh, Moni Naor:
  Timed Commitments. 236-254
  BibTeX
• Giuseppe Ateniese, Jan Camenisch, Marc Joye, Gene Tsudik:
  A Practical and Provably Secure Coalition-Resistant Group Signature Scheme. 255-270
  BibTeX
• Masayuki Abe, Tatsuaki Okamoto:
  Provably Secure Partially Blind Signatures. 271-286
  BibTeX

Cryptanalysis

• Rainer Steinwandt, Markus Grassl, Willi Geiselmann, Thomas Beth:
  Weaknesses in the SL₂(IF_s²) Hashing Scheme. 287-299
  BibTeX
• Thomas Johansson, Fredrik Jönsson:
  Fast Correlation Attacks through Reconstruction of Linear Polynomials. 300-315
  BibTeX

Traitor Tracing and Broadcast Encryption

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

Invited Talk

• Martín Abadi:
  Taming the Adversary. 353-358
  BibTeX

Symmetric Encryption

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

To Commit or Not to Commit

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

Protocols

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

Stream Ciphers and Boolean Functions

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

---

Copyright © , IACR