Book Volume 2501 2002

Advances in Cryptology — ASIACRYPT 2002

8th International Conference on the Theory and Application of Cryptology and Information Security Queenstown, New Zealand, December 1–5, 2002 Proceedings


ISBN: 978-3-540-00171-3 (Print) 978-3-540-36178-7 (Online)

Table of contents (36 chapters)

previous Page of 2
  1. Front Matter

    Pages I-XIII

  2. Chapter

    Pages 1-26

    Analysis of Bernstein’s Factorization Circuit

  3. Chapter

    Pages 27-45

    A Variant of the Cramer-Shoup Cryptosystem for Groups of Unknown Order

  4. Chapter

    Pages 46-63

    Looking beyond XTR

  5. Chapter

    Pages 64-80

    Bounds for Robust Metering Schemes and Their Relationship with A2-code

  6. Chapter

    Pages 81-99

    Unconditionally Secure Anonymous Encryption and Group Authentication

  7. Chapter

    Pages 100-109

    Adapting the Weaknesses of the Random Oracle Model to the Generic Group Model

  8. Chapter

    Pages 110-124

    On the Impossibilities of Basing One-Way Permutations on Central Cryptographic Primitives

  9. Chapter

    Pages 125-142

    A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order

  10. Chapter

    Pages 143-159

    Efficient Oblivious Transfer in the Bounded-Storage Model

  11. Chapter

    Pages 160-175

    In How Many Ways Can You Write Rijndael?

  12. Chapter

    Pages 176-191

    On the Security of Rijndael-Like Structures against Differential and Linear Cryptanalysis

  13. Chapter

    Pages 192-205

    Threshold Cryptosystems Based on Factoring

  14. Chapter

    Pages 206-224

    Non-interactive Distributed-Verifier Proofs and Proving Relations among Commitments

  15. Chapter

    Pages 224-242

    Asynchronous Secure Communication Tolerating Mixed Adversaries

  16. Chapter

    Pages 243-253

    Amplified Boomerang Attack against Reduced-Round SHACAL

  17. Chapter

    Pages 254-266

    Enhancing Differential-Linear Cryptanalysis

  18. Chapter

    Pages 267-287

    Cryptanalysis of Block Ciphers with Overdefined Systems of Equations

  19. Chapter

    Pages 288-298

    Analysis of Neural Cryptography

  20. Chapter

    Pages 299-310

    The Hardness of Hensel Lifting: The Case of RSA and Discrete Logarithm

  21. Chapter

    Pages 311-327

    A Comparison and a Combination of SST and AGM Algorithms for Counting Points of Elliptic Curves in Characteristic 2

previous Page of 2