Advances in Cryptology -- CRYPTO 2003: 23rd Annual International Cryptology Conference, Santa Barbara, California, USA, August 17-21, 2003, Proceedings (Lecture Notes in Computer Science, 2729)

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. Public Key Cryptanalysis I -- Factoring Large Numbers With The Twirl Device -- New Partial Key Exposure Attacks On Rsa -- Algebraic Cryptanalysis Of Hidden Field Equation (hfe) Cryptosystems Using Gröbner Bases -- Alternate Adversary Models -- On Constructing Locally Computable Extractors And Cryptosystems In The Bounded Storage Model -- Unconditional Authenticity And Privacy From An Arbitrarily Weak Secret -- Invited Talk I -- On Cryptographic Assumptions And Challenges -- Protocols -- Scalable Protocols For Authenticated Group Key Exchange -- Practical Verifiable Encryption And Decryption Of Discrete Logarithms -- Extending Oblivious Transfers Efficiently -- Symmetric Key Cryptanalysis I -- Algebraic Attacks On Combiners With Memory -- Fast Algebraic Attacks On Stream Ciphers With Linear Feedback -- Cryptanalysis Of Safer++ -- Public Key Cryptanalysis Ii -- A Polynomial Time Algorithm For The Braid Diffie-hellman Conjugacy Problem --^ The Impact Of Decryption Failures On The Security Of Ntru Encryption -- Universal Composability -- Universally Composable Efficient Multiparty Computation From Threshold Homomorphic Encryption -- Universal Composition With Joint State -- Zero-knowledge -- Statistical Zero-knowledge Proofs With Efficient Provers: Lattice Problems And More -- Derandomization In Cryptography -- On Deniability In The Common Reference String And Random Oracle Model -- Algebraic Geometry -- Primality Proving Via One Round In Ecpp And One Iteration In Aks -- Torus-based Cryptography -- Public Key Constructions -- Efficient Universal Padding Techniques For Multiplicative Trapdoor One-way Permutation -- Multipurpose Identity-based Signcryption -- Invited Talk Ii -- Sigma: The ‘sign-and-mac’ Approach To Authenticated Diffie-hellman And Its Use In The Ike Protocols -- New Problems -- On Memory-bound Functions For Fighting Spam -- Lower And Upper Bounds On Obtaining History Independence --^ Private Circuits: Securing Hardware Against Probing Attacks -- Symmetric Key Constructions -- A Tweakable Enciphering Mode -- A Message Authentication Code Based On Unimodular Matrix Groups -- Luby-rackoff: 7 Rounds Are Enough For 2 N(1????) Security -- New Models -- Weak Key Authenticity And The Computational Completeness Of Formal Encryption -- Plaintext Awareness Via Key Registration -- Relaxing Chosen-ciphertext Security -- Symmetric Key Cryptanalysis Ii -- Password Interception In A Ssl/tls Channel -- Instant Ciphertext-only Cryptanalysis Of Gsm Encrypted Communication -- Making A Faster Cryptanalytic Time-memory Trade-off. Dan Boneh (ed.). Includes Bibliographical References And Author Index. 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 - This book constitutes the refereed proceedings of the 23rd Annual International Cryptology Conference, CRYPTO 2003, held in Santa Barbara, California in August 2003. The 34 revised full papers presented together with 2 invited papers were carefully reviewed and selected from 166 submissions. The papers are organized in topical sections on public key cryptanalysis, alternate adversary models, protocols, symmetric key cryptanalysis, universal composability, zero knowledge, algebraic geometry, public key constructions, new problems, symmetric key constructions, and new models Bibliographic information published by Die Deutsche Bibliothek Die Deutsche Bibliothek lists this publication in the Deutsche Nationalbibliografie; detailed bibliographic data is available in the Internet at .