Search
International Association for Cryptologic Research
What's new
Archive
Best Papers
Videos
Authors
Coauthors
By year
By conference
All Committees
Most Committees
Report errors
Maps
About
Publications of tcc 2005
Preface and frontmatter
Page
Title
1-16
Optimal Error Correction Against Computationally Bounded Noise
17-33
Hardness Amplification of Weakly Verifiable Puzzles
34-49
On Hardness Amplification of One-Way Functions
50-65
Cryptography in Subgroups of Z
n
66-85
Efficiently Constructible Huge Graphs That Preserve First Order Properties of Random Graphs
86-103
Comparing Two Notions of Simulatability
104-127
Relaxing Environmental Security: Monitored Functionalities and Client-Server Computation
128-149
Handling Expected Polynomial-Time Strategies in Simulation-Based Security Proofs
150-168
Adaptively-Secure, Non-interactive Public-Key Encryption
169-187
Adaptive Security of Symbolic Encryption
188-209
Chosen-Ciphertext Security of Multiple Encryption
210-226
Public-Key Steganography with Active Attacks
227-244
Upper and Lower Bounds on Black-Box Steganography
245-263
Fair-Zero Knowledge
264-282
How to Securely Outsource Cryptographic Computations
283-302
Secure Computation of the Mean and Related Statistics
303-324
Keyword Search and Oblivious Pseudorandom Functions
325-341
Evaluating 2-DNF Formulas on Ciphertexts
342-362
Share Conversion, Pseudorandom Secret-Sharing and Applications to Secure Computation
363-385
Toward Privacy in Public Databases
386-406
The Universal Composable Security of Quantum Key Distribution
407-425
Universally Composable Privacy Amplification Against Quantum Adversaries
426-444
A Universally Composable Secure Channel Based on the KEM-DEM Framework
445-456
Sufficient Conditions for Collision-Resistant Hashing
457-475
The Relationship Between Password-Authenticated Key Exchange and Other Cryptographic Primitives
476-494
On the Relationships Between Notions of Simulation-Based Security
495-509
A New Cramer-Shoup Like Methodology for Group Based Provably Secure Encryption Schemes
510-528
Further Simplifications in Proactive RSA Signatures
529-555
Proof of Plaintext Knowledge for the Ajtai-Dwork Cryptosystem
556-577
Entropic Security and the Encryption of High Entropy Messages
578-599
Error Correction in the Bounded Storage Model
600-619
Characterizing Ideal Weighted Threshold Secret Sharing