DocumentCode :
2574086
Title :
Referential secrecy
Author :
Burns, R.K.
Author_Institution :
Kanne Associates Inc., Ashburnham, MA
fYear :
1990
fDate :
7-9 May 1990
Firstpage :
133
Lastpage :
142
Abstract :
A referential secrecy model is presented that simplifies automatic data classification within a relational database. The model captures the secrecy semantics that reflect the dependencies among foreign key references. These dependencies form the basis for specifying classification constraints, without the complexity of rule-based or view-based mechanisms. The secrecy semantics are expressed within the database schema as parameters to the foreign key definitions. Data classification is a function of the access levels of the foreign key reference tuples, as well as the access class of the subject
Keywords :
classification; data privacy; database theory; relational databases; access levels; automatic data classification; classification constraints; database schema; foreign key references; key dependencies; reference tuples; referential secrecy model; relational database; secrecy semantics; subject access class; Constraint theory; Data security; Database systems; Labeling; Monitoring; Operating systems; Relational databases; Transaction databases;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Research in Security and Privacy, 1990. Proceedings., 1990 IEEE Computer Society Symposium on
Conference_Location :
Oakland, CA
Print_ISBN :
0-8186-2060-9
Type :
conf
DOI :
10.1109/RISP.1990.63845
Filename :
63845
Link To Document :
بازگشت