skip to main content
article

Methods and limitations of security policy reconciliation

Authors Info & Claims
Published:01 August 2006Publication History
Skip Abstract Section

Abstract

A security policy specifies session participant requirements. However, existing frameworks provide limited facilities for the automated reconciliation of participant policies. This paper considers the limits and methods of reconciliation in a general-purpose policy model. We identify an algorithm for efficient two-policy reconciliation and show that, in the worst-case, reconciliation of three or more policies is intractable. Further, we suggest efficient heuristics for the detection and resolution of intractable reconciliation. Based upon the policy model, we describe the design and implementation of the Ismene policy language. The expressiveness of Ismene, and indirectly of our model, is demonstrated through the representation and exposition of policies supported by existing policy languages. We conclude with brief notes on the integration and enforcement of Ismene policy within the Antigone communication system.

References

  1. Balenson, D., Branstad, D., Dinsmore, P., Heyman, M., and Scace, C. 1999. Cryptographic Context Negotiation Template. Tech. Rep. TISR #07452-2, TIS Labs at Network Associates, Inc. February.]]Google ScholarGoogle Scholar
  2. Bartal, Y., Mayer, A. J., Nissim, K., and Wool, A. 1999. Firmato: A novel firewall management toolkit. In IEEE Symposium on Security and Privacy. 17--31.]]Google ScholarGoogle Scholar
  3. Bellovin, S. November 1999. Distributed Firewalls. USENIX ;login:, 39--47.]]Google ScholarGoogle Scholar
  4. Bhatti, N. T., Hiltunen, M. A., Schlichting, R. D., and Chiu, W. 1998. Coyote: A system for constructing fine-grain configurable communication services. ACM Transactions on Computer Systems 16, 4 (Nov.), 321--366.]] Google ScholarGoogle Scholar
  5. Blaze, M., Feigenbaum, J., and Lacy, J. 1996. Decentralized trust management. In Proceedings of the 1996 IEEE Symposium on Security and Privacy. Los Alamitos. 164--173.]] Google ScholarGoogle Scholar
  6. Blaze, M., Feigenbaum, J., Ioannidis, J., and Keromytis, A. 1999a. The role of trust management in distributed systems security. In Secure Internet Programming: Issues in Distributed and Mobile Object Systems. Lecture Notes in Computer Science, vol. 1603. State-of-the-Art series, Springer-Verlag, New York, NY. 184--210.]] Google ScholarGoogle Scholar
  7. Blaze, M., Feignbaum, J., Ioannidis, J., and Keromytis, A. 1999b. The keyNote trust management system---Version 2. Internet Engineering Task Force. RFC 2704.]] Google ScholarGoogle Scholar
  8. Blight, D. C. and Hamada, T. 1999. Policy-based networking architecture for QoS interworking in IP management. In Proceedings of Integrated network management VI, Distributed Management for the Networked Millennium. IEEE. 811--826.]]Google ScholarGoogle Scholar
  9. Branstad, D. and Balenson, D. 2000. Policy-based cryptographic key management: Experience with the KRP project. In Proceedings of DARPA Information Survivability Conference and Exposition (DISCEX '00). DARPA, Hilton Head, SC. 103--114]]Google ScholarGoogle Scholar
  10. Cholvy, L. and Cuppens, F. 1997. Analyzing consistancy of security policies. In 1997 IEEE Symposium on Security and Privacy. IEEE, Oakland, CA. 103--112.]] Google ScholarGoogle Scholar
  11. Chu, Y., Feigenbaum, J., LaMacchia, B., Resnick, P., and Strauss, M. 1998. REFEREE: trust management for web applications. In Proceedings of Financial Cryptography '98. vol. 1465. Anguilla, British West Indies. 254--274.]]Google ScholarGoogle Scholar
  12. Cook, S. 1971. The complexity of theorem-proving procedures. In Proceedings of 3th Annual ACM Symposium on Theorey of Computing. ACM, New York. 151--158.]] Google ScholarGoogle Scholar
  13. Diffie, W. and Hellman, M. 1976. New directions in cryptography. IEEE Transactions on Information Theory IT-22, 6 (Nov.), 644--654.]]Google ScholarGoogle Scholar
  14. Dinsmore, P., Balenson, D., Heyman, M., Kruus, P., Scace, C., and Sherman, A. 2000. Policy-based security management for large dynamic groups: A overview of the DCCM project. In Proceedings of DARPA Information Survivability Conference and Exposition (DISCEX '00). DARPA, Hilton Head, SC. 64--73.]]Google ScholarGoogle Scholar
  15. Durham, D., Boyle, J., Cohen, R., Herzog, S., Rajan, R., and Sastry, A. 2000. RFC 2748, The COPS (Common Open Policy Service) Protocol. Internet Engineering Task Force.]] Google ScholarGoogle Scholar
  16. Garey, M. R. and Johnson, D. S. 1979. Computers and intractibility, A guide to the theory of NP-completeness, 1st ed. Freeman, San Francisco, CA.]] Google ScholarGoogle Scholar
  17. Gong, L. and Qian, X. 1994. The complexity and composability of secure interoperation. In Proceedings of the IEEE Symposium on Research in Security and Privacy. IEEE, Oakland, CA. 190--200.]] Google ScholarGoogle Scholar
  18. Harkins, D. and Carrel, D. 1998. The internet key exchange. Internet Engineering Task Force. RFC 2409.]] Google ScholarGoogle Scholar
  19. Hiltunen, M. 1998. Configuration management for highly-customizable software. IEE Proceedings: Software 145, 5, 180--188.]]Google ScholarGoogle Scholar
  20. Hiltunen, M., Jaiprakash, S., Schlichting, R., and Ugarte, C. 2000. Fine-grain configurability for secure communication. Tech. Rep. TR00-05, Department of Computer Science, University of Arizona. June.]]Google ScholarGoogle Scholar
  21. Housley, R., Ford, W., Polk, W., and Solo, D. 1999. Internet X.509 public key infrastructure certificate and CRL profile. Internet Engineering Task Force. RFC 1949.]]Google ScholarGoogle Scholar
  22. Hutchinson, N. and Peterson, L. 1994. The x-kernel: An architecture for implementing network protocols. IEEE Transactions on Software Engineering 17, 1 (Jan.), 64--76.]] Google ScholarGoogle Scholar
  23. Jajodia, S., Samarati, P., and Subrahmanian, V. 1997. A logical language for expressing authorizations. In Proceedings of the 1997 IEEE Symposium on Security and Privacy. IEEE, Oakland, CA. 31--42.]] Google ScholarGoogle Scholar
  24. Karpinski, M. and Wagner, K. W. 1988. The computational complexity of graph algorithms with succinct representations. Z. Operations Res. 3, 32, 201--211.]]Google ScholarGoogle Scholar
  25. Kent, S. and Atkinson, R. 1998. Security architecture for the internet protocol. Internet Engineering Task Force. RFC 2401.]] Google ScholarGoogle Scholar
  26. Leighton, T. and Micali, S. 1994. Secret-key agreement without public-key cryptography. In Proceedings of Crypto 93, 456--479.]] Google ScholarGoogle Scholar
  27. Li, N., Mitchell, J. C. and Winsborough, W. H. 2005. Beyond proof-of-compliance: Security analysis in trust management. Journal of the ACM 52, 3, 474--514.]] Google ScholarGoogle Scholar
  28. Liu, X., Kreitz, C., van Renesse, R., Hickey, J., Hayden, M., Birman, K., and Constable, R. 1999. Building reliable high-performance communication systems from components. In Proceedings of 17th ACM Symposium on Operating Systems Principles (SOSP '99). vol. 33. ACM, New York. 80--92.]] Google ScholarGoogle Scholar
  29. McDaniel, P. 2001. Policy management in secure group communication. Ph.D. thesis, University of Michigan, Ann Arbor, MI.]] Google ScholarGoogle Scholar
  30. McDaniel, P. 2003. On context in authorization policy. Tech. Rep. TD-5JCJCK, AT&T Labs - Research, Florham Park, NJ. January.]]Google ScholarGoogle Scholar
  31. McDaniel, P. and Prakash, A. 2002. An architecture for security policy enforcement. Tech. Rep. TD-5C6JFV, AT&T Labs---Research, Florham Park, NJ. July.]]Google ScholarGoogle Scholar
  32. McDaniel, P. and Prakash, A. 2005. Security policy enforcement in the antigone system. Journal of Computer Security. Accepted for publication.]]Google ScholarGoogle Scholar
  33. McDaniel, P., Prakash, A., and Honeyman, P. 1999. Antigone: A flexible framework for secure group communication. In Proceedings of the 8th USENIX Security Symposium. Washington, DC. 99--114.]] Google ScholarGoogle Scholar
  34. McDaniel, P., Prakash, A., Irrer, J., Mittal, S., and Thuang, T.-C. 2001. Flexibly constructing secure groups in Antigone 2.0. In Proceedings of DARPA Information Survivability Conference and Exposition II. IEEE Computer Society Press, Los Angeles, CA. 55--67.]]Google ScholarGoogle Scholar
  35. Mendelson, E. 1997. Introduction to Mathematical Logic. Chapman & Hall, London.]] Google ScholarGoogle Scholar
  36. Moriconi, M., Qian, X., Riemenschneider, R. A., and Gong, L. 1997. Secure software architectures. In Proceedings of the 1997 IEEE Symposium on Security and Privacy. 84--93.]] Google ScholarGoogle Scholar
  37. Neuman, B. C. and Ts'o, T. 1994. Kerberos: An authentication service for computer networks. IEEE Communications 32, 9 (Sept.), 33--38.]]Google ScholarGoogle Scholar
  38. Nikander, P. and Karila, A. 1998. A java beans component architecture for cryptographic protocols. In Proceedings of 7th USENIX UNIX Security Symposium. USENIX Association, San Antonio, Texas. 107--121.]] Google ScholarGoogle Scholar
  39. Orman, H., O'Malley, S., Schroeppel, R., and Schwartz, D. 1994. Paving the road to network security or the value of small cobblestones. In Proceedings of the 1994 Internet Society Symposium on Network and Distributed System Security.]]Google ScholarGoogle Scholar
  40. Ryutov, T. and Neuman, C. 2000. Representation and evaluation of security policies for distributed system services. In Proceedings of DARPA Information Survivability Conference and Exposition. DARPA, Hilton Head, SC. 172--183.]]Google ScholarGoogle Scholar
  41. Schaefer, T. J. 1978. The complexity of satisfiability problems. In Proceedings of 10th Annual ACM Symposium on Theorey of Computers. ACM, New York. 216--226.]] Google ScholarGoogle Scholar
  42. Schmidt, D., Fox, D., and Sudya, T. 1993. Adaptive: A dynmaically assembled protocol transformation, integration, and evaluation environment. Journal of Concurrency: Practice and Experience 5, 4 (June), 269--286.]]Google ScholarGoogle Scholar
  43. Wallner, D. M., Harder, E. J., and Agee, R. C. 1999. Key management for multicast: Issues and architectures. Internet Engineering Task Force. RFC 2627.]] Google ScholarGoogle Scholar
  44. Wang, H., Jha, S., McDaniel, P., and Livny, M. 2004. Security policy reconciliation in distributed computing environments. In Proceedings of 5th International Workshop on Policies for Distributed Systems and Networks (Policy 2004). IEEE Computer Society Press, New York 137--146.]] Google ScholarGoogle Scholar
  45. Woo, T. and Lam, S. 1993. Authorization in distributed systems; A new approach. Journal of Computer Security 2, 2--3, 107--136.]] Google ScholarGoogle Scholar
  46. Woo, T. and Lam, S. 1998. Designing a distributed authorization service. In Proceedings of INFOCOM '98. IEEE, San Francisco, CA.]]Google ScholarGoogle Scholar
  47. Zao, J., Sanchez, L., Condell, M., Lynn, C., Fredette, M., Helinek, P., Krishnan, P., Jackson, A., Mankins, D., Shepard, M., and Kent, S. 2000. Domain based internet security policy management. In Proceedings of DARPA Information Survuvability Conference and Exposition. DARPA, Hilton Head, SC. 41--53.]]Google ScholarGoogle Scholar

Index Terms

  1. Methods and limitations of security policy reconciliation

            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

            Full Access

            • Published in

              cover image ACM Transactions on Information and System Security
              ACM Transactions on Information and System Security  Volume 9, Issue 3
              August 2006
              156 pages
              ISSN:1094-9224
              EISSN:1557-7406
              DOI:10.1145/1178618
              Issue’s Table of Contents

              Copyright © 2006 ACM

              Publisher

              Association for Computing Machinery

              New York, NY, United States

              Publication History

              • Published: 1 August 2006
              Published in tissec Volume 9, Issue 3

              Permissions

              Request permissions about this article.

              Request Permissions

              Check for updates

              Author Tags

              Qualifiers

              • article

            PDF Format

            View or Download as a PDF file.

            PDF

            eReader

            View online with eReader.

            eReader