• DocumentCode
    3069303
  • Title

    Enforcement of Security Properties for Dynamic MAC Policies

  • Author

    Briffaut, J. ; Lalande, J.-F. ; Toinard, C. ; Blanc, M.

  • Author_Institution
    LIFO - EA 4022, ENSI de Bourges, Bourges, France
  • fYear
    2009
  • fDate
    18-23 June 2009
  • Firstpage
    114
  • Lastpage
    120
  • Abstract
    This paper focuses on the enforcement of security properties fitting with dynamic mandatory access control policies. It adds complementary results to previous works of the authors in order to better address dynamic policies. Previous works of the authors provide several advances for enforcing the security of MAC system.An administration language for formalizing a large set of security properties is available to system administrators. That language uses several flow operators and ease the formalization of the required security properties. A solution is also available for computing the possible violations of any security property that can be formalized using our language. That solution computes several flow graphs in order to find all the allowed activities that can violate the requested properties. That paper addresses remaining problems related to the enforcement of the same kind of properties but with dynamic MAC policies. Enforcement is more much complex if we consider dynamic policies since the states of those policies are theoretically infinite. A new approach is proposed for dynamic MAC policies. The major idea is to use a meta-policy language for controlling the allowed evolutions of those dynamic policies. According to those meta-policy constraints, the computation problem becomes easier. The proposed solution adds meta-nodes within the considered flow graphs. A general algorithm is given for computing the required meta-nodes and the associated arcs. The proposed meta-graphs provide an overestimation of the possible flows between the different meta-nodes. The computation of the possible violations within the allowed dynamic policies is thus allowed. Several concrete security properties are considered using regular expressions for identifying the requested meta-contexts. The resulting violations, within the allowed meta-graphs, are computed and real violations are presented.
  • Keywords
    authorisation; graph theory; telecommunication security; dynamic mandatory access control policies; flow graphs; meta-policy constraints; security properties fitting; Access control; Concrete; Flow graphs; Information security; Linux; Mechanical factors; Operating systems; Permission; Protection; Safety;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Emerging Security Information, Systems and Technologies, 2009. SECURWARE '09. Third International Conference on
  • Conference_Location
    Athens, Glyfada
  • Print_ISBN
    978-0-7695-3668-2
  • Type

    conf

  • DOI
    10.1109/SECURWARE.2009.25
  • Filename
    5211030