This book constitutes the refereed proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2002, held in Singapore, in December 2002.
The 34 revised full papers presented together with two invited contributions were carefully reviewed and selected from 173 submissions on the basis of 875 review reports. The papers are organized in topical sections on public key cryptography, authentication, theory, block ciphers, distributed cryptography, cryptanalysis, public key cryptanalysis, secret sharing, digital signatures, applications, Boolean functions, key management, and ID-based cryptography.
Author(s): Arjen K. Lenstra, Adi Shamir, Jim Tomlinson (auth.), Yuliang Zheng (eds.)
Series: Lecture Notes in Computer Science 2501
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2002
Language: English
Pages: 582
Tags: Data Encryption; Computer Communication Networks; Operating Systems; Algorithm Analysis and Problem Complexity; Discrete Mathematics in Computer Science; Management of Computing and Information Systems
Analysis of Bernstein’s Factorization Circuit....Pages 1-26
A Variant of the Cramer-Shoup Cryptosystem for Groups of Unknown Order....Pages 27-45
Looking beyond XTR....Pages 46-63
Bounds for Robust Metering Schemes and Their Relationship with A 2 -code....Pages 64-80
Unconditionally Secure Anonymous Encryption and Group Authentication....Pages 81-99
Adapting the Weaknesses of the Random Oracle Model to the Generic Group Model....Pages 100-109
On the Impossibilities of Basing One-Way Permutations on Central Cryptographic Primitives....Pages 110-124
A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order....Pages 125-142
Efficient Oblivious Transfer in the Bounded-Storage Model....Pages 143-159
In How Many Ways Can You Write Rijndael?....Pages 160-175
On the Security of Rijndael-Like Structures against Differential and Linear Cryptanalysis....Pages 176-191
Threshold Cryptosystems Based on Factoring....Pages 192-205
Non-interactive Distributed-Verifier Proofs and Proving Relations among Commitments....Pages 206-224
Asynchronous Secure Communication Tolerating Mixed Adversaries....Pages 224-242
Amplified Boomerang Attack against Reduced-Round SHACAL....Pages 243-253
Enhancing Differential-Linear Cryptanalysis....Pages 254-266
Cryptanalysis of Block Ciphers with Overdefined Systems of Equations....Pages 267-287
Analysis of Neural Cryptography....Pages 288-298
The Hardness of Hensel Lifting: The Case of RSA and Discrete Logarithm....Pages 299-310
A Comparison and a Combination of SST and AGM Algorithms for Counting Points of Elliptic Curves in Characteristic 2....Pages 311-327
A General Formula of the ( t, n )-Threshold Visual Secret Sharing Scheme....Pages 328-345
On Unconditionally Secure Robust Distributed Key Distribution Centers....Pages 346-363
Short Signatures in the Random Oracle Model....Pages 364-378
The Provable Security of Graph-Based One-Time Signatures and Extensions to Algebraic Signature Schemes....Pages 379-396
Transitive Signatures Based on Factoring and RSA....Pages 397-414
1-out-of-n Signatures from a Variety of Keys....Pages 415-432
A Revocation Scheme with Minimal Storage at Receivers....Pages 433-450
Optimistic Mixing for Exit-Polls....Pages 451-465
Improved Construction of Nonlinear Resilient S-Boxes....Pages 466-483
An Upper Bound on the Number of m -Resilient Boolean Functions....Pages 484-496
Group Diffie-Hellman Key Exchange Secure against Dictionary Attacks....Pages 497-514
Secure Channels Based on Authenticated Encryption Schemes: A Simple Characterization....Pages 515-532
ID-Based Blind Signature and Ring Signature from Pairings....Pages 533-547
Hierarchical ID-Based Cryptography....Pages 548-566
Crypto-integrity....Pages 567-573
Gummy and Conductive Silicone Rubber Fingers Importance of Vulnerability Analysis....Pages 574-575
