Advances in Cryptology - CRYPTO 2009: 29th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 16-20, 2009. Proceedings

Front Matter....Pages -
Reconstructing RSA Private Keys from Random Key Bits....Pages 1-17
Public-Key Cryptosystems Resilient to Key Leakage....Pages 18-35
Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model....Pages 36-54
Short Chosen-Prefix Collisions for MD5 and the Creation of a Rogue CA Certificate....Pages 55-69
Meet-in-the-Middle Preimage Attacks Against Reduced SHA-0 and SHA-1....Pages 70-89
Private Mutual Authentication and Conditional Oblivious Transfer....Pages 90-107
Randomizable Proofs and Delegatable Anonymous Credentials....Pages 108-125
Computational Differential Privacy....Pages 126-142
Probabilistically Checkable Arguments....Pages 143-159
On the Composition of Public-Coin Zero-Knowledge Protocols....Pages 160-176
On the Amortized Complexity of Zero-Knowledge Protocols....Pages 177-191
Linear Algebra with Sub-linear Zero-Knowledge Arguments....Pages 192-208
New Birthday Attacks on Some MACs Based on Block Ciphers....Pages 209-230
Distinguisher and Related-Key Attack on the Full AES-256....Pages 231-249
Cryptanalysis of C2....Pages 250-266
Message Authentication Codes from Unpredictable Block Ciphers....Pages 267-285
How to Encipher Messages on a Small Domain....Pages 286-302
How to Hash into Elliptic Curves....Pages 303-316
Batch Binary Edwards....Pages 317-336
Solving Hidden Number Problem with One Bit Oracle and Advice....Pages 337-354
Computational Indistinguishability Amplification: Tight Product Theorems for System Composition....Pages 355-373
Merkle Puzzles Are Optimal — An O ( n 2 )-Query Attack on Any Key Exchange from a Random Oracle....Pages 374-390
Position Based Cryptography....Pages 391-407
Improving the Security of Quantum Protocols via Commit-and-Open....Pages 408-427
Practical Cryptanalysis of iso/iec 9796-2 and emv Signatures....Pages 428-444
How Risky Is the Random-Oracle Model?....Pages 445-464
Abstraction in Cryptography....Pages 465-465
Asymptotically Good Ideal Linear Secret Sharing with Strong Multiplication over Any Fixed Finite Field....Pages 466-486
The Round Complexity of Verifiable Secret Sharing Revisited....Pages 487-504
Somewhat Non-committing Encryption and Efficient Adaptively Secure Oblivious Transfer....Pages 505-523
Collusion-Free Multiparty Computation in the Mediated Model....Pages 524-540
Privacy-Enhancing Auctions Using Rational Cryptography....Pages 541-558
Utility Dependence in Correct and Fair Rational Secret Sharing....Pages 559-576
On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem....Pages 577-594
Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems....Pages 595-618
Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions....Pages 619-636
The Group of Signed Quadratic Residues and Applications....Pages 637-653
Short and Stateless Signatures from the RSA Assumption....Pages 654-670
Smooth Projective Hashing for Conditionally Extractable Commitments....Pages 671-689
Back Matter....Pages -