Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Rae K. Burns

dblp:73/5878 · DBLP profile ↗
← Back
4ranked-venue papers
4as first author
0since 2021 · last 1996
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 4 · 4 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Privacy and data protection · 100%
Databases, data mining, and information retrieval
1 paper
Data models and query languages · 100%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Privacy and data protection
data classification
0.011990
Referential Secrecy · S&P 1990
Data models and query languages › relational model
relational schema
0.011990
Referential Secrecy · S&P 1990

Methods — techniques the papers use, named apart from their topics

classification constraint specification · 0.0
YearPublicationVenuePosition
1996 A Comparison of Multilevel Structured Query Language (SQL) Implementations
abstract
The current commercial multilevel secure (MLS) database management system (DBMS) products provide extensions to SQL to support multilevel database applications. However, the DBMS vendors have implemented a variety of mechanisms that are both difficult to understand and ineffective in addressing a number of application concerns. The paper documents and compares the SQL extensions for Informix Online/Secure, Trusted Oracle, Trusted Rubix, and Sybase Secure SQL server. Based on the vendors' current implementations, we have developed recommendations for an MLS SQL standard that would support interoperability both among the MLS DBMS products and with standard SQL client applications. We have also analyzed the vendors' approaches to polyinstantiation and signaling channels; our recommendations include improved support for cover stories and better control of inherent signaling channels.
Rae K. Burns, Yi-Fang Koh
ACSAC1
1995 Inference Analysis During Multilevel Database Design
Rae K. Burns
DBSec1
1990 Referential Secrecy
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.>
Rae K. Burns
S&P1
1987 Operational Assurance for a Trusted DBMS
Rae K. Burns
DBSec1