1. TCC 2004:
Cambridge, MA, USA
Moni Naor (Ed.):
Theory of Cryptography, First Theory of Cryptography Conference, TCC 2004, Cambridge, MA, USA, February 19-21, 2004, Proceedings.
Lecture Notes in Computer Science 2951 Springer 2004, ISBN 3-540-21000-8 
- Omer Reingold, Luca Trevisan, Salil P. Vadhan:
Notions of Reducibility between Cryptographic Primitives.
1-20
- Ueli M. Maurer, Renato Renner, Clemens Holenstein:
Indifferentiability, Impossibility Results on Reductions, and Applications to the Random Oracle Methodology.
21-39
- Ran Canetti, Oded Goldreich, Shai Halevi:
On the Random-Oracle Methodology as Applied to Length-Restricted Signature Schemes.
40-57
- Dennis Hofheinz, Jörn Müller-Quade:
Universally Composable Commitments Using Random Oracles.
58-76
- Shafi Goldwasser, Erez Waisbard:
Transformation of Digital Signature Schemes into Designated Confirmer Signature Schemes.
77-100
- Cynthia Dwork, Ronen Shaltiel, Adam Smith, Luca Trevisan:
List-Decoding of Linear Functions and Analysis of a Two-Round Zero-Knowledge Argument.
101-120
- Boaz Barak, Rafael Pass:
On the Possibility of One-Message Weak Zero-Knowledge.
121-132
- Daniele Micciancio, Bogdan Warinschi:
Soundness of Formal Encryption in the Presence of Active Adversaries.
133-151
- Jens Groth:
Rerandomizable and Replayable Adaptive Chosen Ciphertext Attack Secure Cryptosystems.
152-170
- Philip D. MacKenzie, Michael K. Reiter, Ke Yang:
Alternatives to Non-malleability: Definitions, Constructions, and Applications (Extended Abstract).
171-190
- Alon Rosen:
A Note on Constant-Round Zero-Knowledge Proofs for NP.
191-202
- Yehuda Lindell:
Lower Bounds for Concurrent Self Composition.
203-222
- Ronald Cramer, Ivan Damgård:
Secret-Key Zero-Knowlegde and Non-interactive Verifiable Exponentiation.
223-237
- Amos Beimel, Tal Malkin:
A Quantitative Approach to Reductions in Secure Computation.
238-257
- Rosario Gennaro, Anna Lysyanskaya, Tal Malkin, Silvio Micali, Tal Rabin:
Algorithmic Tamper-Proof (ATP) Security: Theoretical Foundations for Security against Hardware Tampering.
258-277
- Silvio Micali, Leonid Reyzin:
Physically Observable Cryptography (Extended Abstract).
278-296
- Juan A. Garay:
Efficient and Universally Composable Committed Oblivious Transfer and Applications.
297-316
- Douglas Wikström:
A Universally Composable Mix-Net.
317-335
- Michael Backes, Birgit Pfitzmann, Michael Waidner:
A General Composition Theorem for Secure Reactive Systems.
336-354
- Ivan Damgård, Serge Fehr, Kirill Morozov, Louis Salvail:
Unfair Noisy Channels and Oblivious Transfer.
355-373
- Claude Crépeau, Paul Dumais, Dominic Mayers, Louis Salvail:
Computational Collapse of Quantum State with Application to Oblivious Transfer.
374-393
- Iftach Haitner:
Implementing Oblivious Transfer Using Collection of Dense Trapdoor Permutations.
394-409
- Ueli M. Maurer, Krzysztof Pietrzak:
Composition of Random Systems: When Two Weak Make One Strong.
410-427
- Minh-Huyen Nguyen, Salil P. Vadhan:
Simpler Session-Key Generation from Short Random Passwords.
428-445
- Yan Zong Ding, Danny Harnik, Alon Rosen, Ronen Shaltiel:
Constant-Round Oblivious Transfer in the Bounded Storage Model.
446-472
- Tamir Tassa:
Hierarchical Threshold Secret Sharing.
473-490
- Mark Johnson, David Wagner, Kannan Ramchandran:
On Compressing Encrypted Data without the Encryption Key.
491-504
- Ronald L. Rivest:
On the Notion of Pseudo-Free Groups.
505-521
Last update Sat May 18 19:51:20 2013
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
