International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Papers from TCC 2006

Year
Venue
Title
2006
TCC
Calibrating Noise to Sensitivity in Private Data Analysis
★ TCC Test of Time Award
Cynthia Dwork Frank McSherry Kobbi Nissim Adam Smith
2006
TCC
Chosen-Ciphertext Security from Tag-Based Encryption
Eike Kiltz
2006
TCC
Communication Efficient Secure Linear Algebra
Kobbi Nissim Enav Weinreb
2006
TCC
Concurrent Zero Knowledge Without Complexity Assumptions
Daniele Micciancio Shien Jin Ong Amit Sahai Salil P. Vadhan
2006
TCC
Efficient Blind and Partially Blind Signatures Without Random Oracles
Tatsuaki Okamoto
2006
TCC
Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices
★ TCC Test of Time Award
Chris Peikert Alon Rosen
2006
TCC
Efficient Multi-party Computation with Dispute Control
Zuzana Beerliová-Trubíniová Martin Hirt
2006
TCC
Finding Pessiland
Hoeteck Wee
2006
TCC
Games and the Impossibility of Realizable Ideal Functionality
Anupam Datta Ante Derek John C. Mitchell Ajith Ramanathan Andre Scedrov
2006
TCC
Generalized Environmental Security from Number Theoretic Assumptions
Tal Malkin Ryan Moriarty Nikolai Yakovenko
2006
TCC
Interactive Zero-Knowledge with Restricted Random Oracles
Moti Yung Yunlei Zhao
2006
TCC
Intrusion-Resilience Via the Bounded-Storage Model
Stefan Dziembowski
2006
TCC
Key Exchange Using Passwords and Long Keys
Vladimir Kolesnikov Charles Rackoff
2006
TCC
Mercurial Commitments: Minimal Assumptions and Efficient Constructions
Dario Catalano Yevgeniy Dodis Ivan Visconti
2006
TCC
Non-interactive Zero-Knowledge from Homomorphic Encryption
Ivan Damgård Nelly Fazio Antonio Nicolosi
2006
TCC
On Error Correction in the Exponent
Chris Peikert
2006
TCC
On Matroids and Non-ideal Secret Sharing
Amos Beimel Noam Livne
2006
TCC
On the Complexity of Parallel Hardness Amplification for One-Way Functions
Chi-Jen Lu
2006
TCC
On the Relation Between the Ideal Cipher and the Random Oracle Models
Yevgeniy Dodis Prashant Puniya
2006
TCC
Perfectly Secure Password Protocols in the Bounded Retrieval Model
Giovanni Di Crescenzo Richard J. Lipton Shabsi Walfish
2006
TCC
Polylogarithmic Private Approximations and Efficient Matching
Piotr Indyk David P. Woodruff
2006
TCC
PRF Domain Extension Using DAGs
Charanjit S. Jutla
2006
TCC
Pseudorandom Generators from One-Way Functions: A Simple Construction for Any Hardness
Thomas Holenstein
2006
TCC
Resource Fairness and Composability of Cryptographic Protocols
Juan A. Garay Philip D. MacKenzie Manoj Prabhakaran Ke Yang
2006
TCC
Ring Signatures: Stronger Definitions, and Constructions Without Random Oracles
Adam Bender Jonathan Katz Ruggero Morselli
2006
TCC
Round-Optimal and Efficient Verifiable Secret Sharing
Matthias Fitzi Juan A. Garay Shyamnath Gollakota C. Pandu Rangan K. Srinathan
2006
TCC
Secure Computation with Partial Message Loss
Chiu-Yuen Koo
2006
TCC
Separating Sources for Encryption and Secret Sharing
Yevgeniy Dodis Krzysztof Pietrzak Bartosz Przydatek
2006
TCC
Threshold and Proactive Pseudo-Random Permutations
Yevgeniy Dodis Aleksandr Yampolskiy Moti Yung
2006
TCC
Unconditionally Secure Constant-Rounds Multi-party Computation for Equality, Comparison, Bits and Exponentiation
Ivan Damgård Matthias Fitzi Eike Kiltz Jesper Buus Nielsen Tomas Toft
2006
TCC
Universally Composable Symbolic Analysis of Mutual Authentication and Key-Exchange Protocols
Ran Canetti Jonathan Herzog