Topics in Cryptology - CT-RSA 2002: The Cryptographer's Track at the RSA Conference 2002, San Jose, CA, USA, February 18-22, 2002, Proceedings (Lecture Notes in Computer Science, 2271)

This volume continues the tradition established in 2001 of publishing the c- tributions presented at the Cryptographers’ Track (CT-RSA) of the yearly RSA Security Conference in Springer-Verlag’s Lecture Notes in Computer Science series. With 14 parallel tracks and many thousands of participants, the RSA - curity Conference is the largest e-security and cryptography conference. In this setting, the Cryptographers’ Track presents the latest scienti?c developments. The program committee considered 49 papers and selected 20 for presen- tion. One paper was withdrawn by the authors. The program also included two invited talks by Ron Rivest (“Micropayments Revisited” – joint work with Silvio Micali) and by Victor Shoup (“The Bumpy Road from Cryptographic Theory to Practice”). Each paper was reviewed by at least three program committee members; paperswrittenbyprogramcommitteemembersreceivedsixreviews.Theauthors of accepted papers made a substantial e?ort to take into account the comments intheversionsubmittedtotheseproceedings.Inalimitednumberofcases,these revisions were checked by members of the program committee. I would like to thank the 20 members of the program committee who helped to maintain the rigorous scienti?c standards to which the Cryptographers’ Track aims to adhere. They wrote thoughtful reviews and contributed to long disc- sions; more than 400 Kbyte of comments were accumulated. Many of them - tended the program committee meeting, while they could have been enjoying the sunny beaches of Santa Barbara. On Hash Function Firewalls In Signature Schemes / Burton S. Kaliski, Jr. -- Observability Analysis -- Detecting When Improved Cryptosystems Fail / Marc Joye, Jean-jacques Quisquater And Sung-ming Yen / [et Al.] -- Precise Bounds For Montgomery Modular Multiplication And Some Potentially Insecure Rsa Moduli / Colin D. Walter -- Montgomery In Practice: How To Do It More Efficiently In Hardware / Lejla Batina And Geeke Muurling -- Mist: An Efficient, Randomized Exponentiation Algorithm For Resisting Power Analysis / Colin D. Walter -- An Asic Implementation Of The Aes Sboxes / Johannes Wolkerstorfer, Elisabeth Oswald And Mario Lamberger -- On The Impossibility Of Constructing Non-interactive Statistically-secret Protocols From Any Trapdoor One-way Function / Marc Fischlin -- The Representation Problem Based On Factoring / Marc Fischlin And Roger Fischlin -- Ciphers With Arbitrary Finite Domains / John Black And Phillip Rogaway --^ Known Plaintext Correlation Attack Against Rc5 / Atsuko Miyaji, Masao Nonaka And Yoshinori Takii -- Micropayments Revisited / Silvio Micali And Ronald L. Rivest -- Proprietary Certificates / Markus Jakobsson, Ari Juels And Phong Q. Nguyen -- Stateless-recipient Certified E-mail System Based On Verifiable Encryption / Giuseppe Ateniese And Cristina Nita-rotaru -- Rsa-based Undeniable Signatures For General Moduli / Steven D. Galbraith, Wenbo Mao And Kenneth G. Paterson -- Co-operatively Formed Group Signatures / Greg Maitland And Colin Boyd -- Transitive Signature Schemes / Silvio Micali And Ronald L. Rivest -- Homomorphic Signature Schemes / Robert Johnson, David Molnar And Dawn Song / [et Al.] -- Gem: A Generic Chosen-ciphertext Secure Encryption Method / Jean-sebastien Coron, Helena Handschuh And Marc Joye / [et Al.] -- Securing Encryption + Proof Of Knowledge In The Random Oracle Model / Masayuki Abe --^ Nonuniform Polynomial Time Algorithm To Solve Decisional Diffie-hellman Problem In Finite Fields Under Conjecture / Qi Cheng And Shigenori Uchiyama -- Secure Key-evolving Protocols For Discrete Logarithm Schemes / Cheng-fen Lu And Shiuh Pyng Winston Shieh. Bart Preneel (ed.) Includes Bibliographical References And Index. On Hash Function Firewalls in Signature Schemes....Pages 1-16 Observability Analysis - Detecting When Improved Cryptosystems Fail -....Pages 17-29 Precise Bounds for Montgomery Modular Multiplication and Some Potentially Insecure RSA Moduli....Pages 30-39 Montgomery in Practice: How to Do It More Efficiently in Hardware....Pages 40-52 MIST : An Efficient, Randomized Exponentiation Algorithm for Resisting Power Analysis....Pages 53-66 An ASIC Implementation of the AES SBoxes....Pages 67-78 On the Impossibility of Constructing Non-interactive Statistically-Secret Protocols from Any Trapdoor One-Way Function....Pages 79-95 The Representation Problem Based on Factoring....Pages 96-113 Ciphers with Arbitrary Finite Domains....Pages 114-130 Known Plaintext Correlation Attack against RC5....Pages 131-148 Micropayments Revisited....Pages 149-163 Proprietary Certificates....Pages 164-181 Stateless-Recipient Certified E-Mail System Based on Verifiable Encryption....Pages 182-199 RSA-Based Undeniable Signatures for General Moduli....Pages 200-217 Co-operatively Formed Group Signatures....Pages 218-235 Transitive Signature Schemes....Pages 236-243 Homomorphic Signature Schemes....Pages 244-262 GEM: A G eneric Chosen-Ciphertext Secure E ncryption M ethod....Pages 263-276 Securing “Encryption + Proof of Knowledge” in the Random Oracle Model....Pages 277-289 Nonuniform Polynomial Time Algorithm to Solve Decisional Diffie-Hellman Problem in Finite Fields under Conjecture....Pages 290-299 Secure Key-Evolving Protocols for Discrete Logarithm Schemes....Pages 300-309 This volume continues the tradition established in 2001 of publishing the c- tributions presented at the Cryptographers' Track (CT-RSA) of the yearly RSA Security Conference in Springer-Verlag's Lecture Notes in Computer Science series. With 14 parallel tracks and many thousands of participants, the RSA - curity Conference is the largest e-security and cryptography conference. In this setting, the Cryptographers' Track presents the latest scienti?c developments. The program committee considered 49 papers and selected 20 for presen- tion. One paper was withdrawn by the authors. The program also included two invited talks by Ron Rivest ("Micropayments Revisited"--Joint work with Silvio Micali) and by Victor Shoup ("The Bumpy Road from Cryptographic Theory to Practice"). Each paper was reviewed by at least three program committee members; paperswrittenbyprogramcommitteemembersreceivedsixreviews. Theauthors of accepted papers made a substantial e?ort to take into account the comments intheversionsubmittedtotheseproceedings. Inalimitednumberofcases, these revisions were checked by members of the program committee. I would like to thank the 20 members of the program committee who helped to maintain the rigorous scienti?c standards to which the Cryptographers' Track aims to adhere. They wrote thoughtful reviews and contributed to long disc- sions; more than 400 Kbyte of comments were accumulated. Many of them - tended the program committee meeting, while they could have been enjoying the sunny beaches of Santa Barbara "This book constitutes the refereed proceedings of the Cryptographer's Track at the RSA Conference 2002, CT-RSA 2002, held in San Jose, CA, USA, in February 2002. The 20 revised full papers presented together with an invited paper were carefully reviewed and selected from 49 submissions. The papers are organized in topical sections on public key cryptography, efficient hardware implementations, symmetric cyphers, e-commerce and applications, digital signatures, public key encryption, and discrete logarithm"--Publisher description