TCC B

32 papers

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