Show simple item record

dc.contributor.authorWang, Haoen_US
dc.contributor.authorJha, Someshen_US
dc.contributor.authorLivny, Mironen_US
dc.contributor.authorMcDaniel, Patricken_US
dc.date.accessioned2012-03-15T17:17:57Z
dc.date.available2012-03-15T17:17:57Z
dc.date.created2004en_US
dc.date.issued2004
dc.identifier.citationTR1499en_US
dc.identifier.urihttp://digital.library.wisc.edu/1793/60386
dc.description.abstractA major hurdle in sharing resources between organizations is heterogeneity. Therefore, in order for two organizations to collaborate their policies have to be resolved. The process of resolving different policies is known as policy reconciliation, which in general is an infractable problem. This paper addresses policy reconciliation in the context of security. We present a formal framework and hierarchical representation for security policies. Our hierarchical representation exposes the structure of the policies and leads to an efficient reconciliation algorithm. We also demonstrate that agent preferences for security mechanisms can be readily incorporated into our framework. We have implemented our reconciliation algorithm in a library called the Policy Reconciliation Engine or PRE. In order to test the implementation and measure the overhead of our reconciliation algorithm, we have integrated PRE into a distributed, high-throughput system called Condor. Keywords: Security policy, reconciliation, and high-throughput distributed system.en_US
dc.format.mimetypeapplication/pdfen_US
dc.publisherUniversity of Wisconsin-Madison Department of Computer Sciencesen_US
dc.titleSecurity Policy Reconciliation in Distributed Computing Environmentsen_US
dc.typeTechnical Reporten_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

  • CS Technical Reports
    Technical Reports Archive for the Department of Computer Sciences at the University of Wisconsin-Madison

Show simple item record