DocumentCode
1884842
Title
Elimination of inference channels by optimal upgrading
Author
Stickel, Mark E.
Author_Institution
Artificial Intelligence Center, SRI Int., Menlo Park, CA, USA
fYear
1994
fDate
16-18 May 1994
Firstpage
168
Lastpage
174
Abstract
An inference channel exists if it is possible for a low-clearance user to infer high-classification data from low-classification data. Inference channels can be blocked by upgrading the security classification of some of the low-level data. The task of eliminating inference channels is formulated for solution by the Davis-Putnam theorem-proving procedure. The procedure is augmented to search for solutions with minimum total upgrade cost
Keywords
inference mechanisms; security of data; theorem proving; Davis-Putnam theorem-proving procedure; inference channels elimination; low-level data; optimal upgrading; security classification; Artificial intelligence; Contracts; Cost function; Data security; Inference algorithms; Linear programming; Relational databases; US Government;
fLanguage
English
Publisher
ieee
Conference_Titel
Research in Security and Privacy, 1994. Proceedings., 1994 IEEE Computer Society Symposium on
Conference_Location
Oakland, CA
Print_ISBN
0-8186-5675-1
Type
conf
DOI
10.1109/RISP.1994.296583
Filename
296583
Link To Document