Advances in Cryptology - CRYPTO 2000

Contents

• XTR and NTRU
• The XTR Public Key System
• Arjen K.Lenstra,Eric R.Verheul
• A Chosen-Ciphertext Attack against NTRU
• Eliane Jaulmes,Antoine Joux

• Privacy for Databases
• Privacy Preserving Data Mining
• Yehuda Lindell,Benny Pinkas
• Reducing the Servers Computation in Private Information Retrieval:
• PIR with Preprocessing
• Amos Beimel,Yuval Ishai,Tal Malkin

• Secure Distributed Computation and Applications
• Parallel Reducibilit for Information-Theoretically Secure Computation
• Yevgeniy Dodis,Silvio Micali
• Optimistic Fair Secure Computation
• Christian Cachin,Jan Camenisch
• A Cryptographic Solution to a Game Theoretic Problem
• Yevgeniy Dodis,Shai Halevi,Tal Rabin

• Algebraic Cryptosystems
• Differential Fault Attacks on Elliptic Curve Cryptosystems
• Ingrid Biehl,Bernd Meyer,Volker Muller
• Quantum Public-Key Cryptosystems
• Tatsuaki Okamoto,Keisuke Tanaka,Shigenori Uchiyama
• New Public-Key Cryptosystem Using Braid Groups
• Ki Hyoung Ko,Sang Jin Lee,Jung Hee Cheon,Jae Woo Han,
• Ju-sung Kang,Choonsik Park

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

• Digital Signatures
• On the Exact Securit of Full Domain Hash
• Jean-Sebastien Coron
• Timed Commitments
• Dan Boneh,Moni Naor
• A Practical and Provably
• Secure Coalition-Resistant Group Signature Scheme
• Giuseppe Ateniese,Jan Camenisch,Marc Joye,Gene Tsudik
• Provably Secure Partially Blind Signatures
• Masayuki Abe,Tatsuaki Okamoto

• Cryptanalysis
• Weaknesses in the SL 2 (IF 2 n )Hashing Scheme
• Rainer Steinwandt,Markus Grassl,Willi Geiselmann,Thomas Beth
• Fast Correlation Attacks through Reconstruction of Linear Polynomials
• Thomas Johansson,Fredrik Johansson

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

• Invited Talk
• Taming the Adversary
• Martin Abadi

• Symmetric Encryption
• The Securit of All-or-Nothing Encryption:
• Protecting against Exhaustive Key Search
• Anand Desai
• On the Round Securit of Symmetric-Key Cryptographic Primitives
• Zufikar Ramzan,Leonid Reyzin
• New Paradigms for Constructing Symmetric Encryption Schemes Secure
• against Chosen-Ciphertext Attack
• Anand Desai

• To Commit or Not to Commit
• Efficient Non-malleable Commitment Schemes
• Marc Fischlin,Roger Fischlin
• Improved Non-committing Encryption Schemes
• Based on a General Complexit Assumption
• Ivan Damgard,Jesper Buus Nielsen

• Protocols
• A Note on the Round-Complexit of Concurrent Zero-Knowledge
• Alon Rosen
• An Improved Pseudo-random Generator Based on Discrete Log
• Rosario Gennaro
• Linking Classical and Quantum Key Agreement:
• Is There "Bound Information "?
• Nicolas Gisin,Stefan Wolf

• Stream Ciphers and Boolean Functions
• Maximum Correlation Analysis of Nonlinear S-boxes in Stream Ciphers
• Muxiang Zhang,Agnes Chan
• Nonlinearit Bounds and Constructions of Resilient Boolean Functions
• Palash Sarkar,Subhamoy Maitra
• Almost Independent and Weakly Biased Arrays:
• Efficient Constructions and Cryptologic Applications
• Jurgen Bierbrauer,Holger Schellwat
• Author Index