Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID2. TCC 2005: Cambridge, MA, USA
- Joe Kilian:
Theory of Cryptography, Second Theory of Cryptography Conference, TCC 2005, Cambridge, MA, USA, February 10-12, 2005, Proceedings. Lecture Notes in Computer Science 3378, Springer 2005, ISBN 3-540-24573-1
Hardness Amplification and Error Correction
- Silvio Micali, Chris Peikert, Madhu Sudan, David A. Wilson:
Optimal Error Correction Against Computationally Bounded Noise. 1-16 - Ran Canetti, Shai Halevi, Michael Steiner:
Hardness Amplification of Weakly Verifiable Puzzles. 17-33 - Henry C. Lin, Luca Trevisan, Hoeteck Wee:
On Hardness Amplification of One-Way Functions. 34-49
Graphs and Groups
- Jens Groth:
Cryptography in Subgroups of Zn. 50-65 - Moni Naor, Asaf Nussboim, Eran Tromer:
Efficiently Constructible Huge Graphs That Preserve First Order Properties of Random Graphs. 66-85
Simulation and Secure Computation
- Dennis Hofheinz, Dominique Unruh:
Comparing Two Notions of Simulatability. 86-103 - Manoj Prabhakaran, Amit Sahai:
Relaxing Environmental Security: Monitored Functionalities and Client-Server Computation. 104-127 - Jonathan Katz, Yehuda Lindell:
Handling Expected Polynomial-Time Strategies in Simulation-Based Security Proofs. 128-149
Security of Encryption
- Ran Canetti, Shai Halevi, Jonathan Katz:
Adaptively-Secure, Non-interactive Public-Key Encryption. 150-168 - Daniele Micciancio
, Saurabh Panjwani:
Adaptive Security of Symbolic Encryption. 169-187 - Yevgeniy Dodis, Jonathan Katz:
Chosen-Ciphertext Security of Multiple Encryption. 188-209
Steganography and Zero Knowledge
- Michael Backes, Christian Cachin:
Public-Key Steganography with Active Attacks. 210-226 - Nenad Dedic, Gene Itkis, Leonid Reyzin, Scott Russell:
Upper and Lower Bounds on Black-Box Steganography. 227-244 - Matt Lepinski, Silvio Micali, Abhi Shelat:
Fair-Zero Knowledge. 245-263
Secure Computation I
- Susan Hohenberger, Anna Lysyanskaya:
How to Securely Outsource Cryptographic Computations. 264-282 - Eike Kiltz, Gregor Leander, John Malone-Lee:
Secure Computation of the Mean and Related Statistics. 283-302 - Michael J. Freedman, Yuval Ishai, Benny Pinkas, Omer Reingold:
Keyword Search and Oblivious Pseudorandom Functions. 303-324
Secure Computation II
- Dan Boneh, Eu-Jin Goh, Kobbi Nissim:
Evaluating 2-DNF Formulas on Ciphertexts. 325-341 - Ronald Cramer, Ivan Damgård, Yuval Ishai:
Share Conversion, Pseudorandom Secret-Sharing and Applications to Secure Computation. 342-362 - Shuchi Chawla, Cynthia Dwork, Frank McSherry, Adam D. Smith, Hoeteck Wee:
Toward Privacy in Public Databases. 363-385
Quantum Cryptography and Universal Composability
- Michael Ben-Or, Michal Horodecki, Debbie W. Leung, Dominic Mayers, Jonathan Oppenheim:
The Universal Composable Security of Quantum Key Distribution. 386-406 - Renato Renner, Robert König:
Universally Composable Privacy Amplification Against Quantum Adversaries. 407-425 - Waka Nagao, Yoshifumi Manabe, Tatsuaki Okamoto:
A Universally Composable Secure Channel Based on the KEM-DEM Framework. 426-444
Cryptographic Primitives and Security
- Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky:
Sufficient Conditions for Collision-Resistant Hashing. 445-456 - Minh-Huyen Nguyen:
The Relationship Between Password-Authenticated Key Exchange and Other Cryptographic Primitives. 457-475 - Anupam Datta, Ralf Küsters, John C. Mitchell, Ajith Ramanathan:
On the Relationships Between Notions of Simulation-Based Security. 476-494
Encryption and Signatures
- María Isabel González Vasco, Consuelo Martínez, Rainer Steinwandt, Jorge Luis Villar:
A New Cramer-Shoup Like Methodology for Group Based Provably Secure Encryption Schemes. 495-509 - Stanislaw Jarecki, Nitesh Saxena:
Further Simplifications in Proactive RSA Signatures. 510-528 - Shafi Goldwasser, Dmitriy Kharchenko:
Proof of Plaintext Knowledge for the Ajtai-Dwork Cryptosystem. 529-555
Information Theoretic Cryptography
- Yevgeniy Dodis, Adam D. Smith:
Entropic Security and the Encryption of High Entropy Messages. 556-577 - Yan Zong Ding:
Error Correction in the Bounded Storage Model. 578-599 - Amos Beimel, Tamir Tassa, Enav Weinreb:
Characterizing Ideal Weighted Threshold Secret Sharing. 600-619
a service of 
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-05-10 18:45 CEST 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:
