skip to main content
10.1145/1533057.1533097acmconferencesArticle/Chapter ViewAbstractPublication Pagesasia-ccsConference Proceedingsconference-collections
research-article

D-algebra for composing access control policy decisions

Published:10 March 2009Publication History

ABSTRACT

This paper proposes a D-algebra to compose decisions from multiple access control policies. Compared to other algebra-based approaches aimed at policy composition, D-algebra is the only one that satisfies both functional completeness (any possible decision matrix can be expressed by a D-algebra formula) and computational effectiveness (a formula can be computed efficiently given any decision matrix). The D-algebra has several relevant applications in the context of access control policies, namely the analysis of policy languages decision mechanisms, and the development of tools for policy authoring and enforcement.

References

  1. P. Ashley, S. Hada, G. Karjoth, and M. Schunter. E-p3p privacy policies and privacy authorization. In WPES, pages 103--109, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. M. Backes, M. Dürmuth, and R. Steinwandt. An algebra for composing enterprise privacy policies. In P. Samarati, P. Y. A. Ryan, D. Gollmann, and R. Molva, editors, ESORICS, volume 3193 of Lecture Notes in Computer Science, pages 33--52. Springer, 2004.Google ScholarGoogle Scholar
  3. M. Backes, B. Pfitzmann, and M. Schunter. A toolkit for managing enterprise privacy policies. In E. Snekkenes and D. Gollmann, editors, ESORICS, volume 2808 of Lecture Notes in Computer Science, pages 162--180. Springer, 2003.Google ScholarGoogle Scholar
  4. A. Barth, A. Datta, J. C. Mitchell, and H. Nissenbaum. Privacy and contextual integrity: Framework and applications. In SP '06: Proceedings of the 2006 IEEE Symposium on Security and Privacy (S&P'06), pages 184--198, Washington, DC, USA, 2006. IEEE Computer Society. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. P. A. Bonatti, S. D. C. di Vimercati, and P. Samarati. A modular approach to composing access control policies. In ACM Conference on Computer and Communications Security, pages 164--173, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. P. A. Bonatti, S. D. C. di Vimercati, and P. Samarati. An algebra for composing access control policies. ACM Trans. Inf. Syst. Secur., 5(1):1--35, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. G. Bruns, D. S. Dantas, and M. Huth. A simple and expressive semantic framework for policy composition in access control. In P. Ning, V. Atluri, V. D. Gligor, and H. Mantel, editors, FMSE, pages 12--21. ACM, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. G. Bruns and M. Huth. Access-control policies via belnap logic: Effective and efficient composition and analysis. In CSF, pages 163--176. IEEE Computer Society, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. C. C. Chang. Algebraic analysis of many valued logics. Transactions of the American Mathematical Society, 88(2):467--490, jul 1958.Google ScholarGoogle ScholarCross RefCross Ref
  10. C. C. Chang. A new proof of the completeness of the lukasiewicz axioms. Transactions of the American Mathematical Society, 93(1):74--80, 1959.Google ScholarGoogle Scholar
  11. M. Fitting. Kleene's logic, generalized. J. Log. Comput., 1(6):797--810, 1991.Google ScholarGoogle ScholarCross RefCross Ref
  12. R. L. Graham. On n-valued functionally complete truth functions. The Journal of Symbolic Logic, 32(2):190--195, 1967.Google ScholarGoogle ScholarCross RefCross Ref
  13. W. H. Jobe. Functional completeness and canonical forms in many-valued logics. The Journal of Symbolic Logic, 27(4):409--422, 1962.Google ScholarGoogle ScholarCross RefCross Ref
  14. J. Lukasiewicz. O logice trojwartosciowej. Ruch filozoficzny, 5:170--171, 1920.Google ScholarGoogle Scholar
  15. J. Lukasiewicz. Aristotle's Syllogistic from the Standpoint of Modern Formal Logic. Garland Pub., New York, USA, first edition, 1987.Google ScholarGoogle Scholar
  16. N. M. Martin. The sheffer functions of 3-valued logic. The Journal of Symbolic Logic, 19(1):45--51, 1954.Google ScholarGoogle ScholarCross RefCross Ref
  17. R. McNaughton. A theorem about infinite-valued sentential logic. The Journal of Symbolic Logic, 16(1):1--13, 1951.Google ScholarGoogle ScholarCross RefCross Ref
  18. OASIS. eXtensible Access Control Markup Language (XACML) 2.0. Available at http://www.oasis-open.org/.Google ScholarGoogle Scholar
  19. D. Raub and R. Steinwandt. An algebra for enterprise privacy policies closed under composition and conjunction. In ETRICS, pages 130--144, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. A. Rose and J. B. Rosser. Fragments of many-valued statement calculi. Transactions of the American Mathematical Society, 87(1):1--53, 1958.Google ScholarGoogle ScholarCross RefCross Ref
  21. J. B. Rosser and A. R. Turquette. Many-Valued Logics. North-Holland Publishing Co., Amsterdam, Netherland, first edition, 1952.Google ScholarGoogle Scholar
  22. D. Wijesekera and S. Jajodia. Policy algebras for access control: the propositional case. In ACM Conference on Computer and Communications Security, pages 38--47, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. D. Wijesekera and S. Jajodia. A propositional policy algebra for access control. ACM Trans. Inf. Syst. Secur., 6(2):286--325, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. D-algebra for composing access control policy decisions

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in
        • Published in

          cover image ACM Conferences
          ASIACCS '09: Proceedings of the 4th International Symposium on Information, Computer, and Communications Security
          March 2009
          408 pages
          ISBN:9781605583945
          DOI:10.1145/1533057

          Copyright © 2009 ACM

          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]

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 10 March 2009

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • research-article

          Acceptance Rates

          Overall Acceptance Rate418of2,322submissions,18%

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader