Advances in Cryptology — CRYPTO 2002: 22nd Annual International Cryptology Conference Santa Barbara, California, USA, August 18–22, 2002 Proceedings

Sean Murphy, Matthew J.B. Robshaw (auth.), Moti Yung (eds.)354044050X, 9783540440505

Crypto 2002, the 22nd Annual Crypto Conference, was sponsored by IACR, the International Association for Cryptologic Research, in cooperation with the IEEE Computer Society Technical Committee on Security and Privacy and the Computer Science Department of the University of California at Santa Barbara. It is published as Vol. 2442 of the Lecture Notes in Computer Science (LNCS) of Springer Verlag. Note that 2002, 22 and 2442 are all palindromes… (Don’t nod!) Theconferencereceived175submissions,ofwhich40wereaccepted;twos- missionsweremergedintoasinglepaper,yieldingthetotalof39papersaccepted for presentation in the technical program of the conference. In this proceedings volume you will ?nd the revised versions of the 39 papers that were presented at the conference. The submissions represent the current state of work in the cryptographic community worldwide, covering all areas of cryptologic research. In fact, many high-quality works (that surely will be published elsewhere) could not be accepted. This is due to the competitive nature of the conference and the challenging task of selecting a program. I wish to thank the authors of all submitted papers. Indeed, it is the authors of all papers who have made this conference possible, regardless of whether or not their papers were accepted. The conference program was also immensely bene?ted by two plenary talks.

---

Table of contents :
Essential Algebraic Structure within the AES….Pages 1-16
Blockwise-Adaptive Attackers Revisiting the (In)Security of Some Provably Secure Encryption Modes: CBC, GEM, IACBC….Pages 17-30
Tweakable Block Ciphers….Pages 31-46
The LSD Broadcast Encryption Scheme….Pages 47-60
Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials….Pages 61-76
Provably Secure Steganography….Pages 77-92
Flaws in Applying Proof Methodologies to Signature Schemes….Pages 93-110
Separating Random Oracle Proofs from Complexity Theoretic Proofs: The Non-committing Encryption Case….Pages 111-126
On the Security of RSA Encryption in TLS….Pages 127-142
Security Analysis of IKE’s Signature-Based Key-Exchange Protocol….Pages 143-161
GQ and Schnorr Identification Schemes: Proofs of Security against Impersonation under Active and Concurrent Attacks….Pages 162-177
On 2-Round Secure Multiparty Computation….Pages 178-193
Private Computation — k -Connected versus 1-Connected Networks….Pages 194-209
Analysis and Improvements of NTRU Encryption Paddings….Pages 210-225
Universal Padding Schemes for RSA….Pages 226-241
Cryptanalysis of Unbalanced RSA with Small CRT-Exponent….Pages 242-256
Hyper-encryption against Space-Bounded Adversaries from On-Line Strong Extractors….Pages 257-271
Optimal Black-Box Secret Sharing over Arbitrary Abelian Groups….Pages 272-287
A Generalized Birthday Problem….Pages 288-304
(Not So) Random Shuffles of RC4….Pages 304-319
Black-Box Analysis of the Block-Cipher-Based Hash-Function Constructions from PGV….Pages 320-335
Supersingular Abelian Varieties in Cryptology….Pages 336-353
Efficient Algorithms for Pairing-Based Cryptosystems….Pages 354-369
Computing Zeta Functions of Hyperelliptic Curves over Finite Fields of Characteristic 2….Pages 369-384
Threshold Password-Authenticated Key Exchange….Pages 385-400
A Threshold Pseudorandom Function Construction and Its Applications….Pages 401-416
Efficient Computation Modulo a Shared Secret with Application to the Generation of Shared Safe-Prime Products….Pages 417-432
Hidden Number Problem with the Trace and Bit Security of XTR and LUC….Pages 433-448
Expanding Pseudorandom Functions; or: From Known-Plaintext Security to Chosen-Plaintext Security….Pages 449-464
Threshold Ring Signatures and Applications to Ad-hoc Groups….Pages 465-480
Deniable Ring Authentication….Pages 481-498
SiBIR: Signer-Base Intrusion-Resilient Signatures….Pages 499-514
Cryptanalysis of Stream Ciphers with Linear Masking….Pages 515-532
The Filter-Combiner Model for Memoryless Synchronous Stream Ciphers….Pages 533-548
A Larger Class of Cryptographic Boolean Functions via a Study of the Maiorana-McFarland Construction….Pages 549-564
Linear VSS and Distributed Commitments Based on Secret Sharing and Pairwise Checks….Pages 565-580
Perfect Hiding and Perfect Binding Universally Composable Commitment Schemes with Constant Expansion Factor….Pages 581-596
Unique Signatures and Verifiable Random Functions from the DH-DDH Separation….Pages 597-612
Security Proof for Partial-Domain Hash Signature Schemes….Pages 613-626