COVERT FLOW TREES - A VISUAL APPROACH TO ANALYZING COVERT STORAGE CHANNELS

被引:26
作者
KEMMERER, RA
PORRAS, PA
机构
[1] Reliable Software Group, Department of Computer Science, University of California, Santa Barbara
关键词
SECURITY; COVERT CHANNELS; NONINTERFERENCE SECURITY POLICY; SHARED RESOURCE MATRIX; CONFINEMENT; FLOW ANALYSIS; MULTILEVEL SECURITY; VISUAL ENVIRONMENTS; TREES;
D O I
10.1109/32.106972
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
This paper introduces a technique for detecting covert storage channels using a tree structure called a Covert Flow Tree (CFT). The benefits of using Covert Flow Trees to perform a covert channel analysis are twofold. First, by traversing the paths of a Covert Flow Tree, a comprehensive list of scenarios that potentially support covert communication via particular resource attributes can be automatically constructed. Secondly, Covert Flow Trees graphically illustrate the process through which information regarding the state of one attribute is relayed to another attribute, and how in turn that information is relayed to a listening process. Using this visual model to examine the routes by which information travels during covert communication enhances the analyst's understanding of the storage channel and may provide insight into the formation of countermeasures. Algorithms for automating the construction of Covert Flow Trees and potential covert channel operation sequences are presented. To illustrate this technique, two example systems are analyzed and their results compared to two currently accepted analysis techniques performed on identical systems. This comparison shows that the CFT approach not only identified all covert storage channels found by the other analysis techniques, but discovered a channel not detected by the other techniques.
引用
收藏
页码:1166 / 1185
页数:20
相关论文
共 13 条
[1]  
Bell D., 1975, ESDTR75306 MITRE COR
[2]   LATTICE MODEL OF SECURE INFORMATION-FLOW [J].
DENNING, DE .
COMMUNICATIONS OF THE ACM, 1976, 19 (05) :236-243
[3]  
Goguen J. A., 1982, Proceedings of the 1982 Symposium on Security and Privacy, P11
[4]  
HAIGH TJ, 1987, IEEE T SOFTWARE ENG, V13
[5]  
HU WM, 1991, 1991 P S RES SEC PRI
[6]  
KARGER PA, 1991, 1991 P S RES SEC PRI
[7]   SHARED RESOURCE MATRIX METHODOLOGY - AN APPROACH TO IDENTIFYING STORAGE AND TIMING CHANNELS [J].
KEMMERER, RA .
ACM TRANSACTIONS ON COMPUTER SYSTEMS, 1983, 1 (03) :256-277
[8]   CONFINEMENT PROBLEM [J].
LAMPSON, BW .
COMMUNICATIONS OF THE ACM, 1973, 16 (10) :613-615
[9]  
LIPNER SB, 1975, 5TH P S OP SYST PRIN
[10]  
MILLEN JK, 1976, COMMUN ACM, V19