International Association for Cryptologic Research

Publications by Conference

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

Preface and frontmatter

Page	Title
1-26	Analysis of Bernstein's Factorization Circuit
27-45	A Variant of the Cramer-Shoup Cryptosystem for Groups of Unknown Order
46-63	Looking beyond XTR
64-80	Bounds for Robust Metering Schemes and Their Relationship with A-code
81-99	Unconditionally Secure Anonymous Encryption and Group Authentication
100-109	Adapting the Weaknesses of the Random Oracle Model to the Generic Group Model
110-124	On the Impossibilities of Basing One-Way Permutations on Central Cryptographic Primitives
125-142	A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
143-159	Efficient Oblivious Transfer in the Bounded-Storage Model
160-175	In How Many Ways Can You Write Rijndael?
176-191	On the Security of Rijndael-Like Structures against Differential and Linear Cryptanalysis
192-205	Threshold Cryptosystems Based on Factoring
206-223	Non-interactive Distributed-Verifier Proofs and Proving Relations among Commitments
224-242	Asynchronous Secure Communication Tolerating Mixed Adversaries
243-253	Amplified Boomerang Attack against Reduced-Round SHACAL
254-266	Enhancing Differential-Linear Cryptanalysis
267-287	Cryptanalysis of Block Ciphers with Overdefined Systems of Equations
288-298	Analysis of Neural Cryptography
299-310	The Hardness of Hensel Lifting: The Case of RSA and Discrete Logarithm
311-327	A Comparison and a Combination of SST and AGM Algorithms for Counting Points of Elliptic Curves in Characteristic 2
328-345	A General Formula of the (t, n)-Threshold Visual Secret Sharing Scheme
346-363	On Unconditionally Secure Robust Distributed Key Distribution Centers
364-378	Short Signatures in the Random Oracle Model
379-396	The Provable Security of Graph-Based One-Time Signatures and Extensions to Algebraic Signature Schemes
397-414	Transitive Signatures Based on Factoring and RSA
415-432	1-out-of-n Signatures from a Variety of Keys
433-450	A Revocation Scheme with Minimal Storage at Receivers
451-465	Optimistic Mixing for Exit-Polls
466-483	Improved Construction of Nonlinear Resilient S-Boxes
484-496	An Upper Bound on the Number of m-Resilient Boolean Functions
497-514	Group Diffie-Hellman Key Exchange Secure against Dictionary Attacks
515-532	Secure Channels Based on Authenticated Encryption Schemes: A Simple Characterization
533-547	ID-Based Blind Signature and Ring Signature from Pairings
548-566	Hierarchical ID-Based Cryptography
567-573	Crypto-integrity
574-576	Gummy and Conductive Silicone Rubber Fingers