ACM Home Page
Please provide us with feedback. Feedback
Towards an efficient and language-agnostic compliance checker for trust negotiation systems
Full text PdfPdf (470 KB)
Source ASIAN ACM Symposium on Information, Computer and Communications Security archive
Proceedings of the 2008 ACM symposium on Information, computer and communications security table of contents
Tokyo, Japan
SESSION: Access control table of contents
Pages 228-239  
Year of Publication: 2008
ISBN:978-1-59593-979-1
Authors
Adam J. Lee  University of Illinois at Urbana-Champaign, Urbana, IL
Marianne Winslett  University of Illinois at Urbana-Champaign, Urbana, IL
Sponsor
SIGSAC: ACM Special Interest Group on Security, Audit, and Control
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 15,   Downloads (12 Months): 67,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1368310.1368343
What is a DOI?

ABSTRACT

To ensure that a trust negotiation succeeds whenever possible, authorization policy compliance checkers must be able to find all minimal sets of their owners' credentials that can be used to satisfy a given policy. If all of these sets can be found efficiently prior to choosing which set should be disclosed, many strategic benefits can also be realized. Unfortunately, solving this problem using existing compliance checkers is too inefficient to be useful in practice. Specifically, the overheads of finding all satisfying sets using existing approaches have been shown to rapidly grow exponentially in the size of the union of all satisfying sets of credentials for the policy, even after optimizations have been made to prune the search space for potential satisfying sets.

In this paper, we describe the Clouseau compliance checker. Clouseau leverages efficient pattern-matching algorithms to find all satisfying sets of credentials for a given policy in time that grows as O(NA), where N is the number of satisfying sets for the policy and A is the average size of each satisfying set. We describe the design and implementation of the Clouseau compliance checker, evaluate its performance, and show that it vastly outperforms existing approaches to finding all satisfying sets of credentials. We then present a method for automatically compiling RT policies into a format suitable for analysis by Clouseau and prove its correctness and completeness.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
M. Y. Becker. A formal security policy for an NHS electronic health record service. Technical Report UCAM-CL-TR-628, University of Cambridge Computer Laboratory, Mar. 2005.
 
3
 
4
 
5
 
6
 
7
 
8
9
10
 
11
 
12
 
13
C. L. Forgy. Rete: A fast algorithm for the many pattern/many object pattern match problem. Artificial Intelligence, 27(3):219--227, 1985.
 
14
E. Friedman-Hill. Jess: The rule engine for the Java platform. Web site, Apr. 2007. (http://www.jessrules.com).
 
15
 
16
H. Koshutanski and F. Massacci. An interactive trust management and negotiation scheme. In Proceedings of the Second International Workshop on Formal Aspects in Security and Trust (FAST), pages 139--152, Aug. 2004.
 
17
A. J. Lee and M. Winslett. Towards an efficient and language-agnostic compliance checker for trust negotiation systems. Technical Report UIUCDCS-R-2007-2903, University of Illinois at Urbana Champaign Department of Computer Science, Oct. 2007.
18
 
19
 
20
D. P. Miranker. TREAT: A better match algorithm for AI production systems. In Proceedings of the Sixth National Conference on Artificial Intelligence (AAAI-87), pages 42--47, Aug. 1987.
 
21
 
22
 
23
 
24
W. H. Winsborough, K. E. Seamons, and V. E. Jones. Automated trust negotiation. In Proceedings of the DARPA Information Survivability Conference and Exposition, pages 88--102, Jan. 2000.
 
25
26
 
27
D. Yao, K. Frikken, M. Atallah, and R. Tamassia. Point-based trust: Define how much privacy is worth. In Proceedings of the Eighth International Conference on Information and Communications Security (ICICS '06), number 4307 in Lecture Notes in Computer Science, pages 190--209. Springer, 2006.
28

Collaborative Colleagues:
Adam J. Lee: colleagues
Marianne Winslett: colleagues