Theory of Cryptography

Third Theory of Cryptography Conference, TCC 2006, New York, NY, USA, March 4-7, 2006. Proceedings

Editors:

ISBN: 978-3-540-32731-8 (Print) 978-3-540-32732-5 (Online)

Table of contents (31 chapters)

previous Page of 2
  1. Front Matter

    Pages -

  2. Zero-Knowledge

    1. Book Chapter

      Pages 1-20

      Concurrent Zero Knowledge Without Complexity Assumptions

    2. Book Chapter

      Pages 21-40

      Interactive Zero-Knowledge with Restricted Random Oracles

    3. Book Chapter

      Pages 41-59

      Non-interactive Zero-Knowledge from Homomorphic Encryption

  3. Primitives

    1. Book Chapter

      Pages 60-79

      Ring Signatures: Stronger Definitions, and Constructions Without Random Oracles

    2. Book Chapter

      Pages 80-99

      Efficient Blind and Partially Blind Signatures Without Random Oracles

    3. Book Chapter

      Pages 100-119

      Key Exchange Using Passwords and Long Keys

    4. Book Chapter

      Pages 120-144

      Mercurial Commitments: Minimal Assumptions and Efficient Constructions

  4. Assumptions and Models

    1. Book Chapter

      Pages 145-166

      Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices

    2. Book Chapter

      Pages 167-183

      On Error Correction in the Exponent

    3. Book Chapter

      Pages 184-206

      On the Relation Between the Ideal Cipher and the Random Oracle Models

  5. The Bounded-Retrieval Model

    1. Book Chapter

      Pages 207-224

      Intrusion-Resilience Via the Bounded-Storage Model

    2. Book Chapter

      Pages 225-244

      Perfectly Secure Password Protocols in the Bounded Retrieval Model

  6. Privacy

    1. Book Chapter

      Pages 245-264

      Polylogarithmic Private Approximations and Efficient Matching

    2. Book Chapter

      Pages 265-284

      Calibrating Noise to Sensitivity in Private Data Analysis

  7. Secret Sharing and Multi-party Computation (I)

    1. Book Chapter

      Pages 285-304

      Unconditionally Secure Constant-Rounds Multi-party Computation for Equality, Comparison, Bits and Exponentiation

    2. Book Chapter

      Pages 305-328

      Efficient Multi-party Computation with Dispute Control

    3. Book Chapter

      Pages 329-342

      Round-Optimal and Efficient Verifiable Secret Sharing

  8. Universally-Composible Security

    1. Book Chapter

      Pages 343-359

      Generalized Environmental Security from Number Theoretic Assumptions

    2. Book Chapter

      Pages 360-379

      Games and the Impossibility of Realizable Ideal Functionality

    3. Book Chapter

      Pages 380-403

      Universally Composable Symbolic Analysis of Mutual Authentication and Key-Exchange Protocols

previous Page of 2