Theory of Cryptography

First Theory of Cryptography Conference, TCC 2004, Cambridge, MA, USA, February 19-21, 2004. Proceedings

  • Moni Naor
Conference proceedings TCC 2004

DOI: 10.1007/b95566

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2951)

Table of contents (28 papers)

  1. Front Matter
  2. Notions of Reducibility between Cryptographic Primitives
    Omer Reingold, Luca Trevisan, Salil Vadhan
    Pages 1-20
  3. On the Random-Oracle Methodology as Applied to Length-Restricted Signature Schemes
    Ran Canetti, Oded Goldreich, Shai Halevi
    Pages 40-57
  4. Universally Composable Commitments Using Random Oracles
    Dennis Hofheinz, Jörn Müller-Quade
    Pages 58-76
  5. List-Decoding of Linear Functions and Analysis of a Two-Round Zero-Knowledge Argument
    Cynthia Dwork, Ronen Shaltiel, Adam Smith, Luca Trevisan
    Pages 101-120
  6. On the Possibility of One-Message Weak Zero-Knowledge
    Boaz Barak, Rafael Pass
    Pages 121-132
  7. Soundness of Formal Encryption in the Presence of Active Adversaries
    Daniele Micciancio, Bogdan Warinschi
    Pages 133-151
  8. Alternatives to Non-malleability: Definitions, Constructions, and Applications
    Philip MacKenzie, Michael K. Reiter, Ke Yang
    Pages 171-190
  9. Lower Bounds for Concurrent Self Composition
    Yehuda Lindell
    Pages 203-222
  10. A Quantitative Approach to Reductions in Secure Computation
    Amos Beimel, Tal Malkin
    Pages 238-257
  11. Algorithmic Tamper-Proof (ATP) Security: Theoretical Foundations for Security against Hardware Tampering
    Rosario Gennaro, Anna Lysyanskaya, Tal Malkin, Silvio Micali, Tal Rabin
    Pages 258-277
  12. Physically Observable Cryptography
    Silvio Micali, Leonid Reyzin
    Pages 278-296
  13. Efficient and Universally Composable Committed Oblivious Transfer and Applications
    Juan A. Garay, Philip MacKenzie, Ke Yang
    Pages 297-316
  14. A Universally Composable Mix-Net
    Douglas Wikström
    Pages 317-335
  15. A General Composition Theorem for Secure Reactive Systems
    Michael Backes, Birgit Pfitzmann, Michael Waidner
    Pages 336-354

About these proceedings


DES algorithms cryptanalysis cryptographic paradigms cryptographic primitives cryptography cryptology digital signature schemes oblivious transfer random oracle methodology random passwords secure reactive systems zero-knowledge arguments

Editors and affiliations

  • Moni Naor
    • 1
  1. 1.Department of Computer Science and Applied MathematicsWeizmann Institute of ScienceRehovotIsrael

Bibliographic information

  • Copyright Information Springer-Verlag Berlin Heidelberg 2004
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-21000-9
  • Online ISBN 978-3-540-24638-1
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349