Abstract
We study the international standard XACML 3.0 for describing security
access control policy in a compositional way. Our main contribution is to
derive a logic that precisely captures the idea behind the standard and to formally
define the semantics of the policy combining algorithms of XACML. To guard
against modelling artifacts we provide an alternative way of characterizing the
policy combining algorithms and we formally prove the equivalence of these approaches.
This allows us to pinpoint the shortcoming of previous approaches to
formalization based either on Belnap logic or on D-algebra.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of FACS 2011 |
| Publication date | 2011 |
| Publication status | Published - 2011 |
| Event | 8th International Symposium on Formal Aspects of Component Software (FACS 2011) - Oslo, Norway Duration: 14 Sept 2011 → 16 Sept 2011 Conference number: 8 http://facs2011.ifi.uio.no/ |
Conference
| Conference | 8th International Symposium on Formal Aspects of Component Software (FACS 2011) |
|---|---|
| Number | 8 |
| Country/Territory | Norway |
| City | Oslo |
| Period | 14/09/2011 → 16/09/2011 |
| Internet address |