CRYPTO 2008:

Random Oracles

• Jean-Sébastien Coron, Jacques Patarin, Yannick Seurin:
  The Random Oracle Model and the Ideal Cipher Model Are Equivalent, (.ps). 1-20
  BibTeX
• Dennis Hofheinz, Eike Kiltz:
  Programmable Hash Functions and Their Applications, (.ps), 21-38
  BibTeX

Applications

• Shafi Goldwasser, Yael Tauman Kalai, Guy N. Rothblum:
  One-Time Programs, (.ps), 39-56
  BibTeX
• Omkant Pandey, Rafael Pass, Vinod Vaikuntanathan:
  Adaptive One-Way Functions and Applications, (ps), 57-74
  BibTeX

Public-Key Crypto I

• Dimitar Jetchev, Ramarathnam Venkatesan:
  Bits Security of the Elliptic Curve Diffie-Hellman Secret Keys, (ps), 75-92
  BibTeX
• Sanjam Garg, Raghav Bhaskar, Satyanarayana V. Lokam:
  Improved Bounds on Security Reductions for Discrete Log Based Signatures, (ps), 93-107
  BibTeX
• Dan Boneh, Shai Halevi, Michael Hamburg, Rafail Ostrovsky:
  Circular-Secure Encryption from Decision Diffie-Hellman, (ps), 108-125
  BibTeX
• Brett Hemenway, Rafail Ostrovsky:
  Public-Key Locally-Decodable Codes, (ps), 126-143
  BibTeX

Hash Functions I

• Helena Handschuh, Bart Preneel:
  Key-Recovery Attacks on Universal Hash Function Based MAC Algorithms, (ps), 144-161
  BibTeX
• Florian Mendel, Norbert Pramstaller, Christian Rechberger, Marcin Kontak, Janusz Szmidt:
  Cryptanalysis of the GOST Hash Function, (ps), 162-178
  BibTeX
• Christophe De Cannière, Christian Rechberger:
  Preimages for Reduced SHA-0 and SHA-1, (ps), 179-202
  BibTeX

Cryptanalysis I

• Thomas Eisenbarth, Timo Kasper, Amir Moradi, Christof Paar, Mahmoud Salmasizadeh, Mohammad T. Manzuri Shalmani:
  On the Power of Power Analysis in the Real World: A Complete Break of the KeeLoqCode Hopping Scheme, (ps), 203-220
  BibTeX
• Eli Biham, Yaniv Carmeli, Adi Shamir:
  >Bug Attacks, (ps), 221-240
  BibTeX

Multiparty Computation I

• Ivan Damgård, Yuval Ishai, Mikkel Krøigaard, Jesper Buus Nielsen, Adam Smith:
  Scalable Multiparty Computation with Nearly Optimal Work and Resilience, (ps), 241-261
  BibTeX
• Manoj Prabhakaran, Mike Rosulek:
  Cryptographic Complexity of Multi-Party Computation Problems: Classifications and Separations, (ps), 262-279
  BibTeX

Cryptanalysis II

• Jean-Charles Faugère, Françoise Levy-dit-Vehel, Ludovic Perret:
  Cryptanalysis of MinRank, (ps), 280-296
  BibTeX
• Alexander Maximov, Dmitry Khovratovich:
  New State Recovery Attack on RC4, (ps), 297-316
  BibTeX

Public-Key Crypto II

• Cécile Delerablée, David Pointcheval:
  Dynamic Threshold Public-Key Encryption, (ps), 317-334
  BibTeX
• Alexandra Boldyreva, Serge Fehr, Adam O'Neill:
  On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles, (ps), 335-359
  BibTeX
• Mihir Bellare, Marc Fischlin, Adam O'Neill, Thomas Ristenpart:
  Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles, (ps), 360-378
  BibTeX
• Rafail Ostrovsky, William E. Skeith III:
  Communication Complexity in Algebraic Two-Party Protocols, (ps), 379-396
  BibTeX

Hash Functions II

• Martijn Stam:
  Beyond Uniformity: Better Security/Efficiency Tradeoffs for Compression Functions, (ps), 397-412
  BibTeX
• Krzysztof Pietrzak:
  Compression from Collisions, or Why CRHF Combiners Have a Long Output, (ps), 413-432
  BibTeX
• Phillip Rogaway, John P. Steinberger:
  Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers, (ps), 433-450
  BibTeX

Privacy

• Amos Beimel, Kobbi Nissim, Eran Omri:
  Distributed Private Data Analysis: Simultaneously Solving How and What, (ps), 451-468
  BibTeX
• Cynthia Dwork, Sergey Yekhanin:
  New Efficient Attacks on Statistical Disclosure Control Mechanisms, (ps), 469-480
  BibTeX

Multiparty Computation II

• Payman Mohassel, Enav Weinreb:
  Efficient Secure Linear Algebra in the Presence of Covert or Computationally Unbounded Adversaries, (ps), 481-496
  BibTeX
• Joël Alwen, Abhi Shelat, Ivan Visconti:
  Collusion-Free Protocols in the Mediated Model, (ps), 497-514
  BibTeX

Zero Knowledge

• Yevgeniy Dodis, Victor Shoup, Shabsi Walfish:
  Efficient Constructions of Composable Commitments and Zero-Knowledge Proofs, (ps), 515-535
  BibTeX
• Chris Peikert, Vinod Vaikuntanathan:
  Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems, (ps), 536-553
  BibTeX

Oblivious Transfer

• Chris Peikert, Vinod Vaikuntanathan, Brent Waters:
  A Framework for Efficient and Composable Oblivious Transfer, (ps), 554-571
  BibTeX
• Yuval Ishai, Manoj Prabhakaran, Amit Sahai:
  Founding Cryptography on Oblivious Transfer - Efficiently, (ps), 572-591
  BibTeX