Advances in Cryptology – CRYPTO 2008: 28th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 17-21, 2008. Proceedings

Front Matter....Pages -
The Random Oracle Model and the Ideal Cipher Model Are Equivalent....Pages 1-20
Programmable Hash Functions and Their Applications....Pages 21-38
One-Time Programs....Pages 39-56
Adaptive One-Way Functions and Applications....Pages 57-74
Bits Security of the Elliptic Curve Diffie–Hellman Secret Keys....Pages 75-92
Improved Bounds on Security Reductions for Discrete Log Based Signatures....Pages 93-107
Circular-Secure Encryption from Decision Diffie-Hellman....Pages 108-125
Public-Key Locally-Decodable Codes....Pages 126-143
Key-Recovery Attacks on Universal Hash Function Based MAC Algorithms....Pages 144-161
Cryptanalysis of the GOST Hash Function....Pages 162-178
Preimages for Reduced SHA-0 and SHA-1....Pages 179-202
On the Power of Power Analysis in the Real World: A Complete Break of the KeeLoq Code Hopping Scheme....Pages 203-220
Bug Attacks....Pages 221-240
Scalable Multiparty Computation with Nearly Optimal Work and Resilience....Pages 241-261
Cryptographic Complexity of Multi-Party Computation Problems: Classifications and Separations....Pages 262-279
Cryptanalysis of MinRank....Pages 280-296
New State Recovery Attack on RC4....Pages 297-316
Dynamic Threshold Public-Key Encryption....Pages 317-334
On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles....Pages 335-359
Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles....Pages 360-378
Communication Complexity in Algebraic Two-Party Protocols....Pages 379-396
Beyond Uniformity: Better Security/Efficiency Tradeoffs for Compression Functions....Pages 397-412
Compression from Collisions, or Why CRHF Combiners Have a Long Output....Pages 413-432
Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers....Pages 433-450
Distributed Private Data Analysis: Simultaneously Solving How and What....Pages 451-468
New Efficient Attacks on Statistical Disclosure Control Mechanisms....Pages 469-480
Efficient Secure Linear Algebra in the Presence of Covert or Computationally Unbounded Adversaries....Pages 481-496
Collusion-Free Protocols in the Mediated Model....Pages 497-514
Efficient Constructions of Composable Commitments and Zero-Knowledge Proofs....Pages 515-535
Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems....Pages 536-553
A Framework for Efficient and Composable Oblivious Transfer....Pages 554-571
Founding Cryptography on Oblivious Transfer – Efficiently....Pages 572-591
Back Matter....Pages -