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.
Author(s): Burton S. Kaliski Jr. (auth.), Bart Preneel (eds.)
Series: Lecture Notes in Computer Science 2271
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2002
Language: English
Pages: 318
Tags: Data Encryption; Discrete Mathematics in Computer Science; Operating Systems; Management of Computing and Information Systems; Algorithm Analysis and Problem Complexity; Computer Communication Networks
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
