This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Ninth IEEE Computer Security Foundations Workshop
An Immunological Approach to Change Detection: Theoretical Results
Dromquinna Manor, Kenmare, County Kerry, Ireland
March 10-March 12
ISBN: 0-8186-7522-5
Patrik D'haeseleer, University of New Mexico patrik@cs.unm.edu
This paper examines some of the theoretical foundations of the distributable change detection method introduced by Forrest et al., including fundamental bounds on some of its parameters. A short overview is given of the reasoning behind this method, its immunological counterpart and its computer implementation. The amount of information that is lost by splitting a data stream into unordered strings can be estimated, and this estimate can be used to guide the choice of string length. A lower bound on the size of the detector set is derived, based on information-theoretic grounds. The principle of holes (undetectable nonself strings) is illustrated, along with a proof of their existence for a large class of matching rules. The influence of holes on the achievable failure rate is discussed, along with guidelines on how to avoid them.
Index Terms:
Immunology, change detection, distributed, negative selection, entropy, information loss, holes
Citation:
Patrik D'haeseleer, "An Immunological Approach to Change Detection: Theoretical Results," csfw, pp.18, Ninth IEEE Computer Security Foundations Workshop, 1996
Usage of this product signifies your acceptance of the Terms of Use.