A type system for discretionary access control†

  • Authors:

  • Michele Bugliesi;Dario Colazzo;Silvia Crafa;Damiano Macedonio

  • Affiliations:

  • Dipartimento di informatica, università ca' foscari, via torino 155, 30172 venezia-mestre, italy email: michele@dsi.unive.it, mace@dsi.unive.it;Lri, université paris sud, 91405 orsay cedex-france email: dario.colazzo@lri.fr;Dipartimento di matematica pura e applicata, università di padova, via trieste 63, 35121 padova, italy email: crafa@math.unipd.it;Dipartimento di informatica, università ca' foscari, via torino 155, 30172 venezia-mestre, italy email: michele@dsi.unive.it, mace@dsi.unive.it

  • Venue:
  • Mathematical Structures in Computer Science
  • Year:
  • 2009

Quantified Score

Hi-index 0.01

Visualization

Abstract

Discretionary Access Control (DAC) systems provide powerful resource management mechanisms based on the selective distribution of capabilities to selected classes of principals. We study a type-based theory of DAC models for a process calculus that extends Cardelli, Ghelli and Gordon's pi-calculus with groups (Cardelli et al. 2005). In our theory, groups play the role of principals and form the unit of abstraction for our access control policies, and types allow the specification of fine-grained access control policies to govern the transmission of names, bound the (iterated) re-transmission of capabilities and predicate their use on the inability to pass them to third parties. The type system relies on subtyping to achieve a selective distribution of capabilities to the groups that control the communication channels. We show that the typing and subtyping relationships of the calculus are decidable. We also prove a type safety result, showing that in well-typed processes all names: (i)flow according to the access control policies specified by their types; and(ii)are received at the intended sites with the intended capabilities. We illustrate the expressive power and the flexibility of the typing system using several examples.