Search
International Association for Cryptologic Research
What's new
Archive
Paper awards
Videos
Authors
Coauthors
By year
By venue
All Committees
Most Committees
Report errors
About
Publications of Tcc 2006
Preface and frontmatter
Page
Title
1-20
Concurrent Zero Knowledge Without Complexity Assumptions
21-40
Interactive Zero-Knowledge with Restricted Random Oracles
41-59
Non-interactive Zero-Knowledge from Homomorphic Encryption
60-79
Ring Signatures: Stronger Definitions, and Constructions Without Random Oracles
80-99
Efficient Blind and Partially Blind Signatures Without Random Oracles
100-119
Key Exchange Using Passwords and Long Keys
120-144
Mercurial Commitments: Minimal Assumptions and Efficient Constructions
145-166
Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices
167-183
On Error Correction in the Exponent
184-206
On the Relation Between the Ideal Cipher and the Random Oracle Models
207-224
Intrusion-Resilience Via the Bounded-Storage Model
225-244
Perfectly Secure Password Protocols in the Bounded Retrieval Model
245-264
Polylogarithmic Private Approximations and Efficient Matching
265-284
Calibrating Noise to Sensitivity in Private Data Analysis
285-304
Unconditionally Secure Constant-Rounds Multi-party Computation for Equality, Comparison, Bits and Exponentiation
305-328
Efficient Multi-party Computation with Dispute Control
329-342
Round-Optimal and Efficient Verifiable Secret Sharing
343-359
Generalized Environmental Security from Number Theoretic Assumptions
360-379
Games and the Impossibility of Realizable Ideal Functionality
380-403
Universally Composable Symbolic Analysis of Mutual Authentication and Key-Exchange Protocols
404-428
Resource Fairness and Composability of Cryptographic Protocols
429-442
Finding Pessiland
443-461
Pseudorandom Generators from One-Way Functions: A Simple Construction for Any Hardness
462-481
On the Complexity of Parallel Hardness Amplification for One-Way Functions
482-501
On Matroids and Non-ideal Secret Sharing
502-521
Secure Computation with Partial Message Loss
522-541
Communication Efficient Secure Linear Algebra
542-560
Threshold and Proactive Pseudo-Random Permutations
561-580
PRF Domain Extension Using DAGs
581-600
Chosen-Ciphertext Security from Tag-Based Encryption
601-616
Separating Sources for Encryption and Secret Sharing