Modal Access Control LogicAxiomatization, Semantics and FOL Theorem Proving

Authors:
Valerio Genovese;Daniele Rispoli;Dov M. Gabbay;Leendert Van Der Torre
Affiliations:
University of Luxembourg --Luxembourg and University of Torino --Italy;University of Torino --Italy;King's College London --UK;University of Luxembourg
Venue:
Proceedings of the 2010 conference on STAIRS 2010: Proceedings of the Fifth Starting AI Researchers' Symposium
Year:
2010

Citing 9
Cited 1

Delegation logic: A logic-based approach to distributed authorization

ACM Transactions on Information and System Security (TISSEC)
The Two-Variable Guarded Fragment with Transitive Relations

LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Non-Interference in Constructive Authorization Logic

CSFW '06 Proceedings of the 19th IEEE workshop on Computer Security Foundations
Variations in Access Control Logic

DEON '08 Proceedings of the 9th international conference on Deontic Logic in Computer Science
LEO-II - A Cooperative Automatic Theorem Prover for Classical Higher-Order Logic (System Description)

IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
SPASS Version 3.5

CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Operational Semantics for DKAL: Application and Analysis

TrustBus '09 Proceedings of the 6th International Conference on Trust, Privacy and Security in Digital Business
A modal deconstruction of access control logics

FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
A linear logic of authorization and knowledge

ESORICS'06 Proceedings of the 11th European conference on Research in Computer Security

A conditional constructive logic for access control and its sequent calculus

TABLEAUX'11 Proceedings of the 20th international conference on Automated reasoning with analytic tableaux and related methods

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present and study a Modal Access Control Logic (M-ACL) to specify and reason about access control policies. We identify canonical properties of well-known access control axioms. We provide a Hilbert-style proof-system and we prove soundness, completeness and decidability of the logic. We present a sound and complete embedding of Modal Access Control Logic into First-Order Logic. We show how to use SPASS theorem prover to reason about access control policies expressed as formulas of Modal Access Control Logic, and we compare our logic with existing ones.