International Association for Cryptologic Research

Publications by Conference

Theory of Cryptography, Fifth Theory of Cryptography Conference, TCC 2008, New York, USA, March 19-21, 2008.

Preface and frontmatter

Page	Title
1-18	Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
19-36	On Seed-Incompressible Functions
37-54	Asymptotically Efficient Lattice-Based Digital Signatures
55-72	Basing Weak Public-Key Cryptography on Strong One-Way Functions
73-88	Which Languages Have 4-Round Zero-Knowledge Proofs?
89-106	How to Achieve Perfect Simulation and A Complete Problem for Non-interactive Perfect Zero-Knowledge
107-124	General Properties of Quantum Zero-Knowledge Proofs
125-141	The Layered Games Framework for Specifications and Analysis of Security Protocols
142-154	Universally Composable Multi-party Computation with an Unreliable Common Reference String
155-175	Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries
176-193	Fast Private Norm Estimation and Heavy Hitters
194-212	Matroids Can Be Far from Ideal Secret Sharing
213-230	Perfectly-Secure MPC with Linear Communication Complexity
231-250	MPC vs. SFE: Perfect Security in a Unified Corruption Model
251-272	Bridging Game Theory and Cryptography: Recent Results and Future Directions
273-301	Verifiably Secure Devices
302-319	Lower Bounds on Implementing Robust and Resilient Mediators
320-339	Cryptography and Game Theory: Designing Protocols for Exchanging Information
340-355	Equivocal Blind Signatures and Adaptive UC-Security
356-374	P-signatures and Noninteractive Anonymous Credentials
375-392	Multi-property Preserving Combiners for Hash Functions
393-411	OT-Combiners via Secure Computation
412-426	Semi-honest to Malicious Oblivious Transfer - The Black-Box Way
427-444	Black-Box Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One
445-464	A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval
465-481	Randomness Extraction Via delta -Biased Masking in the Presence of a Quantum Attacker
482-500	An Equivalence Between Zero Knowledge and Commitments
501-534	Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model
535-552	The Round-Complexity of Black-Box Zero-Knowledge: A Combinatorial Characterization
553-570	On Constant-Round Concurrent Zero-Knowledge
571-588	Concurrent Non-malleable Commitments from Any One-Way Function
589-606	Faster and Shorter Password-Authenticated Key Exchange
607-625	Saving Private Randomness in One-Way Functions and Pseudorandom Generators
626-643	Degradation and Amplification of Computational Hardness