skip to main content
10.1145/1542207.1542229acmconferencesArticle/Chapter ViewAbstractPublication PagessacmatConference Proceedingsconference-collections
research-article

Access control policy combining: theory meets practice

Published: 03 June 2009 Publication History

Abstract

Many access control policy languages, e.g., XACML, allow a policy to contain multiple sub-policies, and the result of the policy on a request is determined by combining the results of the sub-policies according to some policy combining algorithms (PCAs). Existing access control policy languages, however, do not provide a formal language for specifying PCAs. As a result, it is difficult to extend them with new PCAs. While several formal policy combining algebras have been proposed, they did not address important practical issues such as policy evaluation errors and obligations; furthermore, they cannot express PCAs that consider all sub-policies as a whole (e.g., weak majority or strong majority). We propose a policy combining language PCL, which can succinctly and precisely express a variety of PCAs. PCL represents an advancement both in terms of theory and practice. It is based on automata theory and linear constraints, and is more expressive than existing approaches. We have implemented PCL and integrated it with SUN's XACML implementation. With PCL, a policy evaluation engine only needs to understand PCL to evaluate any PCA specified in it.

References

[1]
P. Ashley, S. Hada, G. Karjoth, C. Powers, and M. Schunter. The enterprise privacy authorization language (EPAL). http://www.w3.org/2003/p3p-ws/pp/ibm3.html.
[2]
M. Backes, M. Durmuth, and R. Steinwandt. An algebra for composing enterprise privacy policies. In ESORICS '04: Proceedings of the 2004 European Symposium on Research in Computer Security, 2004.
[3]
L. Bauer, J. Ligatti, and D. Walker. Composing security policies with polymer. In PLDI '05: ACM Conference on Programming Language Design and Implementation, 2005.
[4]
N. D. Belnap. A useful four-valued logic. In Modern Uses of Multiple-Valued Logic, 1977.
[5]
P. Bonatti, S. de Capitani di Vimercati, and P. Samarati. An algebra for composing access control policies. ACM Transactions on Information and System Security (TISSEC), 5(1):1--35, Feb. 2002.
[6]
G. Bruns, D. S. Dantas, and M. Huth. A simple and expressive semantic framework for policy composition in access control. In FMSE '07: Proceedings of the 2007 ACM Workshop on Formal methods in security engineering, pages 12--21, New York, NY, USA, 2007. ACM.
[7]
K. Fisler, S. Krishnamurthi, L. A. Meyerovich, and M. C. Tschantz. Verification and change-impact analysis of access-control policies. In ICSE, pages 196--205, 2005.
[8]
S. Hada and M. Kudo. XML access control language: Provisional authorization for XML documents. http://www.trl.ibm.com/projects/xml/xacl/xacl-spec.html.
[9]
J. Halpern and V. Weissman. Using first-order logic to reason about policies. In CSFW '03: Proceedings of the Computer Security Foundations Workshop, 2003.
[10]
V. Kolovski, J. Hendler, and B. Parsia. Analyzing web access control policies. In WWW '07: Proceedings of the 16th international conference on World Wide Web, pages 677--686, New York, NY, USA, 2007. ACM.
[11]
J. Ligatti, L. Bauer, and D. Walker. Edit automata: enforcement mechanisms for run-time security policies. Int. J. Inf. Sec., 4(1-2):2--16, 2005.
[12]
A. X. Liu, F. Chen, J. Hwang, and T. Xie. XEngine: A fast and scalable XACML policy evaluation engine. In Proc.International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS 2008), pages 265--276, June 2008.
[13]
E. Martin and T. Xie. A fault model and mutation testing of access control policies. In Proc. 16th International Conference on World Wide Web (WWW 2007), pages 667--676, May 2007.
[14]
P. Mazzoleni, E. Bertino, B. Crispo, and S. Sivasubramanian. XACML policy integration algorithms: not to be confused with XACML policy combination algorithms! In SACMAT '06: Proceedings of the eleventh ACM symposium on Access control models and technologies, pages 219--227, New York, NY, USA, 2006. ACM.
[15]
C. Ribeiro, A. Z'laquete, P. Ferreira, and P. Guedes. SPL: An access control language for security policies with complex constraints. In NDSS '01: Network and Distributed System Security Symposium, 2001.
[16]
F. B. Schneider. Enforceable security policies. ACM Transactions on Information and System Security (TISSEC), 3(1):30--50, 2000.
[17]
Sun Microsystems. Sun's XACML implementation. http://sunxacml.sourceforge.net/.
[18]
D. Wijesekera and S. Jajodia. Policy algebras for access control the predicate case. In Proc. ACM Conference on Computer and Communications Security (CCS), pages 171--180, 2002.
[19]
D. Wijesekera and S. Jajodia. A propositional policy algebra for access control. ACM Transactions on Information and Systems Security (TISSEC), 6(2):286--325, May 2003.
[20]
XACML TC. OASIS eXtensible Access Control Markup Language (XACML). http://www.oasis-open.org/committees/xacml/.
[21]
G. Audemard, P. Bertoli, A. Cimatti, A. Kornilowicz, and R. Sebastiani. A sat based approach for solving formulas over boolean and linear mathematical propositions. In CADE, pages 195--210, 2002.
[22]
M. Bozzano, R. Bruttomesso, A. Cimatti, T. A. Junttila, P. van Rossum, S. Schulz, and R. Sebastiani. An incremental and layered procedure for the satisfiability of linear arithmetic logic. In TACAS, pages 317--333, 2005

Cited By

View all

Index Terms

  1. Access control policy combining: theory meets practice

      Recommendations

      Comments

      Information & Contributors

      Information

      Published In

      cover image ACM Conferences
      SACMAT '09: Proceedings of the 14th ACM symposium on Access control models and technologies
      June 2009
      258 pages
      ISBN:9781605585376
      DOI:10.1145/1542207
      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Sponsors

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      Published: 03 June 2009

      Permissions

      Request permissions for this article.

      Check for updates

      Author Tags

      1. policy combination
      2. xacml

      Qualifiers

      • Research-article

      Conference

      SACMAT '09
      Sponsor:

      Acceptance Rates

      SACMAT '09 Paper Acceptance Rate 24 of 75 submissions, 32%;
      Overall Acceptance Rate 177 of 597 submissions, 30%

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • Downloads (Last 12 months)21
      • Downloads (Last 6 weeks)6
      Reflects downloads up to 06 Nov 2024

      Other Metrics

      Citations

      Cited By

      View all

      View Options

      Get Access

      Login options

      View options

      PDF

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      Media

      Figures

      Other

      Tables

      Share

      Share

      Share this Publication link

      Share on social media