Book Volume 2951 2004

Theory of Cryptography

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


ISBN: 978-3-540-21000-9 (Print) 978-3-540-24638-1 (Online)

Table of contents (28 chapters)

previous Page of 2
  1. Front Matter

    Pages -

  2. Chapter

    Pages 1-20

    Notions of Reducibility between Cryptographic Primitives

  3. Chapter

    Pages 21-39

    Indifferentiability, Impossibility Results on Reductions, and Applications to the Random Oracle Methodology

  4. Chapter

    Pages 40-57

    On the Random-Oracle Methodology as Applied to Length-Restricted Signature Schemes

  5. Chapter

    Pages 58-76

    Universally Composable Commitments Using Random Oracles

  6. Chapter

    Pages 77-100

    Transformation of Digital Signature Schemes into Designated Confirmer Signature Schemes

  7. Chapter

    Pages 101-120

    List-Decoding of Linear Functions and Analysis of a Two-Round Zero-Knowledge Argument

  8. Chapter

    Pages 121-132

    On the Possibility of One-Message Weak Zero-Knowledge

  9. Chapter

    Pages 133-151

    Soundness of Formal Encryption in the Presence of Active Adversaries

  10. Chapter

    Pages 152-170

    Rerandomizable and Replayable Adaptive Chosen Ciphertext Attack Secure Cryptosystems

  11. Chapter

    Pages 171-190

    Alternatives to Non-malleability: Definitions, Constructions, and Applications

  12. Chapter

    Pages 191-202

    A Note on Constant-Round Zero-Knowledge Proofs for NP

  13. Chapter

    Pages 203-222

    Lower Bounds for Concurrent Self Composition

  14. Chapter

    Pages 223-237

    Secret-Key Zero-Knowlegde and Non-interactive Verifiable Exponentiation

  15. Chapter

    Pages 238-257

    A Quantitative Approach to Reductions in Secure Computation

  16. Chapter

    Pages 258-277

    Algorithmic Tamper-Proof (ATP) Security: Theoretical Foundations for Security against Hardware Tampering

  17. Chapter

    Pages 278-296

    Physically Observable Cryptography

  18. Chapter

    Pages 297-316

    Efficient and Universally Composable Committed Oblivious Transfer and Applications

  19. Chapter

    Pages 317-335

    A Universally Composable Mix-Net

  20. Chapter

    Pages 336-354

    A General Composition Theorem for Secure Reactive Systems

  21. Chapter

    Pages 355-373

    Unfair Noisy Channels and Oblivious Transfer

previous Page of 2