Random Oracles -- The Random Oracle Model and the Ideal Cipher Model Are Equivalent -- Programmable Hash Functions and Their Applications -- Applications -- One-Time Programs -- Adaptive One-Way Functions and Applications -- Public-Key Crypto I -- Bits Security of the Elliptic Curve Diffie–Hellman Secret Keys -- Improved Bounds on Security Reductions for Discrete Log Based Signatures -- Circular-Secure Encryption from Decision Diffie-Hellman -- Public-Key Locally-Decodable Codes -- Hash Functions I -- Key-Recovery Attacks on Universal Hash Function Based MAC Algorithms -- Cryptanalysis of the GOST Hash Function -- Preimages for Reduced SHA-0 and SHA-1 -- Cryptanalysis I -- On the Power of Power Analysis in the Real World: A Complete Break of the KeeLoq Code Hopping Scheme -- Bug Attacks -- Multiparty Computation I -- Scalable Multiparty Computation with Nearly Optimal Work and Resilience -- Cryptographic Complexity of Multi-Party Computation Problems: Classifications and Separations -- Cryptanalysis II -- Cryptanalysis of MinRank -- New State Recovery Attack on RC4 -- Public-Key Crypto II -- Dynamic Threshold Public-Key Encryption -- On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles -- Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles -- Communication Complexity in Algebraic Two-Party Protocols -- Hash Functions II -- Beyond Uniformity: Better Security/Efficiency Tradeoffs for Compression Functions -- Compression from Collisions, or Why CRHF Combiners Have a Long Output -- Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers -- Distributed Private Data Analysis: Simultaneously Solving How and What -- New Efficient Attacks on Statistical Disclosure Control Mechanisms -- Multiparty Computation II -- Efficient Secure Linear Algebra in the Presence of Covert or Computationally Unbounded Adversaries -- Collusion-Free Protocols in the Mediated Model -- Efficient Constructions of Composable Commitments and Zero-Knowledge Proofs -- Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems -- A Framework for Efficient and Composable Oblivious Transfer -- Founding Cryptography on Oblivious Transfer – Efficiently.

This book constitutes the refereed proceedings of the 28th Annual International Cryptology Conference, CRYPTO 2008, held in Santa Barbara, CA, USA in August 2008. The 32 revised full papers presented were carefully reviewed and selected from 184 submissions. Addressing all current foundational, theoretical and research aspects of cryptology, cryptography, and cryptanalysis as well as advanced applications, the papers are organized in topical sections on random oracles, applications, public-key crypto, hash functions, cryptanalysis, multiparty computation, privacy, zero knowledge, and oblivious transfer.