International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Papers from TCC 2008

Year
Venue
Title
2008
TCC
A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval
Iftach Haitner Jonathan J. Hoch Gil Segev
2008
TCC
A Survey of Game-Theoretic Approaches for the Design and Analysis of Protocols
★Invited talk
Jonathan Katz
2008
TCC
An Equivalence Between Zero Knowledge and Commitments
Shien Jin Ong Salil P. Vadhan
2008
TCC
Asymptotically Efficient Lattice-Based Digital Signatures
Vadim Lyubashevsky Daniele Micciancio
2008
TCC
Basing Weak Public-Key Cryptography on Strong One-Way Functions
Eli Biham Yaron J. Goren Yuval Ishai
2008
TCC
Black-Box Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One
Seung Geol Choi Dana Dachman-Soled Tal Malkin Hoeteck Wee
2008
TCC
Bridging Game Theory and Cryptography: Recent Results and Future Directions
Jonathan Katz
2008
TCC
Concurrent Non-malleable Commitments from Any One-Way Function
Huijia Lin Rafael Pass Muthuramakrishnan Venkitasubramaniam
2008
TCC
Cryptography and Game Theory: Designing Protocols for Exchanging Information
Gillat Kol Moni Naor
2008
TCC
Degradation and Amplification of Computational Hardness
Shai Halevi Tal Rabin
2008
TCC
Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries
Carmit Hazay Yehuda Lindell
2008
TCC
Equivocal Blind Signatures and Adaptive UC-Security
Aggelos Kiayias Hong-Sheng Zhou
2008
TCC
Fast Private Norm Estimation and Heavy Hitters
Joe Kilian André Madeira Martin J. Strauss Xuan Zheng
2008
TCC
Faster and Shorter Password-Authenticated Key Exchange
Rosario Gennaro
2008
TCC
General Properties of Quantum Zero-Knowledge Proofs
Hirotada Kobayashi
2008
TCC
How to Achieve Perfect Simulation and A Complete Problem for Non-interactive Perfect Zero-Knowledge
Lior Malka
2008
TCC
Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
★ TCC Test of Time Award
Paul Valiant
2008
TCC
Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model
André Chailloux Dragos Florin Ciocan Iordanis Kerenidis Salil P. Vadhan
2008
TCC
Lower Bounds on Implementing Robust and Resilient Mediators
Ittai Abraham Danny Dolev Joseph Y. Halpern
2008
TCC
Matroids Can Be Far from Ideal Secret Sharing
Amos Beimel Noam Livne Carles Padró
2008
TCC
MPC vs. SFE: Perfect Security in a Unified Corruption Model
Zuzana Beerliová-Trubíniová Matthias Fitzi Martin Hirt Ueli Maurer Vassilis Zikas
2008
TCC
Multi-property Preserving Combiners for Hash Functions
Marc Fischlin Anja Lehmann
2008
TCC
On Constant-Round Concurrent Zero-Knowledge
Rafael Pass Muthuramakrishnan Venkitasubramaniam
2008
TCC
On Seed-Incompressible Functions
Shai Halevi Steven Myers Charles Rackoff
2008
TCC
OT-Combiners via Secure Computation
Danny Harnik Yuval Ishai Eyal Kushilevitz Jesper Buus Nielsen
2008
TCC
P-signatures and Noninteractive Anonymous Credentials
Mira Belenkiy Melissa Chase Markulf Kohlweiss Anna Lysyanskaya
2008
TCC
Perfectly-Secure MPC with Linear Communication Complexity
★ TCC Test of Time Award
Zuzana Beerliová-Trubíniová Martin Hirt
2008
TCC
Randomness Extraction Via <i>delta</i> -Biased Masking in the Presence of a Quantum Attacker
Serge Fehr Christian Schaffner
2008
TCC
Randomness Extractors and their Cryptographic Applications
★Invited talk
Salil P. Vadhan
2008
TCC
Saving Private Randomness in One-Way Functions and Pseudorandom Generators
Nenad Dedic Danny Harnik Leonid Reyzin
2008
TCC
Semi-honest to Malicious Oblivious Transfer - The Black-Box Way
Iftach Haitner
2008
TCC
The Layered Games Framework for Specifications and Analysis of Security Protocols
Amir Herzberg Igal Yoffe
2008
TCC
The Round-Complexity of Black-Box Zero-Knowledge: A Combinatorial Characterization
Daniele Micciancio Scott Yilek
2008
TCC
Theory of Cryptography, Fifth Theory of Cryptography Conference, TCC 2008, New York, USA, March 19-21, 2008
2008
TCC
Universally Composable Multi-party Computation with an Unreliable Common Reference String
Vipul Goyal Jonathan Katz
2008
TCC
Verifiably Secure Devices
Sergei Izmalkov Matt Lepinski Silvio Micali
2008
TCC
Which Languages Have 4-Round Zero-Knowledge Proofs?
Jonathan Katz