Towards a Theory of Intrusion Detection
- 1 January 2005
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- p. 267-286
- https://doi.org/10.1007/11555827_16
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- How to Break a Practical MIX and Design a New OneLecture Notes in Computer Science, 2000
- The base-rate fallacy and its implications for the difficulty of intrusion detectionPublished by Association for Computing Machinery (ACM) ,1999
- Subquadratic approximation algorithms for clustering problems in high dimensional spacesPublished by Association for Computing Machinery (ACM) ,1999
- Asymptotically Optimal Covering DesignsJournal of Combinatorial Theory, Series A, 1996
- CRC Handbook of Combinatorial DesignsCombinatorics of Permutations, 1996
- New constructions for covering designsJournal of Combinatorial Designs, 1995
- Automated audit trail analysis for intrusion detectionComputers & Security, 1992
- An Intrusion-Detection ModelIEEE Transactions on Software Engineering, 1987
- Probabilistic encryptionJournal of Computer and System Sciences, 1984
- On coveringsPacific Journal of Mathematics, 1964