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.
Inhaltsverzeichnis
Public Key Cryptography. - On Hash Function Firewalls in Signature Schemes. - Observability Analysis - Detecting When Improved Cryptosystems Fail -. - Efficient Hardware Implementations. - Precise Bounds for Montgomery Modular Multiplication and Some Potentially Insecure RSA Moduli. - Montgomery in Practice: How to Do It More Efficiently in Hardware. - MIST: An Efficient, Randomized Exponentiation Algorithm for Resisting Power Analysis. - An ASIC Implementation of the AES SBoxes. - Public Key Cryptography: Theory. - On the Impossibility of Constructing Non-interactive Statistically-Secret Protocols from Any Trapdoor One-Way Function. - The Representation Problem Based on Factoring. - Symmetric Ciphers. - Ciphers with Arbitrary Finite Domains. - Known Plaintext Correlation Attack against RC5. - E-Commerce and Applications. - Micropayments Revisited. - Proprietary Certificates. - Stateless-Recipient Certified E-Mail System Based on Verifiable Encryption. - Digital Signatures. - RSA-Based Undeniable Signatures for General Moduli. - Co-operatively Formed Group Signatures. - Transitive Signature Schemes. - Homomorphic Signature Schemes. - Public Key Encryption. - GEM: A Generic Chosen-Ciphertext Secure Encryption Method. - Securing Encryption + Proof of Knowledge in the Random Oracle Model. - Discrete Logarithm. - Nonuniform Polynomial Time Algorithm to Solve Decisional Diffie-Hellman Problem in Finite Fields under Conjecture. - Secure Key-Evolving Protocols for Discrete Logarithm Schemes.
