Cryptanalysis I

• 
  Alex Biryukov, Adi Shamir: Cryptanalytic Time/Memory/Data Tradeoffs for Stream Ciphers. 1-13
• 
  Glenn Durfee, Phong Q. Nguyen: Cryptanalysis of the RSA Schemes with Short Secret Exponent from Asiacrypt '99. 14-29
• 
  Dan Boneh, Antoine Joux, Phong Q. Nguyen: Why Textbook ElGamal and RSA Encryption Are Insecure. 30-43
• 
  Louis Goubin, Nicolas Courtois: Cryptanalysis of the TTM Cryptosystem. 44-57
• 
  Colin Boyd, Chris Pavlovski: Attacking and Repairing Batch Verification Schemes. 58-71

IACR Distinguished Lecture

• 
  Thomas A. Berson: Cryptography Everywhere. 72

Digital Signatures

• 
  Claus-Peter Schnorr, Markus Jakobsson: Security of Signed ElGamal Encryption. 73-89
• 
  Jean-Sébastien Coron, François Koeune, David Naccache: From Fixed-Length to Arbitrary-Length RSA Padding Schemes. 90-96
• 
  Adam L. Young, Moti Yung: Towards Signature-Only Signature Schemes. 97-115
• 
  Michel Abdalla, Leonid Reyzin: A New Forward-Secure Digital Signature Scheme. 116-129
• 
  Goichiro Hanaoka, Junji Shikata, Yuliang Zheng, Hideki Imai: Unconditionally Secure Digital Signature Schemes Admitting Transferability. 130-142

Protocols I

• 
  Martin Hirt, Ueli M. Maurer, Bartosz Przydatek: Efficient Secure Multi-party Computation. 143-161
• 
  Markus Jakobsson, Ari Juels: Mix and Match: Secure Function Evaluation via Ciphertexts. 162-177
• 
  Miyako Ohkubo, Masayuki Abe: A Length-Invariant Hybrid Mix. 178-191
• 
  Masashi Mitomo, Kaoru Kurosawa: Attack for Flash MIX. 192-204
• 
  Moni Naor, Benny Pinkas: Distributed Oblivious Transfer. 205-219

Number Theoretic Algorithms

• 
  Arjen K. Lenstra, Eric R. Verheul: Key Improvements to XTR. 220-233
• 
  Safuat Hamdy, Bodo Möller: Security of Cryptosystems Based on Class Groups of Imaginary Quadratic Orders. 234-247
• 
  Seigo Arita: Weil Descent of Elliptic Curves over Finite Fields of Characteristic Three. 248-258
• 
  Jinhui Chao, Kazuto Matsuo, Hiroto Kawashiro, Shigeo Tsujii: Construction of Hyperelliptic Curves with CM and Its Application to Cryptosystems. 259-273

Symmetric-Key Schemes I

• 
  Jaechul Sung, Sangjin Lee, Jong In Lim, Seokhie Hong, Sangjoon Park: Provable Security for the Skipjack-like Structure against Differential Cryptanalysis and Linear Cryptanalysis. 274-288
• 
  Shiho Moriai, Serge Vaudenay: On the Pseudorandomness of Top-Level Schemes of Block Ciphers. 289-302
• 
  Philip Hawkes, Gregory G. Rose: Exploiting Multiples of the Connection Polynomial in Word-Oriented Stream Ciphers. 303-316
• 
  Mihir Bellare, Phillip Rogaway: Encode-Then-Encipher Encryption: How to Exploit Nonces or Redundancy in Plaintexts for Efficient Cryptography. 317-330

Protocols II

• 
  Jan Camenisch, Ivan Damgård: Verifiable Encryption, Group Encryption, and Their Applications to Separable Group Signatures and Signature Sharing Schemes. 331-345
• 
  Markus Jakobsson, Ari Juels: Addition of ElGamal Plaintexts. 346-358
• 
  Brian King: Improved Methods to Perform Threshold RSA. 359-372
• 
  Matthew K. Franklin, Tomas Sander: Commital Deniable Proofs and Electronic Campaign Finance. 373-387
• 
  Wakaha Ogata, Kaoru Kurosawa: Provably Secure Metering Scheme. 388-398

Invited Lecture

• 
  Hideki Imai, Atsuhiro Yamagishi: CRYPTREC Project - Cryptographic Evaluation Project for the Japanese Electronic Government. 399-400

Fingerprinting

• 
  Birgit Pfitzmann, Ahmad-Reza Sadeghi: Anonymous Fingerprinting with Direct Non-repudiation. 401-414
• 
  Jan Camenisch: Efficient Anonymous Fingerprinting with Group Signatures. 415-428

Zero-Knowledge and Provable Security

• 
  Danny Gutfreund, Michael Ben-Or: Increasing the Power of the Dealer in Non-interactive Zero-Knowledge Proof Systems. 429-442
• 
  Satoshi Hada: Zero-Knowledge and Code Obfuscation. 443-457
• 
  Marc Fischlin: A Note on Security Proofs in the Generic Model. 458-469

Boolean Functions

• 
  Yuliang Zheng, Xian-Mo Zhang: On Relationships among Avalanche, Nonlinearity, and Correlation Immunity. 470-482

Cryptanalysis II

• 
  David Wagner: Cryptanalysis of the Yi-Lam Hash. 483-488
• 
  Mehdi-Laurent Akkar, Régis Bevan, Paul Dischamp, Didier Moyart: Power Analysis, What Is Now Possible.... 489-502

Pseudorandomness

• 
  Anand Desai, Sara K. Miner: Concrete Security Characterizations of PRFs and PRPs: Reductions and Applications. 503-516
• 
  Mihir Bellare, Alexandra Boldyreva: The Security of Chaffing and Winnowing. 517-530
• 
  Mihir Bellare, Chanathip Namprempre: Authenticated Encryption: Relations among Notions and Analysis of the Generic Composition Paradigm. 531-545
• 
  Michel Abdalla, Mihir Bellare: Increasing the Lifetime of a Key: A Comparative Analysis of the Security of Re-keying Techniques. 546-559
• 
  David Wagner, Ian Goldberg: Proofs of Security for the Unix Password Hashing Algorithm. 560-572

Public-Key Encryption and Key Distribution

• 
  Pascal Paillier: Trapdooring Discrete Logarithms on Elliptic Curves over Rings. 573-584
• 
  Pierre Loidreau: Strengthening McEliece Cryptosystem. 585-598
• 
  Philip D. MacKenzie, Sarvar Patel, Ram Swaminathan: Password-Authenticated Key Exchange Based on RSA. 599-613
• 
  Wen-Guey Tzeng, Zhi-Jia Tzeng: Round-Efficient Conference Key Agreement Protocols with Provable Security. 614-628

last updated on Mon May 20 01:44:27 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page