loading...
Probabilistic Validation of an Intrusion-Tolerant Replication System
San Francisco, California June 22-June 25
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/DSN.2003.12099712003 International Conference on Depe ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Sankalp Singh, University of Illinois at Urbana-Champaign
Michel Cukier, University of Maryland at College Park
William H. Sanders, University of Illinois at Urbana-Champaign
As computer systems become more complex and more widely distributed, it is becoming increasingly difficult to remove all vulnerabilities that can potentially be exploited by intruders. Intrusion tolerance is an emerging approach that aims to enable systems to continue functioning in spite of successful intrusions. Before intrusion tolerance is accepted as an approach to security, there must be quantitative techniques to measure its ef.cacy. However, there have been very few attempts at quantitative validation of intrusion-tolerant systems or, for that matter, of security in general. In this paper, we show that probabilistic validation through stochastic modeling is an attractive mechanism for evaluating intrusion tolerance. We demonstrate our approach by using stochastic activity networks to quantitatively validate an intrusion-tolerant replication management system. We characterize the intrusion tolerance provided by the system through several measures de.ned on the model, and study variations in these measures in response to changes in system parameters to evaluate the relative merits of various design choices.
Citation:
Sankalp Singh, Michel Cukier, William H. Sanders, "Probabilistic Validation of an Intrusion-Tolerant Replication System," dsn, pp.615, 2003 International Conference on Dependable Systems and Networks (DSN'03), 2003
Usage of this product signifies your acceptance of the Terms of Use.