default search action
ID 1999: Santa Clara, California, USA
- Proceedings of the Workshop on Intrusion Detection and Network Monitoring, Santa Clara, CA, USA, April 9-12, 1999. USENIX 1999, ISBN 1-880446-37-5
Analysis and Large Networks
- John Green, David J. Marchette, Stephen Northcutt, Bill Ralph:
Analysis Techniques for Detecting Coordinated Attacks and Probes. 1-9 - Tom Dunigan, Greg Hinkel:
Intrusion Detection and Intrusion Prevention on a Large Network: A Case Study. 11-17 - Luc Girardin:
An Eye on Network Intruder-Administrator Shootouts. 19-28
Software and Processes
- R. Sekar, Thomas F. Bowen, Mark E. Segal:
On Preventing Intrusions by Process Behavior Monitoring. 29-40 - Sebastian G. Elbaum, John C. Munson:
Intrusion Detection Through Dynamic Software Measurement. 41-50 - Anup K. Ghosh, Aaron Schwartzbard, Michael Schatz:
Learning Program Behavior Profiles for Intrusion Detection. 51-62
IDS Systems
- Wenke Lee, Christopher T. Park, Salvatore J. Stolfo:
Automated Intrusion Detection Using NFR: Methods and Experiences. 63-72 - Peter G. Neumann, Phillip A. Porras:
Experience with EMERALD to Date. 73-80 - Daniel V. Klein:
Defending Against the Wily Surfer-Web-based Attacks and Defenses. 81-92
Network Data Processing and Storage
- Minaxi Gupta, Mani Subramanian:
Preprocessor Algorithm for Network Management Codebook. 93-102 - Charles J. Antonelli, M. Undy, Peter Honeyman:
The Packet Vault: Secure Storage of Network Data. 103-109 - Riccardo Bettati, Wei Zhao, D. Teodor:
Real-time Intrusion Detection and Suppression in ATM Networks. 111-118
Statistics and Anomalies
- David J. Marchette:
A Statistical Method for Profiling Network Traffic. 119-128 - Roland Büschkes, Mark Borning, Dogan Kesdogan:
Transaction-based Anomaly Detection. 129-140
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.