Applied Cryptography and Network Security: Third International Conference, ACNS 2005, New York, NY, USA, June 7-10, 2005, Proceedings (Lecture Notes in Computer Science (3531))

The 3rd International Conference on Applied Cryptography and Network Security (ACNS 2005) was sponsored and organized by ICISA (the International Commu- cations and Information Security Association). It was held at Columbia University in New York, USA, June 7–10, 2005. This conference proceedings volume contains papers presented in the academic/research track. ACNS covers a large number of research areas that have been gaining importance in recent years due to the development of the Internet, wireless communication and the increased global exposure of computing resources. The papers in this volume are representative of the state of the art in security and cryptography research, worldwide. The Program Committee of the conference received a total of 158 submissions from all over the world, of which 35 submissions were selected for presentation at the a- demic track. In addition to this track, the conference also hosted a technical/ industrial/ short papers track whose presentations were also carefully selected from among the submissions. All submissions were reviewed by experts in the relevant areas. Two-server Password-only Authenticated Key Exchange / Jonathan Katz -- Strengthening Password-based Authentication Protocols Against Online Dictionary Attacks / Peng Wang, Yongdae Kim, Vishal Kher -- Cryptanalysis Of An Improved Client-to-client Password-authenticated Key Exchange (c2c-pake) Scheme / Raphael C.-w. Phan And Bok-min Goi -- Efficient Security Mechanisms For Overlay Multicast-based Content Distribution / Sencun Zhu, Chao Yao, Donggang Liu -- A Traitor Tracing Scheme Based On Rsa For Fast Decryption / John Patrick Mcgregor, Yiqun Lisa Yin, And Ruby B. Lee -- N-party Encrypted Diffie-hellman Key Exchange Using Different Passwords / Jin Wook Byun And Dong Hoon Lee -- Messin' With Texas Deriving Mother's Maiden Names Using Public Records / Virgil Griffith And Markus Jakobsson -- Mitigating Network Denial-of-service Through Diversity-based Traffic Management / Ashraf Matrawy, Paul C. Van Oorschot, And Anil Somayaji --^ Searching For High-value Rare Events With Uncheatable Grid Computing / Wenliang Du And Michael T. Goodrich -- Digital Signatures Do Not Guarantee Exclusive Ownership / Thomas Pornin And Julien P. Stern -- Thompson's Group And Public Key Cryptography / Vladimir Shpilrain And Alexander Ushakov -- Rainbow, A New Multivariable Polynomial Signature Scheme / Jintai Ding And Dieter Schmidt -- Badger : A Fast And Provably Secure Mac / Martin Boesgaard, Thomas Christensen, And Erik Zenner -- Ids False Alarm Reduction Using Continuous And Discontinuous Patterns / Abdulrahman Alharby And Hideki Imai -- Indexing Information For Data Forensics / Michael T. Goodrich, Mikhail J. Atallah, And Roberto Tamassia -- Model Generalization And Its Implications On Intrusion Detection / Zhuowei Li, Amitabha Das, And Jianying Zhou -- Intrusion-resilient Secure Channels / Gene Itkis, Robert Mcnerney Jr., And Scott Russell --^ Optimal Asymmetric Encryption And Signature Paddings Benoit Chevallier-mames, Duong Hieu Phan, And David Pointcheval -- Efficient And Leakage-resilient Authenticated Key Transport Protocol Based On Rsa / Seonghan Shin, Kazukuni Kobara, And Hideki Imi -- Identity Based Encryptionwithout Redundancy / Benoit Libert And Jean-jacques Quisquater -- Oacerts : Oblivious Attribute Certificates / Jiangtao Li And Ninghui Li-- Dynamic K-times Anonymous Authentication / Lan Nguyen And Rei Safavi-naini -- Efficient Anonymous Roaming And Its Security Analysis / Guomin Yang, Duncan S. Wong, And Xiaotie Deng -- Quantifying Security In Hybrid Cellular Networks / Markus Jakobsson And Liu Yang -- Off-line Karma : A Decentralized Currency For Peer-to-peer And Grid Applications / Flavio D. Garcia And Jaap-henk Hoepman -- Building Reliable Mix Networks With Fair Exchange / Michael K. Reiter, Xiaofeng Wang, And Matthew Wright --^ Scare Of The Des (side Channel Analysis For Reverse Engineering Of The Data Encryption Standard) / Remy Daudigny, Herve Ledi And Frederic Muller -- Robust Key Extraction From Physical Uncloneable Functions / B. Skoric, P. Tuyls, And W. Ophey -- Efficient Constructions For One-way Hash Chains / Yih-chun Hu, Markus Jakobsson, And Adrian Perrig -- Privacy Preserving Keyword Searches On Remote Encrypted Data / Yan-cheng Chang And Michael Mitzenmacher -- An Efficient Solution To The Millionaires' Problem Based On Homomorphic Encryption / Hsiao-ying Lin And Wen-guey Tzeng -- Non-interactive Zero-knowledge Arguments For Voting / Jens Groth -- Short Signature And Universal Designated Verifier Signature Without Random Oracles / Rui Zhang, Jun Furukawa, And Hideki Imai -- Efficient Identity Based Ring Signature / Sherman S.m. Chow, Siu-ming Yiu, And Lucas C.k. Hui -- New Signature Schemes With Coupons And Tight Reduction / Benoit Chevallier-mames. John Ioannidis, Angelos Keromytis, Moti Yung (eds.). Includes Bibliographical References And Index. Also Issued Online. Front Matter....Pages - Two-Server Password-Only Authenticated Key Exchange....Pages 1-16 Strengthening Password-Based Authentication Protocols Against Online Dictionary Attacks....Pages 17-32 Cryptanalysis of an Improved Client-to-Client Password-Authenticated Key Exchange (C2C-PAKE) Scheme....Pages 33-39 Efficient Security Mechanisms for Overlay Multicast-Based Content Distribution....Pages 40-55 A Traitor Tracing Scheme Based on RSA for Fast Decryption....Pages 56-74 N-Party Encrypted Diffie-Hellman Key Exchange Using Different Passwords....Pages 75-90 Messin’ with Texas Deriving Mother’s Maiden Names Using Public Records....Pages 91-103 Mitigating Network Denial-of-Service Through Diversity-Based Traffic Management....Pages 104-121 Searching for High-Value Rare Events with Uncheatable Grid Computing....Pages 122-137 Digital Signatures Do Not Guarantee Exclusive Ownership....Pages 138-150 Thompson’s Group and Public Key Cryptography....Pages 151-163 Rainbow, a New Multivariable Polynomial Signature Scheme....Pages 164-175 Badger – A Fast and Provably Secure MAC....Pages 176-191 IDS False Alarm Reduction Using Continuous and Discontinuous Patterns....Pages 192-205 Indexing Information for Data Forensics....Pages 206-221 Model Generalization and Its Implications on Intrusion Detection....Pages 222-237 Intrusion-Resilient Secure Channels....Pages 238-253 Optimal Asymmetric Encryption and Signature Paddings....Pages 254-268 Efficient and Leakage-Resilient Authenticated Key Transport Protocol Based on RSA....Pages 269-284 Identity Based Encryption Without Redundancy....Pages 285-300 OACerts: Oblivious Attribute Certificates....Pages 301-317 Dynamic k -Times Anonymous Authentication....Pages 318-333 Efficient Anonymous Roaming and Its Security Analysis....Pages 334-349 Quantifying Security in Hybrid Cellular Networks....Pages 350-363 Off-Line Karma: A Decentralized Currency for Peer-to-peer and Grid Applications....Pages 364-377 Building Reliable Mix Networks with Fair Exchange....Pages 378-392 SCARE of the DES....Pages 393-406 Robust Key Extraction from Physical Uncloneable Functions....Pages 407-422 Efficient Constructions for One-Way Hash Chains....Pages 423-441 Privacy Preserving Keyword Searches on Remote Encrypted Data....Pages 442-455 An Efficient Solution to the Millionaires’ Problem Based on Homomorphic Encryption....Pages 456-466 Non-interactive Zero-Knowledge Arguments for Voting....Pages 467-482 Short Signature and Universal Designated Verifier Signature Without Random Oracles....Pages 483-498 Efficient Identity Based Ring Signature....Pages 499-512 New Signature Schemes with Coupons and Tight Reduction....Pages 513-528 Back Matter....Pages - "The 3rd International Conference on Applied Cryptography and Network Security (ACNS 2005) was sponsored and organized by ICISA (the International Communi-cations and Information Security Association). It was held at Columbia University in New York, USA, J une 7-10, 2005." A well-known fact in the context of designing authentication systems is that human users/clients typically choose "weak", low-entropy passwords from a relatively small space of possibilities.