In this work we explore the use of process algebra in formalising and analysing access control policies. We do this by considering a standard access control language (XACML) and show how the core concepts in the language can be represented in CSP. We then show how properties of these policies may also be described in CSP, and how model checking may be used to verify that a policy meets the property.We further consider how we may introduce a notion of workflow into this framework, and show that a simple appreciation of the workflow context may limit the things we need to verify about a policy.
|Title of host publication||SWS '05 Proceedings of the 2005 workshop on Secure web services|
|Number of pages||8|
|Publication status||Published - 2005|
|Event||Workshop on Secure Web Services - Fairfax, United States|
Duration: 11 Nov 2005 → 11 Nov 2005
|Workshop||Workshop on Secure Web Services|
|Period||11/11/05 → 11/11/05|