Theory of Cryptography

6th Theory of Cryptography Conference, TCC 2009, San Francisco, CA, USA, March 15-17, 2009. Proceedings

  • Omer Reingold
Conference proceedings TCC 2009

DOI: 10.1007/978-3-642-00457-5

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

Table of contents (35 papers)

  1. Front Matter
  2. An Optimally Fair Coin Toss
    Tal Moran, Moni Naor, Gil Segev
    Pages 1-18
  3. Fairness with an Honest Minority and a Rational Majority
    Shien Jin Ong, David C. Parkes, Alon Rosen, Salil Vadhan
    Pages 36-53
  4. Purely Rational Secret Sharing (Extended Abstract)
    Silvio Micali, abhi shelat
    Pages 54-71
  5. Non-malleable Obfuscation
    Ran Canetti, Mayank Varia
    Pages 73-90
  6. Simulation-Based Concurrent Non-malleable Commitments and Decommitments
    Rafail Ostrovsky, Giuseppe Persiano, Ivan Visconti
    Pages 91-108
  7. Proofs of Retrievability via Hardness Amplification
    Yevgeniy Dodis, Salil Vadhan, Daniel Wichs
    Pages 109-127
  8. Security Amplification for Interactive Cryptographic Primitives
    Yevgeniy Dodis, Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets
    Pages 128-145
  9. Composability and On-Line Deniability of Authentication
    Yevgeniy Dodis, Jonathan Katz, Adam Smith, Shabsi Walfish
    Pages 146-162
  10. Authenticated Adversarial Routing
    Yair Amir, Paul Bunn, Rafail Ostrovsky
    Pages 163-182
  11. On the (Im)Possibility of Key Dependent Encryption
    Iftach Haitner, Thomas Holenstein
    Pages 202-219
  12. On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols
    Iftach Haitner, Alon Rosen, Ronen Shaltiel
    Pages 220-237
  13. Realistic Failures in Secure Multi-party Computation
    Vassilis Zikas, Sarah Hauser, Ueli Maurer
    Pages 274-293
  14. Secure Arithmetic Computation with No Honest Majority
    Yuval Ishai, Manoj Prabhakaran, Amit Sahai
    Pages 294-314
  15. Universally Composable Multiparty Computation with Partially Isolated Parties
    Ivan Damgård, Jesper Buus Nielsen, Daniel Wichs
    Pages 315-331

About these proceedings

Introduction

This book constitutes the refereed proceedings of the Sixth Theory of Cryptography Conference, TCC 2009, held in San Francisco, CA, USA, March 15-17, 2009.

The 33 revised full papers presented together with two invited talks were carefully reviewed and selected from 109 submissions. The papers are organized in 10 sessions dealing with the paradigms, approaches and techniques used to conceptualize, define and provide solutions to natural cryptographic problems.

Keywords

Cisco Shannon adaptive security algorithm algorithms authentication black-box reductions communication complexity complexity cryptographic paradigms cryptographic primitives cryptographic protocols cryptography encryption privacy

Editors and affiliations

  • Omer Reingold
    • 1
  1. 1.Faculty of Mathematics and Computer ScienceThe Weizmann Institute of ScienceRehovotIsrael

Bibliographic information

  • Copyright Information Springer Berlin Heidelberg 2009
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-00456-8
  • Online ISBN 978-3-642-00457-5
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349