04938nam a22005175i 4500001001800000003000900018005001700027007001500044008004100059020001800100024003100118050001500149072001600164072002300180082001500203245020300218264006100421300003200482336002600514337002600540338003600566347002400602490005800626505152000684520155802204650002203762650003503784650004003819650001503859650001603874650003503890650003603925650002203961650002103983650002704004650002304031650004604054650005304100650004704153700002804200710003404228773002004262776003604282830005804318856004404376978-3-540-45760-2DE-He21320170515111539.0cr nn 008mamaa121227s2002 gw | s |||| 0|eng d a97835404576027 a10.1007/3-540-45760-72doi 4aQA76.9.A25 7aURY2bicssc 7aCOM0530002bisacsh04a005.8222310aTopics in Cryptology — CT-RSA 2002h[electronic resource] :bThe Cryptographers’ Track at the RSA Conference 2002 San Jose, CA, USA, February 18–22, 2002 Proceedings /cedited by Bart Preneel. 1aBerlin, Heidelberg :bSpringer Berlin Heidelberg,c2002. aX, 318 p.bonline resource. atextbtxt2rdacontent acomputerbc2rdamedia aonline resourcebcr2rdacarrier atext filebPDF2rda1 aLecture Notes in Computer Science,x0302-9743 ;v22710 aPublic 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. aThis 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. 0aComputer science. 0aOperating systems (Computers). 0aData encryption (Computer science). 0aComputers. 0aAlgorithms. 0aComputer sciencexMathematics. 0aManagement information systems.14aComputer Science.24aData Encryption.24aTheory of Computation.24aOperating Systems.24aDiscrete Mathematics in Computer Science.24aManagement of Computing and Information Systems.24aAlgorithm Analysis and Problem Complexity.1 aPreneel, Bart.eeditor.2 aSpringerLink (Online service)0 tSpringer eBooks08iPrinted edition:z9783540432241 0aLecture Notes in Computer Science,x0302-9743 ;v227140uhttp://dx.doi.org/10.1007/3-540-45760-7