Theory of Cryptography

4th Theory of Cryptography Conference, TCC 2007, Amsterdam, The Netherlands, February 21-24, 2007. Proceedings


ISBN: 978-3-540-70935-0 (Print) 978-3-540-70936-7 (Online)

Table of contents (31 chapters)

previous Page of 2
  1. Front Matter

    Pages -

  2. Encryption I

    1. Book Chapter

      Pages 1-20

      Does Privacy Require True Randomness?

    2. Book Chapter

      Pages 21-40

      Tackling Adaptive Corruptions in Multicast Encryption Protocols

  3. Universally Composable Security

    1. Book Chapter

      Pages 41-60

      Long-Term Security and Universal Composability

    2. Book Chapter

      Pages 61-85

      Universally Composable Security with Global Setup

  4. Arguments and Zero Knowledge

    1. Book Chapter

      Pages 86-102

      Parallel Repetition of Computationally Sound Protocols Revisited

    2. Book Chapter

      Pages 103-117

      Lower Bounds for Non-interactive Zero-Knowledge

    3. Book Chapter

      Pages 118-136

      Perfect NIZK with Adaptive Soundness

  5. Notions of Security

    1. Book Chapter

      Pages 137-156

      Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries

    2. Book Chapter

      Pages 157-173

      On the Necessity of Rewinding in Secure Multiparty Computation

    3. Book Chapter

      Pages 174-193

      On Expected Probabilistic Polynomial-Time Adversaries: A Suggestion for Restricted Definitions and Their Benefits

  6. Obfuscation

    1. Book Chapter

      Pages 194-213

      On Best-Possible Obfuscation

    2. Book Chapter

      Pages 214-232

      Obfuscation for Cryptographic Purposes

    3. Book Chapter

      Pages 233-252

      Securely Obfuscating Re-encryption

  7. Secret Sharing and Multiparty Computation

    1. Book Chapter

      Pages 253-272

      Weakly-Private Secret Sharing Schemes

    2. Book Chapter

      Pages 273-290

      On Secret Sharing Schemes, Matroids and Polymatroids

    3. Book Chapter

      Pages 291-310

      Secure Linear Algebra Using Linearly Recurrent Sequences

    4. Book Chapter

      Pages 311-322

      Towards Optimal and Efficient Perfectly Secure Message Transmission

  8. Signatures and Watermarking

    1. Book Chapter

      Pages 323-341

      Concurrently-Secure Blind Signatures Without Random Oracles or Setup Assumptions

    2. Book Chapter

      Pages 342-361

      Designated Confirmer Signatures Revisited

    3. Book Chapter

      Pages 362-382

      From Weak to Strong Watermarking

previous Page of 2