International Association for Cryptologic Research

Publications by Conference

Advances in Cryptology - CRYPTO 2009, 29th Annual International Cryptology Conference

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