Publications of CRYPTO 2008

Preface and frontmatter

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