Advances in Cryptology – CRYPTO 2003: 23rd Annual International Cryptology Conference, Santa Barbara, California, USA, August 17-21, 2003. Proceedings

Adi Shamir, Eran Tromer (auth.), Dan Boneh (eds.)3540406743, 9783540406747

Crypto 2003, the 23rd Annual Crypto Conference, was sponsored by the Int- national Association for Cryptologic Research (IACR) 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. The conference received 169 submissions, of which the program committee selected 34 for presentation. These proceedings contain the revised versions of the 34 submissions that were presented at the conference. These revisions have not been checked for correctness, and the authors bear full responsibility for the contents of their papers. Submissions to the conference represent cutti- edge research in the cryptographic community worldwide and cover all areas of cryptography. Many high-quality works could not be accepted. These works will surely be published elsewhere. The conference program included two invited lectures. Moni Naor spoke on cryptographic assumptions and challenges. Hugo Krawczyk spoke on the ‘SI- and-MAc’approachtoauthenticatedDi?e-HellmananditsuseintheIKEpro- cols. The conference program also included the traditional rump session, chaired by Stuart Haber, featuring short, informal talks on late-breaking research news. Assembling the conference program requires the help of many many people. To all those who pitched in, I am forever in your debt. I would like to ?rst thank the many researchers from all over the world who submitted their work to this conference. Without them, Crypto could not exist. I thank Greg Rose, the general chair, for shielding me from innumerable logistical headaches, and showing great generosity in supporting my e?orts.

---

Table of contents :
Front Matter….Pages –
Factoring Large Numbers with the TWIRL Device….Pages 1-26
New Partial Key Exposure Attacks on RSA….Pages 27-43
Algebraic Cryptanalysis of Hidden Field Equation (HFE) Cryptosystems Using Gröbner Bases….Pages 44-60
On Constructing Locally Computable Extractors and Cryptosystems in the Bounded Storage Model….Pages 61-77
Unconditional Authenticity and Privacy from an Arbitrarily Weak Secret….Pages 78-95
On Cryptographic Assumptions and Challenges….Pages 96-109
Scalable Protocols for Authenticated Group Key Exchange….Pages 110-125
Practical Verifiable Encryption and Decryption of Discrete Logarithms….Pages 126-144
Extending Oblivious Transfers Efficiently….Pages 145-161
Algebraic Attacks on Combiners with Memory….Pages 162-175
Fast Algebraic Attacks on Stream Ciphers with Linear Feedback….Pages 176-194
Cryptanalysis of Safer++ ….Pages 195-211
A Polynomial Time Algorithm for the Braid Diffie-Hellman Conjugacy Problem….Pages 212-225
The Impact of Decryption Failures on the Security of NTRU Encryption….Pages 226-246
Universally Composable Efficient Multiparty Computation from Threshold Homomorphic Encryption….Pages 247-264
Universal Composition with Joint State….Pages 265-281
Statistical Zero-Knowledge Proofs with Efficient Provers: Lattice Problems and More….Pages 282-298
Derandomization in Cryptography….Pages 299-315
On Deniability in the Common Reference String and Random Oracle Model….Pages 316-337
Primality Proving via One Round in ECPP and One Iteration in AKS….Pages 338-348
Torus-Based Cryptography….Pages 349-365
Efficient Universal Padding Techniques for Multiplicative Trapdoor One-Way Permutation….Pages 366-382
Multipurpose Identity-Based Signcryption….Pages 383-399
SIGMA: The ‘SIGn-and-MAc’ Approach to Authenticated Diffie-Hellman and Its Use in the IKE Protocols….Pages 400-425
On Memory-Bound Functions for Fighting Spam….Pages 426-444
Lower and Upper Bounds on Obtaining History Independence….Pages 445-462
Private Circuits: Securing Hardware against Probing Attacks….Pages 463-481
A Tweakable Enciphering Mode….Pages 482-499
A Message Authentication Code Based on Unimodular Matrix Groups….Pages 500-512
Luby-Rackoff: 7 Rounds Are Enough for 2 n(1 − ε) Security….Pages 513-529
Weak Key Authenticity and the Computational Completeness of Formal Encryption….Pages 530-547
Plaintext Awareness via Key Registration….Pages 548-564
Relaxing Chosen-Ciphertext Security….Pages 565-582
Password Interception in a SSL/TLS Channel….Pages 583-599
Instant Ciphertext-Only Cryptanalysis of GSM Encrypted Communication….Pages 600-616
Making a Faster Cryptanalytic Time-Memory Trade-Off….Pages 617-630
Back Matter….Pages –