Book Volume 3788 2005

Advances in Cryptology - ASIACRYPT 2005

11th International Conference on the Theory and Application of Cryptology and Information Security, Chennai, India, December 4-8, 2005. Proceedings


ISBN: 978-3-540-30684-9 (Print) 978-3-540-32267-2 (Online)

Table of contents (37 chapters)

previous Page of 2
  1. Front Matter

    Pages -

  2. Algebra and Number Theory

    1. Chapter

      Pages 1-20

      Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log

    2. Chapter

      Pages 21-40

      Do All Elliptic Curves of the Same Order Have the Same Difficulty of Discrete Log?

    3. Chapter

      Pages 41-58

      Adapting Density Attacks to Low-Weight Knapsacks

    4. Chapter

      Pages 59-78

      Efficient and Secure Elliptic Curve Point Multiplication Using Double-Base Chains

  3. Multiparty Computation

    1. Chapter

      Pages 79-99

      Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation

    2. Chapter

      Pages 100-120

      Graph-Decomposition-Based Frameworks for Subset-Cover Broadcast Encryption and Efficient Instantiations

    3. Chapter

      Pages 121-135

      Revealing Additional Information in Two-Party Computations

  4. Zero Knowledge and Secret Sharing

    1. Chapter

      Pages 136-155

      Gate Evaluation Secret Sharing and Secure One-Round Two-Party Computation

    2. Chapter

      Pages 156-173

      Parallel Multi-party Computation from Linear Multi-secret Sharing Schemes

    3. Chapter

      Pages 174-198

      Updatable Zero-Knowledge Databases

  5. Information and Quantum Theory

    1. Chapter

      Pages 199-216

      Simple and Tight Bounds for Information Reconciliation and Privacy Amplification

    2. Chapter

      Pages 217-235

      Quantum Anonymous Transmissions

  6. Privacy and Anonymity

    1. Chapter

      Pages 236-252

      Privacy-Preserving Graph Algorithms in the Semi-honest Model

    2. Chapter

      Pages 253-272

      Spreading Alerts Quietly and the Subgroup Escape Problem

    3. Chapter

      Pages 273-292

      A Sender Verifiable Mix-Net and a New Proof of a Shuffle

    4. Chapter

      Pages 293-312

      Universally Anonymizable Public-Key Encryption

  7. Cryptanalytic Techniques

    1. Chapter

      Pages 313-332

      Fast Computation of Large Distributions and Its Cryptographic Applications

    2. Chapter

      Pages 333-352

      An Analysis of the XSL Algorithm

  8. Stream Cipher Cryptanalysis

    1. Chapter

      Pages 353-372

      New Applications of Time Memory Data Tradeoffs

    2. Chapter

      Pages 373-394

      Linear Cryptanalysis of the TSC Family of Stream Ciphers

previous Page of 2