XTR and NTRU

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

Privacy for Databases

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

Secure Distributed Computation and Applications

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

Algebraic Cryptosystems

• 
  Ingrid Biehl, Bernd Meyer, Volker Müller: Differential Fault Attacks on Elliptic Curve Cryptosystems. 131-146
• 
  Tatsuaki Okamoto, Keisuke Tanaka, Shigenori Uchiyama: Quantum Public-Key Cryptosystems. 147-165
• 
  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

Message Authentication

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

Digital Signatures

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

Cryptanalysis

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

Traitor Tracing and Broadcast Encryption

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

Invited Talk

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

Symmetric Encryption

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

To Commit or Not to Commit

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

Protocols

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

Stream Ciphers and Boolean Functions

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

last updated on Wed May 22 04:25:13 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page