Theory of Cryptography

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

  • Shai Halevi
  • Tal Rabin
Conference proceedings TCC 2006

DOI: 10.1007/11681878

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

Table of contents (31 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

  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

About these proceedings


authentication cryptanalysis cryptographic paradigms cryptographic primitives cryptographic protocols cryptography cryptology digital signature schemes encryption multi-party computation oblivious transfer password protocols privacy pseudo-ra

Editors and affiliations

  • Shai Halevi
    • 1
  • Tal Rabin
    • 2
  1. 1.IBM ResearchHawthorneUSA
  2. 2.IBM T.J.Watson Research CenterHawthorneUSA

Bibliographic information

  • Copyright Information Springer Berlin Heidelberg 2006
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-540-32731-8
  • Online ISBN 978-3-540-32732-5
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349