The Cascade Vulnerability Problem: The detection problem and a simulated annealing approach for its correction

Microprocessors and Microsystems

Volumn 21, Issue 10, 1998, Pages 621-627

  Gritzalis, Stefanos ^a,b   Spinellis, Diomidis ^c  

^a UNIVERSITY OF ATHENS   (Greece)

^b UNIVERSITY OF WEST ATTICA   (Greece)

^c UNIVERSITY OF THE AEGEAN   (Greece)

Author keywords

Cascade vulnerability problem; Network and open distributed systems security; Risk analysis; Simulated annealing

Indexed keywords

COMPUTATIONAL LINGUISTICS; DISTRIBUTED COMPUTER SYSTEMS; SECURITY OF DATA; SIMULATED ANNEALING;

CASCADE VULNERABILITY PROBLEM; RESTRICTED CASCADE CORRECTION PROBLEM; RISK ANALYSIS;

ALGORITHMS;

EID: 0032045587     PISSN: 01419331     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0141-9331(98)00064-7     Document Type: Article

References (18)

1. National Computer Security Center, Trusted Network Interpretation of the Trusted Computer System Evaluation Criteria, Red Book NCSC-TG-005, Library No. S228, 526, Version 1, National Computer Security Center, USA, 1987.
2. T. Madron, Network Security in the 90's, Wiley, New York, 1990.
3. J.A. Fitch III, L.J. Hoffman, The Cascade problem: Graph Theory can help, Proceedings of the 14th National Computer Security Conference, 1991, National Computer Security Centre, Baltimore, MD pp. 88-100.
4. J.A. Fitch III, , L.J. Hoffman, A shortest path network security model, Computers and Security 12 (1993) 169-189.
5. J.K. Millen, M.W. Schwartz, The Cascading problem for interconnected networks, Proceedings of the Fourth Aerospace Computer Security Applications Conference, 1988, National Computer Security Centre, Baltimore, MD pp. 269-273.
6. National Computer Security Center, Technical Rationale Behind CSC-STD-003-85: Computer Security Requirements, CSC-STD-004-85, National Computer Security Center, USA, 1985.
7. T.M.P. Lee, Statistical models of trust: TCBs vs. People, Proceedings of the IEEE Symposium on Security and Privacy, 1989, IEEE Computer Society Press, Los Alamitos, CA, 1989, pp. 10-19.
8. A. Aho, J. Hopcroft, J. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Massachusetts, 1974.
9. J.D. Horton, R.H. Cooper, W.F. Hyslop, B.G. Nickerson, O.K. Ward, R. Harland, E. Ashby, W.M. Stewart, The Cascade Vulnerability Problem, Journal of Computer Security 2 (4) (1993) 279-290.
10. J.K. Millen, Algorithm for the Cascading problem, in: J.P. Anderson (Ed.), Internet IEEE Cipher News Group, June 25, 1990, IEEE Cipher Forum on dockmaster.ncsc.mil.
11. M. Metropolis, A.N. Rosenbluth, M.N. Rosenbluth, A.H. Teller, E. Teller, Equation of state calculation by fast computing machines, Journal of Chemical Physics 21 (6) (1953) 1087-1092.
12. S. Kirkpatrick, C. Gelatt, P. Vecchi, Optimization by simulated annealing, Science 220 (1983) 671-679.
13. V. Cerny, Thermodynamical approach to the travelling salesman problem: an efficient simulation algorithm, Journal of Optimization Theory and Applications 45 (1985) 41-51.
14. D.E. Goldberg, Genetic Algorithms: In Search of Optimization Machine Learning, Addison-Wesley, Reading, Massachusetts, 1989.
15. F. Glover, Tabu search - part I, ORSA Journal on Computing 1 (1990) 190-206.
16. R. Gupta, S.A. Smolka, S. Bhaskar, On randomization in sequential and distributed algorithms, ACM Computing Surveys 26 (1) (1994) 7-86.
17. P.J. Van Laarhoven, E.H.L. Aarts, Simulated Annealing: Theory and Applications, Kluwer, Reider Publishers Dordrecht, The Netherlands, 1987.
18. W.H. Press, B.P. Flannery, S.A. Teukolsky, W.T. Vetterling, Numerical Recipes in C, Cambridge University Press, London, 1988, pp. 343-352.