Applied cryptography and network security : third international conference, ACNS 2005, New York, NY, USA, June 7-10 2005 : proceedings / John Ionnidis, Angelos Keromytis, Moti Yung (eds)
Machine derived contents note: Two-Server Password-Only Authenticated Key Exchange.- Strengthening Password-Based Authentication Protocols Against Online Dictionary Attacks.- Cryptanalysis of an Improved Client-to-Client Password-Authenticated Key Exchange (C2C-PAKE) Scheme.- Efficient Security Mechanisms for Overlay Multicast-Based Content Distribution.- A Traitor Tracing Scheme Based on RSA for Fast Decryption.- N-Party Encrypted Diffie-Hellman Key Exchange Using Different Passwords.- Messin' with Texas Deriving Mother's Maiden Names Using Public Records.- Mitigating Network Denial-of-Service Through Diversity-Based Traffic Management.- Searching for High-Value Rare Events with Uncheatable Grid Computing.- Digital Signatures Do Not Guarantee Exclusive Ownership.- Thompson's Group and Public Key Cryptography.- Rainbow, a New Multivariable Polynomial Signature Scheme.- Badger - A Fast and Provably Secure MAC.- IDS False Alarm Reduction Using Continuous and Discontinuous Patterns.- Indexing Information for Data Forensics.- Model Generalization and Its Implications on Intrusion Detection.- Intrusion-Resilient Secure Channels.- Optimal Asymmetric Encryption and Signature Paddings.- Efficient and Leakage-Resilient Authenticated Key Transport Protocol Based on RSA.- Identity Based Encryption Without Redundancy.- OACerts: Oblivious Attribute Certificates.- Dynamic k-Times Anonymous Authentication.- Efficient Anonymous Roaming and Its Security Analysis.- Quantifying Security in Hybrid Cellular Networks.- Off-Line Karma: A Decentralized Currency for Peer-to-peer and Grid Applications.- Building Reliable Mix Networks with Fair Exchange.- SCARE of the DES.- Robust Key Extraction from Physical Uncloneable Functions.- Efficient Constructions for One-Way Hash Chains.- Privacy Preserving Keyword Searches on Remote Encrypted Data.- An Efficient Solution to the Millionaires' Problem Based on Homomorphic Encryption.- Non-interactive Zero-Knowledge Arguments for Voting.- Short Signature and Universal Designated Verifier Signature Without Random Oracles.- Efficient Identity Based Ring Signature.- New Signature Schemes with Coupons and Tight Reduction
