Advances in Cryptology - ASIACRYPT 2002

Analysis of Bernstein's Factorization Circuit.- A Variant of the Cramer-Shoup Cryptosystem for Groups of Unknown Order.- Looking beyond XTR.- Bounds for Robust Metering Schemes and Their Relationship with A2-code.- Unconditionally Secure Anonymous Encryption and Group Authentication.- Adapting the Weaknesses of the Random Oracle Model to the Generic Group Model.- On the Impossibilities of Basing One-Way Permutations on Central Cryptographic Primitives.- A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order.- Efficient Oblivious Transfer in the Bounded-Storage Model.- In How Many Ways Can You Write Rijndael?.- On the Security of Rijndael-Like Structures against Differential and Linear Cryptanalysis.- Threshold Cryptosystems Based on Factoring.- Non-interactive Distributed-Verifier Proofs and Proving Relations among Commitments.- Asynchronous Secure Communication Tolerating Mixed Adversaries.- Amplified Boomerang Attack against Reduced-Round SHACAL.- Enhancing Differential-Linear Cryptanalysis.- Cryptanalysis of Block Ciphers with Overdefined Systems of Equations.- Analysis of Neural Cryptography.- The Hardness of Hensel Lifting: The Case of RSA and Discrete Logarithm.- A Comparison and a Combination of SST and AGM Algorithms for Counting Points of Elliptic Curves in Characteristic 2.- A General Formula of the (t, n)-Threshold Visual Secret Sharing Scheme.- On Unconditionally Secure Robust Distributed Key Distribution Centers.- Short Signatures in the Random Oracle Model.- The Provable Security of Graph-Based One-Time Signatures and Extensions to Algebraic Signature Schemes.- Transitive Signatures Based on Factoring and RSA.- 1-out-of-n Signatures from a Variety of Keys.- A Revocation Scheme with Minimal Storage at Receivers.- Optimistic Mixing for Exit-Polls.- Improved Construction of Nonlinear Resilient S-Boxes.- An Upper Bound on the Number of m-Resilient Boolean Functions.- Group Diffie-Hellman Key Exchange Secure against Dictionary