Advances in Cryptology - CRYPTO 2003

23rd Annual International Cryptology Conference, Santa Barbara, California, USA, August 17-21, 2003. Proceedings

Editors:

ISBN: 978-3-540-40674-7 (Print) 978-3-540-45146-4 (Online)

Table of contents (36 chapters)

previous Page of 2
  1. Front Matter

    Pages -

  2. Public Key Cryptanalysis I

    1. Book Chapter

      Pages 1-26

      Factoring Large Numbers with the TWIRL Device

    2. Book Chapter

      Pages 27-43

      New Partial Key Exposure Attacks on RSA

    3. Book Chapter

      Pages 44-60

      Algebraic Cryptanalysis of Hidden Field Equation (HFE) Cryptosystems Using Gröbner Bases

  3. Alternate Adversary Models

    1. Book Chapter

      Pages 61-77

      On Constructing Locally Computable Extractors and Cryptosystems in the Bounded Storage Model

    2. Book Chapter

      Pages 78-95

      Unconditional Authenticity and Privacy from an Arbitrarily Weak Secret

  4. Invited Talk I

    1. Book Chapter

      Pages 96-109

      On Cryptographic Assumptions and Challenges

  5. Protocols

    1. Book Chapter

      Pages 110-125

      Scalable Protocols for Authenticated Group Key Exchange

    2. Book Chapter

      Pages 126-144

      Practical Verifiable Encryption and Decryption of Discrete Logarithms

    3. Book Chapter

      Pages 145-161

      Extending Oblivious Transfers Efficiently

  6. Symmetric Key Cryptanalysis I

    1. Book Chapter

      Pages 162-175

      Algebraic Attacks on Combiners with Memory

    2. Book Chapter

      Pages 176-194

      Fast Algebraic Attacks on Stream Ciphers with Linear Feedback

    3. Book Chapter

      Pages 195-211

      Cryptanalysis of Safer++

  7. Public Key Cryptanalysis II

    1. Book Chapter

      Pages 212-225

      A Polynomial Time Algorithm for the Braid Diffie-Hellman Conjugacy Problem

    2. Book Chapter

      Pages 226-246

      The Impact of Decryption Failures on the Security of NTRU Encryption

  8. Universal Composability

    1. Book Chapter

      Pages 247-264

      Universally Composable Efficient Multiparty Computation from Threshold Homomorphic Encryption

    2. Book Chapter

      Pages 265-281

      Universal Composition with Joint State

  9. Zero-Knowledge

    1. Book Chapter

      Pages 282-298

      Statistical Zero-Knowledge Proofs with Efficient Provers: Lattice Problems and More

    2. Book Chapter

      Pages 299-315

      Derandomization in Cryptography

    3. Book Chapter

      Pages 316-337

      On Deniability in the Common Reference String and Random Oracle Model

  10. Algebraic Geometry

    1. Book Chapter

      Pages 338-348

      Primality Proving via One Round in ECPP and One Iteration in AKS

previous Page of 2