International Association for Cryptologic Research

Publications by Conference

Advances in Cryptology - CRYPTO 2005: 25th Annual International Cryptology Conference, Santa Barbara, California, USA, August 14-18, 2005, Proceedings

Preface and frontmatter

Page	Title
1-16	Efficient Collision Search Attacks on SHA-0
17-36	Finding Collisions in the Full SHA-1
37-54	Pebbling and Proofs of Work
55-65	Composition Does Not Imply Adaptive Security
66-85	On the Discrete Logarithm Problem on Algebraic Tori
86-96	A Practical Attack on a Braid Group Based Cryptographic Protocol
97-117	The Conditional Correlation Attack: A Practical Attack on Bluetooth Encryption
118-134	Unconditional Characterizations of Non-interactive Zero-Knowledge
135-151	Impossibility and Feasibility Results for Zero Knowledge with Public Keys
152-168	Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors
169-187	A Formal Treatment of Onion Routing
188-204	Simple and Efficient Shuffling with Provable Correctness and ZK Privacy
205-222	Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions
223-240	Private Searching on Streaming Data
241-257	Privacy-Preserving Set Operations
258-275	Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys
276-292	Generic Transformation for Scalable Broadcast Encryption Schemes
293-308	Authenticating Pervasive Devices with Human Protocols
309-326	Secure Communications over Insecure Channels Based on Short Authenticated Strings
327-343	On Codes, Matroids and Secure Multi-party Computation from Linear Secret Sharing Schemes
344-360	Black-Box Secret Sharing from Primitive Sets in Algebraic Number Fields
361-377	Secure Computation Without Authentication
378-394	Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
395-411	Secure Computation of Constant-Depth Circuits with Applications to Database Search Problems
412-429	Analysis of Random Oracle Instantiation Scenarios for OAEP and Other Practical Schemes
430-448	Merkle-Damgård Revisited: How to Construct a Hash Function
449-466	On the Generic Insecurity of the Full Domain Hash
467-477	New Monotones and Lower Bounds in Unconditional Two-Party Computation
478-493	One-Way Secret-Key Agreement and Applications to Circuit Polarization and Immunization of Public-Key Encryption
494-510	A Quantum Cipher with Near Optimal Key-Recycling
511-526	An Efficient CDH-Based Signature Scheme with a Tight Security Reduction
527-545	Improved Security Analyses for CBC MACs
546-566	HMQV: A High-Performance Secure Diffie-Hellman Protocol