28. CRYPTO 2008: Santa Barbara, California, USA

Random Oracles

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

Applications

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

Public-Key Crypto I

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

Hash Functions I

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

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. 203-220
  
• Eli Biham, Yaniv Carmeli, Adi Shamir:
  Bug Attacks. 221-240
  

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. 241-261
  
• Manoj Prabhakaran, Mike Rosulek:
  Cryptographic Complexity of Multi-Party Computation Problems: Classifications and Separations. 262-279
  

Cryptanalysis II

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

Public-Key Crypto II

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

Hash Functions II

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

Privacy

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

Multiparty Computation II

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

Zero Knowledge

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

Oblivious Transfer

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