Skip to main content
  • Conference proceedings
  • © 2006

Theory of Cryptography

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

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

Part of the book sub series: Security and Cryptology (LNSC)

Conference series link(s): TCC: Theory of Cryptography Conference

Conference proceedings info: TCC 2006.

Buy it now

Buying options

eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (32 papers)

  1. Front Matter

  2. Zero-Knowledge

    1. Concurrent Zero Knowledge Without Complexity Assumptions

      • Daniele Micciancio, Shien Jin Ong, Amit Sahai, Salil Vadhan
      Pages 1-20
    2. Non-interactive Zero-Knowledge from Homomorphic Encryption

      • Ivan DamgÃ¥rd, Nelly Fazio, Antonio Nicolosi
      Pages 41-59
  3. Primitives

    1. Ring Signatures: Stronger Definitions, and Constructions Without Random Oracles

      • Adam Bender, Jonathan Katz, Ruggero Morselli
      Pages 60-79
    2. Key Exchange Using Passwords and Long Keys

      • Vladimir Kolesnikov, Charles Rackoff
      Pages 100-119
    3. Mercurial Commitments: Minimal Assumptions and Efficient Constructions

      • Dario Catalano, Yevgeniy Dodis, Ivan Visconti
      Pages 120-144
  4. Assumptions and Models

    1. On Error Correction in the Exponent

      • Chris Peikert
      Pages 167-183
    2. On the Relation Between the Ideal Cipher and the Random Oracle Models

      • Yevgeniy Dodis, Prashant Puniya
      Pages 184-206
  5. The Bounded-Retrieval Model

    1. Intrusion-Resilience Via the Bounded-Storage Model

      • Stefan Dziembowski
      Pages 207-224
    2. Perfectly Secure Password Protocols in the Bounded Retrieval Model

      • Giovanni Di Crescenzo, Richard Lipton, Shabsi Walfish
      Pages 225-244
  6. Privacy

    1. Polylogarithmic Private Approximations and Efficient Matching

      • Piotr Indyk, David Woodruff
      Pages 245-264
    2. Calibrating Noise to Sensitivity in Private Data Analysis

      • Cynthia Dwork, Frank McSherry, Kobbi Nissim, Adam Smith
      Pages 265-284
  7. Secret Sharing and Multi-party Computation (I)

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

      • Ivan DamgÃ¥rd, Matthias Fitzi, Eike Kiltz, Jesper Buus Nielsen, Tomas Toft
      Pages 285-304
    2. Efficient Multi-party Computation with Dispute Control

      • Zuzana Beerliová-Trubíniová, Martin Hirt
      Pages 305-328
    3. Round-Optimal and Efficient Verifiable Secret Sharing

      • Matthias Fitzi, Juan Garay, Shyamnath Gollakota, C. Pandu Rangan, Kannan Srinathan
      Pages 329-342
  8. Universally-Composible Security

    1. Generalized Environmental Security from Number Theoretic Assumptions

      • Tal Malkin, Ryan Moriarty, Nikolai Yakovenko
      Pages 343-359
    2. Games and the Impossibility of Realizable Ideal Functionality

      • Anupam Datta, Ante Derek, John C. Mitchell, Ajith Ramanathan, Andre Scedrov
      Pages 360-379

Other Volumes

  1. Theory of Cryptography

Editors and Affiliations

  • IBM Research, Hawthorne, USA

    Shai Halevi

  • IBM T.J.Watson Research Center, Hawthorne, USA

    Tal Rabin

Bibliographic Information

Buy it now

Buying options

eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access