5. TCC 2008:
New York,
NY,
USA
Ran Canetti (Ed.):
Theory of Cryptography, Fifth Theory of Cryptography Conference, TCC 2008, New York, USA, March 19-21, 2008.
Lecture Notes in Computer Science 4948 Springer 2008, ISBN 978-3-540-78523-1 BibTeX
- Paul Valiant:
Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency.
1-18
Electronic Edition (link) BibTeX
- Shai Halevi, Steven Myers, Charles Rackoff:
On Seed-Incompressible Functions.
19-36
Electronic Edition (link) BibTeX
- Vadim Lyubashevsky, Daniele Micciancio:
Asymptotically Efficient Lattice-Based Digital Signatures.
37-54
Electronic Edition (link) BibTeX
- Eli Biham, Yaron J. Goren, Yuval Ishai:
Basing Weak Public-Key Cryptography on Strong One-Way Functions.
55-72
Electronic Edition (link) BibTeX
- Jonathan Katz:
Which Languages Have 4-Round Zero-Knowledge Proofs?
73-88
Electronic Edition (link) BibTeX
- Lior Malka:
How to Achieve Perfect Simulation and A Complete Problem for Non-interactive Perfect Zero-Knowledge.
89-106
Electronic Edition (link) BibTeX
- Hirotada Kobayashi:
General Properties of Quantum Zero-Knowledge Proofs.
107-124
Electronic Edition (link) BibTeX
- Amir Herzberg, Igal Yoffe:
The Layered Games Framework for Specifications and Analysis of Security Protocols.
125-141
Electronic Edition (link) BibTeX
- Vipul Goyal, Jonathan Katz:
Universally Composable Multi-party Computation with an Unreliable Common Reference String.
142-154
Electronic Edition (link) BibTeX
- Carmit Hazay, Yehuda Lindell:
Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries.
155-175
Electronic Edition (link) BibTeX
- Joe Kilian, André Madeira, Martin J. Strauss, Xuan Zheng:
Fast Private Norm Estimation and Heavy Hitters.
176-193
Electronic Edition (link) BibTeX
- Amos Beimel, Noam Livne, Carles Padró:
Matroids Can Be Far from Ideal Secret Sharing.
194-212
Electronic Edition (link) BibTeX
- Zuzana Beerliová-Trubíniová, Martin Hirt:
Perfectly-Secure MPC with Linear Communication Complexity.
213-230
Electronic Edition (link) BibTeX
- Zuzana Beerliová-Trubíniová, Matthias Fitzi, Martin Hirt, Ueli M. Maurer, Vassilis Zikas:
MPC vs. SFE: Perfect Security in a Unified Corruption Model.
231-250
Electronic Edition (link) BibTeX
- Jonathan Katz:
Bridging Game Theory and Cryptography: Recent Results and Future Directions.
251-272
Electronic Edition (link) BibTeX
- Sergei Izmalkov, Matt Lepinski, Silvio Micali:
Verifiably Secure Devices.
273-301
Electronic Edition (link) BibTeX
- Ittai Abraham, Danny Dolev, Joseph Y. Halpern:
Lower Bounds on Implementing Robust and Resilient Mediators.
302-319
Electronic Edition (link) BibTeX
- Gillat Kol, Moni Naor:
Cryptography and Game Theory: Designing Protocols for Exchanging Information.
320-339
Electronic Edition (link) BibTeX
- Aggelos Kiayias, Hong-Sheng Zhou:
Equivocal Blind Signatures and Adaptive UC-Security.
340-355
Electronic Edition (link) BibTeX
- Mira Belenkiy, Melissa Chase, Markulf Kohlweiss, Anna Lysyanskaya:
P-signatures and Noninteractive Anonymous Credentials.
356-374
Electronic Edition (link) BibTeX
- Marc Fischlin, Anja Lehmann:
Multi-property Preserving Combiners for Hash Functions.
375-392
Electronic Edition (link) BibTeX
- Danny Harnik, Yuval Ishai, Eyal Kushilevitz, Jesper Buus Nielsen:
OT-Combiners via Secure Computation.
393-411
Electronic Edition (link) BibTeX
- Iftach Haitner:
Semi-honest to Malicious Oblivious Transfer - The Black-Box Way.
412-426
Electronic Edition (link) BibTeX
- Seung Geol Choi, Dana Dachman-Soled, Tal Malkin, Hoeteck Wee:
Black-Box Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One.
427-444
Electronic Edition (link) BibTeX
- Iftach Haitner, Jonathan J. Hoch, Gil Segev:
A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval.
445-464
Electronic Edition (link) BibTeX
- Serge Fehr, Christian Schaffner:
Randomness Extraction Via delta -Biased Masking in the Presence of a Quantum Attacker.
465-481
Electronic Edition (link) BibTeX
- Shien Jin Ong, Salil P. Vadhan:
An Equivalence Between Zero Knowledge and Commitments.
482-500
Electronic Edition (link) BibTeX
- André Chailloux, Dragos Florin Ciocan, Iordanis Kerenidis, Salil P. Vadhan:
Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model.
501-534
Electronic Edition (link) BibTeX
- Daniele Micciancio, Scott Yilek:
The Round-Complexity of Black-Box Zero-Knowledge: A Combinatorial Characterization.
535-552
Electronic Edition (link) BibTeX
- Rafael Pass, Muthuramakrishnan Venkitasubramaniam:
On Constant-Round Concurrent Zero-Knowledge.
553-570
Electronic Edition (link) BibTeX
- Huijia Lin, Rafael Pass, Muthuramakrishnan Venkitasubramaniam:
Concurrent Non-malleable Commitments from Any One-Way Function.
571-588
Electronic Edition (link) BibTeX
- Rosario Gennaro:
Faster and Shorter Password-Authenticated Key Exchange.
589-606
Electronic Edition (link) BibTeX
- Nenad Dedic, Danny Harnik, Leonid Reyzin:
Saving Private Randomness in One-Way Functions and Pseudorandom Generators.
607-625
Electronic Edition (link) BibTeX
- Shai Halevi, Tal Rabin:
Degradation and Amplification of Computational Hardness.
626-643
Electronic Edition (link) BibTeX
Copyright © Sat May 16 23:43:38 2009
by Michael Ley (ley@uni-trier.de)
