The cascade vulnerability problem

Author

Horton, J.D. ; Harland, Robert ; Ashby, Elton ; Cooper, R.H. ; Hyslop, W.F. ; Nickerson, B.G. ; Stewart, W.M. ; Ward, O.K.

Author_Institution

Fac. of Comput. Sci., New Brunswick Univ., Fredericton, NB, USA

fYear

1993

fDate

24-26 May 1993

Firstpage

110

Lastpage

116

Abstract

A cascade problem exists in a network of computers when data of a security level d can be passed to a user with a lower security clearance u elsewhere on the network without having to defeat any single component of the system that has an accreditation range great enough to allow users of level u and data of level d on a single system. An algorithm of time complexity O(an ³) and space complexity O(an²) is given to solve the cascade detection problem. Also, the cascade correction problem, to remove all cascading paths from a network for a given cost, under restrictive conditions is shown to be NP-complete

Keywords

computational complexity; computer networks; security of data; NP-complete; cascade correction problem; cascade detection problem; cascade vulnerability problem; computer network; cost; security clearance; security level; space complexity; time complexity; Accreditation; Ambient intelligence; Books; Computer networks; Computer science; Computer security; Costs; Data security; Information security; Protection;

fLanguage

English

Publisher

ieee

Conference_Titel

Research in Security and Privacy, 1993. Proceedings., 1993 IEEE Computer Society Symposium on

Conference_Location

Oakland, CA

Print_ISBN

0-8186-3370-0

Type

conf

DOI

10.1109/RISP.1993.287638

Filename

287638