default search action
6th CCS 1999: Singapore
- Juzar Motiwalla, Gene Tsudik:
CCS '99, Proceedings of the 6th ACM Conference on Computer and Communications Security, Singapore, November 1-4, 1999. ACM 1999, ISBN 1-58113-148-8 - Stefan Axelsson:
The Base-Rate Fallacy and Its Implications for the Difficulty of Intrusion Detection. 1-7 - R. Sekar, Y. Guang, S. Verma, T. Shanbhag:
A High-Performance Network Intrusion Detection System. 8-17 - Boaz Barak, Amir Herzberg, Dalit Naor, Eldad Shai:
The Proactive Security Toolkit and Applications. 18-27 - Ari Juels, Martin Wattenberg:
A Fuzzy Commitment Scheme. 28-36 - Guillaume Poupard, Jacques Stern:
On the Fly Signatures Based on Factoring. 37-45 - Ronald Cramer, Victor Shoup:
Signature Schemes Based on the Strong RSA Assumption. 46-51 - Andrew W. Appel, Edward W. Felten:
Proof-Carrying Authentication. 52-62 - Maurizio Kliban Boyarsky:
Public-Key Cryptography and Password Protocols: The Multi-User Case. 63-72 - Fabian Monrose, Michael K. Reiter, Susanne Wetzel:
Password Hardening Based on Keystroke Dynamics. 73-82 - Alain J. Mayer, Moti Yung:
Secure Protocol Transformation via "Expansion": From Two-Party to Groups. 83-92 - Pankaj Rohatgi:
A Compact and Fast Hybrid Signature Scheme for Multicast Packet Authentication. 93-100 - Refik Molva, Alain Pannetrat:
Scalable Multicast Security in Dynamic Groups. 101-112 - Dan Boneh, Matthew K. Franklin:
Anonymous Authentication with Subset Queries (extended abstract). 113-119 - Christian Cachin:
Efficient Private Bidding and Auctions with an Oblivious Third Party. 120-127 - William Aiello, Aviel D. Rubin, Martin Strauss:
Using Smartcards to Secure a Personalized Gambling Device. 128-137 - Giuseppe Ateniese:
Efficient Verifiable Encryption (and Fair Exchange) of Digital Signatures. 138-146
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.