Formal semantics of confidentiality in multilevel logic databases

  • Authors:
  • Adrian Spalka

  • Affiliations:
  • Department of Computer Science III, University of Bonn, Römerstr. 164, D-53117 Bonn, Germany

  • Venue:
  • NSPW '94 Proceedings of the 1994 workshop on New security paradigms
  • Year:
  • 1994

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents a new formal approach to the definition of confidentiality in multilevel logic databases. We regard a multilevel secure database as an extension of an open database which preserves the database-semantics. We give four definitions of confidentiality which capture various degrees of information on secrets. Three of them are relevant in the presence of the Closed World Assumption. We present their formalisation within standard predicate logic and their interpretation for multilevel databases. From this viewpoint, the definitions lead to a formal semantics of the Simple-Security-Property and the *-property. In particular, we demonstrate that the traditional interpretation of these properties represents just a special case of our formalism.