A logic-based approach for enforcing access control[1]A preliminary version of this paper appears in the Proceedings of the 5th European Symposium on Research in Computer Security (ESORICS’98), Louvain-La-Neuve, Belgium, September 1998 under the title “An Authorization Model and its Formal Semantics”.

  • Authors:
  • Elisa Bertino;Francesco Buccafurri;Elena Ferrari;Pasquale Rullo

  • Affiliations:
  • Dipartimento di Scienze dell’Informazione, Università degli Studi di Milano, Via Comelico 39/41, 20135 Milano, Italy E-mail: {bertino,ferrarie}@dsi.unimi.it;Dipartimento DIMET, Università di Reggio Calabria, Feo di Vito, 89100 Reggio Calabria, Italy E-mail: bucca@ns.ing.unirc.it;(Correspd.) Dipo. di Scienze dell’Informazione, Università degli Studi di Milano, Via Comelico 39/41, 20135 Milano, Italy E-mail: {bertino,ferrarie}@dsi.unimi.it;Dipartimento di Matematica, Università della Calabria, Arcavacata di Rende, 87030 Rende, Italy E-mail: rullo@si.deis.unical.it

  • Venue:
  • Journal of Computer Security
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper describes an advanced authorization mechanism basedon a logic formalism. The model supports both positive and negativeauthorizations. It also supports derivation rules by which anauthorization can be granted on the basis of the presence orabsence of other authorizations. Subjects, objects andauthorization types are organized into hierarchies, supporting amore adequate representation of their semantics. From theauthorizations explicitly specified, additional authorizations areautomatically derived by the system, based on those hierarchies.The combination of all the above features results in a powerful yetflexible access control mechanism.The logic formalism on which the system relies is an extensionof Ordered Logic with ordered domains. This is an elegant yetpowerful formalism whereby the basic concepts of the authorizationmodel can be naturally formalized. Its semantics is based on thenotion of stable model and assigns, to a given set of authorizationrules, a multiplicity of (stable) models, each representing apossible way of assigning access authorizations. This form ofnon-determinism entails an innovative approach to enforce accesscontrol: when an access request is issued, the appropriate model(set of consistent access authorizations) is chosen, on the basisof the accesses currently under execution in the system.