Detecting Cascade Vulnerability in Linear Time

Simple item page
dc.contributor.authorHorton, J., D.
dc.date.accessioned2023-03-01T18:27:36Z
dc.date.available2023-03-01T18:27:36Z
dc.date.issued2000
dc.description.abstractThe cascade vulnerability detection problem asks whether an opponent can use interconnections to pass data improperly across a network of individually accredited systems without having to defeat any single system that is rated high enough to be judged safe for the particular data flow. In the most general setting, an algorithm is given of time complexity O(CD2U2 + LDU), where C is the number of computers, D is the number of different classes of data, U is the number of different classes of user, and L is the number of links in the network. In the case with a linear data classification, the time complexity reduces to O(CD2 + LD), which improves on the previous best complexity of O(C3D). The case with parallel linear data classes is also solved in O(CD2 + LD) time. Keywords: algorithm, network security, cascade vulnerability, detection problem
dc.description.copyrightCopyright @ J. D. Horton, 2000.
dc.identifier.urihttps://unbscholar.lib.unb.ca/handle/1882/14761
dc.rightshttp://purl.org/coar/access_right/c_abf2
dc.subject.disciplineComputer Science
dc.titleDetecting Cascade Vulnerability in Linear Time
dc.typetechnical report

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
item.pdf
Size:
111.12 KB
Format:
Adobe Portable Document Format
Download

Collections

Research Reports