default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID3. TCC 2006: New York, NY, USA
- Shai Halevi, Tal Rabin:
Theory of Cryptography, Third Theory of Cryptography Conference, TCC 2006, New York, NY, USA, March 4-7, 2006, Proceedings. Lecture Notes in Computer Science 3876, Springer 2006, ISBN 3-540-32731-2
Zero-Knowledge
- Daniele Micciancio
, Shien Jin Ong, Amit Sahai, Salil P. Vadhan:
Concurrent Zero Knowledge Without Complexity Assumptions. 1-20 - Moti Yung, Yunlei Zhao:
Interactive Zero-Knowledge with Restricted Random Oracles. 21-40 - Ivan Damgård, Nelly Fazio, Antonio Nicolosi:
Non-interactive Zero-Knowledge from Homomorphic Encryption. 41-59
Primitives
- Adam Bender, Jonathan Katz, Ruggero Morselli:
Ring Signatures: Stronger Definitions, and Constructions Without Random Oracles. 60-79 - Tatsuaki Okamoto:
Efficient Blind and Partially Blind Signatures Without Random Oracles. 80-99 - Vladimir Kolesnikov, Charles Rackoff:
Key Exchange Using Passwords and Long Keys. 100-119 - Dario Catalano, Yevgeniy Dodis, Ivan Visconti:
Mercurial Commitments: Minimal Assumptions and Efficient Constructions. 120-144
Assumptions and Models
- Chris Peikert, Alon Rosen:
Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices. 145-166 - Chris Peikert:
On Error Correction in the Exponent. 167-183 - Yevgeniy Dodis, Prashant Puniya:
On the Relation Between the Ideal Cipher and the Random Oracle Models. 184-206
The Bounded-Retrieval Model
- Stefan Dziembowski:
Intrusion-Resilience Via the Bounded-Storage Model. 207-224 - Giovanni Di Crescenzo, Richard J. Lipton, Shabsi Walfish:
Perfectly Secure Password Protocols in the Bounded Retrieval Model. 225-244
Privacy
- Piotr Indyk, David P. Woodruff:
Polylogarithmic Private Approximations and Efficient Matching. 245-264 - Cynthia Dwork, Frank McSherry, Kobbi Nissim, Adam D. Smith:
Calibrating Noise to Sensitivity in Private Data Analysis. 265-284
Secret Sharing and Multi-party Computation (I)
- Ivan Damgård, Matthias Fitzi, Eike Kiltz, Jesper Buus Nielsen, Tomas Toft:
Unconditionally Secure Constant-Rounds Multi-party Computation for Equality, Comparison, Bits and Exponentiation. 285-304 - Zuzana Beerliová-Trubíniová, Martin Hirt:
Efficient Multi-party Computation with Dispute Control. 305-328 - Matthias Fitzi, Juan A. Garay, Shyamnath Gollakota, C. Pandu Rangan, K. Srinathan:
Round-Optimal and Efficient Verifiable Secret Sharing. 329-342
Universally-Composible Security
- Tal Malkin, Ryan Moriarty, Nikolai Yakovenko:
Generalized Environmental Security from Number Theoretic Assumptions. 343-359 - Anupam Datta, Ante Derek, John C. Mitchell, Ajith Ramanathan, Andre Scedrov:
Games and the Impossibility of Realizable Ideal Functionality. 360-379 - Ran Canetti, Jonathan Herzog:
Universally Composable Symbolic Analysis of Mutual Authentication and Key-Exchange Protocols. 380-403 - Juan A. Garay, Philip D. MacKenzie, Manoj Prabhakaran, Ke Yang:
Resource Fairness and Composability of Cryptographic Protocols. 404-428
One-Way Functions and Friends
- Hoeteck Wee:
Finding Pessiland. 429-442 - Thomas Holenstein:
Pseudorandom Generators from One-Way Functions: A Simple Construction for Any Hardness. 443-461 - Chi-Jen Lu:
On the Complexity of Parallel Hardness Amplification for One-Way Functions. 462-481
Secret Sharing and Multi-party Computation (II)
- Amos Beimel, Noam Livne:
On Matroids and Non-ideal Secret Sharing. 482-501 - Chiu-Yuen Koo:
Secure Computation with Partial Message Loss. 502-521 - Kobbi Nissim, Enav Weinreb:
Communication Efficient Secure Linear Algebra. 522-541 - Yevgeniy Dodis, Aleksandr Yampolskiy, Moti Yung:
Threshold and Proactive Pseudo-Random Permutations. 542-560
Pseudo-Random Functions and Encryption
- Charanjit S. Jutla:
PRF Domain Extension Using DAGs. 561-580 - Eike Kiltz:
Chosen-Ciphertext Security from Tag-Based Encryption. 581-600 - Yevgeniy Dodis, Krzysztof Pietrzak, Bartosz Przydatek:
Separating Sources for Encryption and Secret Sharing. 601-616
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-20 21:08 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
