Views for Multilevel Database Security

  • Authors:
  • Dorothy E. Denning;Selim G. Akl;Mark Heckman;Teresa F. Lunt;Matthew Morgenstern;Peter G. Neumann;Roger R. Schell

  • Affiliations:
  • SRI International, Menlo Park, CA;Queen's Univ., Kingston, Ont., Canada;Gemini Computers, Inc., Carmel, CA;SRI International, Menlo Park, CA;SRI International, Menlo Park, CA;SRI International, Menlo Park, CA;Gemini Computers, Inc., Carmel, CA

  • Venue:
  • IEEE Transactions on Software Engineering - Special issue on computer security and privacy
  • Year:
  • 1987

Quantified Score

Hi-index 0.00

Visualization

Abstract

Because views on relational database systems mathematically define arbitrary sets of stored and derived data, they have been proposed as a way of handling context-and content-dependent classification, dynamic classification, inference, aggregation, and sanitization in multilevel database systems. This paper describes basic view concepts for a multilevel-secure relational database model that addresses the above issues. All data entering the database are labeled according to views called classification constraints, which specify access classes for related data. In addition, views called aggregation constraints restrict access to aggregates of information. All data accesses are confined to a third set of views called access views.