skip to main content
10.1145/1180337.1180342acmconferencesArticle/Chapter ViewAbstractPublication PagesccsConference Proceedingsconference-collections
Article

Defeasible security policy composition for web services

Authors Info & Claims
Published:03 November 2006Publication History

ABSTRACT

The ability to automatically compose security policies created by multiple organizations is fundamental to the development of scalable security systems. The diversity of policies leads to conflicts and the need to resolve priorities between rules. In this paper we explore the concept of defeasible policy composition, wherein policies are represented in defeasible logic and composition is based on rules for non-monotonic inference. This enables policy writers to assert rules tentatively; when policies are composed the policy with the firmest position takes precedence. In addition, the structure of our policies allows for composition to occur using a single operator; this allows for entirely automated composition. We argue that this provides a practical system that can be understood by typical policy writers, analyzed rigorously by theoreticians, and efficiently automated by computers. We aim to partially validate these claims here with a formulation of defeasible policy composition for web services, an emerging foundation for B2B commerce on the World Wide Web.

References

  1. E. S. Al Shaer and H. H. Hamend. Discovery of policy anomalies in distributed firewalls. In IEEE INFOCOMM , 2004.Google ScholarGoogle ScholarCross RefCross Ref
  2. Amazon web services. Web Page, Jan. 2006. www.amazon.com/gp/aws/landing.html.Google ScholarGoogle Scholar
  3. G. Antoniou, D. Billington, and M. J. Maher. On the analysis of regulations using defeasible rules. In HICSS '99: Proceedings of the Thirty-second Annual Hawaii International Conference on System Sciences-Volume 6, page 6033, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. G. Antoniou and A. Ghose. What is default reasoning good for? applications revisited. In 32nd Hawaii International Conference on System Sciences, Jan. 1999 Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. G. Antoniou, M. J. Maher, and D. Billington. Defeasible logic versus logic programming without negation as failure. Journal of Logic Programming, 42(1):47--57, 2000.Google ScholarGoogle ScholarCross RefCross Ref
  6. S. Batres and C. Ferris (Editors). Web services reliable messaging policy assertion(WS-RM Policy). Specification, Feb. 2005. msdn.microsoft.com/library/en-us/dnglobspec/html/WS-RMPolicy.pdf.Google ScholarGoogle Scholar
  7. E. Bertino, S. Jajodia, and P. Samarati. Supporting multiple access control policies in database systems. In IEEE Symposium on Security and Privacy, pages 94--109, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. K. Bhargavan, C. Fournet, and A. D. Gordon. Verifying policy-based security for web services. In 11th ACM conference on Computer and Communications Security, pages 268--277, Oct. 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. K. Bhargavan, C. Fournet, A. D. Gordon, and S. Tse. Verified interoperable implementations of security protocols. In Computer Security Foundations Workshop (CSFW 06), Venice, Italy, July 2006. IEEE. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. C. Bidan and V. Issarny. Dealing with multi-policy security in large open distributed systems. In European Symposium on Research in Computer Security (ESORICS), pages 51--66, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. P. Bonatti, S. D. C. di Vimercati, and P. Samarati. A modular approach to composing access control policies. In 7th ACM Conference on Computer and Communications Security (CCS '00), pages 164--173, Nov. 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. L. Cholvy and F. Cuppens. Analyzing consistency of security policies. In 18th IEEE Computer Society Symposium on Research in Security and Privacy, 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. D. Eastlake and J. Reagle(Chairs). W3C XML-DSig working group. Web Page, Jan. 2006. www.w3.org/Signature/.Google ScholarGoogle Scholar
  14. Web services reliable messaging protocol(WS-R eliable M essaging). Specification, Feb. 2005. msdn.microsoft.com/library/en-us/dnglobspec/html/WS-ReliableMessaging.p%df.Google ScholarGoogle Scholar
  15. I. Foster, C. Kesselman, J. M. Nick, and S. Tuecke. The physiology of the grid: An open grid services architecture for distributed systems integration. In Open Grid Service Infrastructure Working Group, Global Grid Forum, Jun. 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. K. Frankish. Non-monotonic inference. In The Encyclopedia of Language and Linguistics. Elsevier, second edition, 2005.Google ScholarGoogle Scholar
  17. Google web APIs. Web Page, Jan. 2006. www.google.com/apis/.Google ScholarGoogle Scholar
  18. G. Governatori, A. H. M. ter Hofstede, and P. Oaks. Defeasible logic for automated negotiation. In P. Swatman and P. M. Swatman, editors, Proceedings of CollECTeR, 2000.Google ScholarGoogle Scholar
  19. G. Governatori, A. H. M. ter Hofstede, and P. Oaks. Is defeasible logic applicable? In G. Antoniou and G. Governatori, editors, Proceedings of the 2nd Australasian Workshop on Computational Logic, pages 47--62, Brisbane January 2001. Queensland University of Technology.Google ScholarGoogle Scholar
  20. B. N. Grosof, Y. Labrou, and H. Y. Chan. A declarative approach to business rules in contracts: courteous logic programs in XML. In ACM Conference on Electronic Commerce, pages 68--77, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. J. Halpern and V. Weissman. Using first-order logic to reason about policies. In IEEE Computer Security Foundations Workshop (CSFW '03), Jun. 2003.Google ScholarGoogle ScholarCross RefCross Ref
  22. S. Horrell. Web services enhancements 2.0 support for WS-P olicy. Web Page, July 2004. msdn.microsoft.com/library/en-us/dnwse/html/wse2wspolicy.asp.Google ScholarGoogle Scholar
  23. C. Kaler and A. Nadalin (Editors). Web services federation language (WS-F ederation). Specification, Jul. 2003. www-106.ibm.com/developerworks/webservices/library/ws-fed/.Google ScholarGoogle Scholar
  24. E. C. Lupu and M. Sloman. Conflicts in policy-based distributed systems management. IEEE Transactions on Software Engineering, 25(6):852--869, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. K. D. Lux, M. J. May, N. L. Bhattad, and C. A. Gunter. WSE mail: Secure internet messaging based on web services. In International Conference on Web Services, Orlando, FL, July 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. M. J. Maher. Propositional defeasible logic has linear complexity. Theory and Practice of Logic Programming, 1(6):691--711, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. M. J. May, W. Shin, C. A. Gunter, and I. Lee. Securing the drop-box architecture for assisted living. In Formal Methods in Software Engineering (FMSE '06), Alexandria, VA, November 2006. ACM. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. M. McDougall, R. Alur, and C. A. Gunter. A model-based approach to integrating security policies for embedded devices. In ACM EMSOFT, Sept. 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. Michael McDougall. Modeling and Analyzing Integrated Policies. PhD thesis, University of Pennsylvania, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. A. Nadalin (Editor). Web services security policy language (WS-SecurityPolicy). Web Services Specification, 2002. www.verisign.com/wss/WS-SecurityPolicy.pdf.Google ScholarGoogle Scholar
  31. D. Nute. Defeasible logic. In 14th International Conference on Applications of Prolog, Oct. 2001.Google ScholarGoogle Scholar
  32. J. Reagle (Chair). W3C XML encryption working group. Web Page, Jan. 2006. www.w3.org/Encryption/2001/.Google ScholarGoogle Scholar
  33. D. M. Reeves, M. P. Wellman, B. N. Grosof, and H. Y. Chan. Automated negotiation from declarative contract descriptions. In 17th National Conference on Artificial Intelligence, Workshop on Knowledge-Based Electronic Markets (KBEM), Jul. 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  34. A. Rock. Deimos: A query answering defeasible logic system. Technical report, Griffith University, Mar. 2004 www.cit.gu.edu.au/~arock/defeasible/doc/Deimos-long.pdf.Google ScholarGoogle Scholar
  35. J. Schlimmer (Editor). Web services policy framework (WS-Policy). Web Services Specification, 2004. ftp://www6.software.ibm.com/software/developer/library/ws-policy.pdf.Google ScholarGoogle Scholar
  36. C. Sharp (Editor). Web services policy attachment (WS-P olicy A ttachment). Specification, Sept. 2004. msdn.microsoft.com/library/en us/dnglobspec/html/ws-policyattachment.as%p.Google ScholarGoogle Scholar
  37. SOAP version 1.2. W3C Recommendation, Jan. 2006. www.w3.org/TR/soap12.Google ScholarGoogle Scholar

Index Terms

  1. Defeasible security policy composition for web services

                Recommendations

                Reviews

                Guido Governatori

                Defeasible logic is a rule-based nonmonotonic logic that is now being used in the design of applications in areas where specifications are naturally expressed in terms of rules. The application investigated in this paper—the composition of security policies—is motivated by the possibility of each entity involved in a composed service defining its own set of security policies, which must be integrated into a single policy. The main idea of the paper is to supplement policies with annotations specifying metapolicies about composition. Accordingly, every set of security policies has two components: the first component encodes the actual policies, and the second component includes the annotations covering instructions about possible compositions. Given several policies to be composed, it is likely that some policies will be in conflict with each other. This is where defeasible logic plays its main role. The authors introduce an order over the sources of the policies. Then, the resulting hierarchy is used to solve the conflicts in defeasible logic theory corresponding to the composition of the policies. Pseudocodes are given for the main algorithms for the composition of policies. The paper is a good example of an application of a particular formal method to a well-defined and important area, and it should be of interest to both practitioners and scholars. The paper has two minor drawbacks: the first is that it fails to notice that conflict between different normative sets is a very well-understood aspect in the fields of artificial intelligence and law, and normative reasoning (see, among others, Prakken’s book [1]). Additionally, the authors do not discuss some other work using defeasible logic for policies, for the composition of workflow activities (or services), and for the analysis of contract clauses. Online Computing Reviews Service

                Access critical reviews of Computing literature here

                Become a reviewer for Computing Reviews.

                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
                  FMSE '06: Proceedings of the fourth ACM workshop on Formal methods in security
                  November 2006
                  84 pages
                  ISBN:1595935509
                  DOI:10.1145/1180337

                  Copyright © 2006 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: 3 November 2006

                  Permissions

                  Request permissions about this article.

                  Request Permissions

                  Check for updates

                  Qualifiers

                  • Article

                  Upcoming Conference

                  CCS '24
                  ACM SIGSAC Conference on Computer and Communications Security
                  October 14 - 18, 2024
                  Salt Lake City , UT , USA

                PDF Format

                View or Download as a PDF file.

                PDF

                eReader

                View online with eReader.

                eReader