Book Volume 5444 2009

Theory of Cryptography

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


ISBN: 978-3-642-00456-8 (Print) 978-3-642-00457-5 (Online)

Table of contents (35 chapters)

previous Page of 2
  1. Front Matter

    Pages -

  2. Chapter

    Pages 1-18

    An Optimally Fair Coin Toss

  3. Chapter

    Pages 19-35

    Complete Fairness in Multi-party Computation without an Honest Majority

  4. Chapter

    Pages 36-53

    Fairness with an Honest Minority and a Rational Majority

  5. Chapter

    Pages 54-71

    Purely Rational Secret Sharing (Extended Abstract)

  6. Chapter

    Pages 72-72

    Some Recent Progress in Lattice-Based Cryptography

  7. Chapter

    Pages 73-90

    Non-malleable Obfuscation

  8. Chapter

    Pages 91-108

    Simulation-Based Concurrent Non-malleable Commitments and Decommitments

  9. Chapter

    Pages 109-127

    Proofs of Retrievability via Hardness Amplification

  10. Chapter

    Pages 128-145

    Security Amplification for Interactive Cryptographic Primitives

  11. Chapter

    Pages 146-162

    Composability and On-Line Deniability of Authentication

  12. Chapter

    Pages 163-182

    Authenticated Adversarial Routing

  13. Chapter

    Pages 183-201

    Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer

  14. Chapter

    Pages 202-219

    On the (Im)Possibility of Key Dependent Encryption

  15. Chapter

    Pages 220-237

    On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols

  16. Chapter

    Pages 238-255

    Secure Computability of Functions in the IT Setting with Dishonest Majority and Applications to Long-Term Security

  17. Chapter

    Pages 256-273

    Complexity of Multi-party Computation Problems: The Case of 2-Party Symmetric Secure Function Evaluation

  18. Chapter

    Pages 274-293

    Realistic Failures in Secure Multi-party Computation

  19. Chapter

    Pages 294-314

    Secure Arithmetic Computation with No Honest Majority

  20. Chapter

    Pages 315-331

    Universally Composable Multiparty Computation with Partially Isolated Parties

  21. Chapter

    Pages 332-349

    Oblivious Transfer from Weak Noisy Channels

previous Page of 2