ACM Home Page
Please provide us with feedback. Feedback
Using First-Order Logic to Reason about Policies
Full text PdfPdf (326 KB)
Source
ACM Transactions on Information and System Security (TISSEC) archive
Volume 11 ,  Issue 4  (July 2008) table of contents
Article No. 21  
Year of Publication: 2008
ISSN:1094-9224
Authors
Joseph Y. Halpern  Cornell University
Vicky Weissman  Cornell University
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 31,   Downloads (12 Months): 314,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1380564.1380569
What is a DOI?

ABSTRACT

A policy describes the conditions under which an action is permitted or forbidden. We show that a fragment of (multi-sorted) first-order logic can be used to represent and reason about policies. Because we use first-order logic, policies have a clear syntax and semantics. We show that further restricting the fragment results in a language that is still quite expressive yet is also tractable. More precisely, questions about entailment, such as “May Alice access the file?”, can be answered in time that is a low-order polynomial (indeed, almost linear in some cases), as can questions about the consistency of policy sets.


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
 
3
Apple Computer, I. 2004. iTunes: Terms of sale. Available at http://www.apple.com/support/ itunes/legal/policies.html.
 
4
5
 
6
Blaze, M., Feigenbaum, J., Ioannidis, J., and Keromytis, A. 1998. The KeyNote trust management system. Available at http://www.cis.upenn.edu/~angelos/keynote.html.
 
7
 
8
 
9
Börger, E., Grädel, E., and Gurevich, Y. 1997. The Classical Decision Problem. Perspectives of Mathematical Logic. Springer-Verlag, Berlin, Germany. 2nd printing (Universitext) 2001.
 
10
Brand, D. 1975. Proving theorems with the modification method. SIAM J. Comput. 4, 4, 412--430.
 
11
Chomicki, J., Lobo, J., and Naqvi, S. 2000. A logic programming approach to conflict resolution in policy management. In Principles of Knowledge Representation and Reasoning: Proceedings of the 9th International Conference (KR'00). 121--132.
 
12
ContentGuard. 2001. XrML: The digital rights language for trusted content and services. Available at http://www.xrml.org/.
 
13
 
14
Ellison, C., Frantz, B., Lampson, B., Rivest, R., Thomas, B., and Ylonen, T. 1999a. Simple public key certificate. Available at http://world.std.com/~cme/spki.txt. Internet RFC 2693.
 
15
 
16
Enderton, H. B. 1972. A Mathematical Introduction to Logic. Academic Press, New York.
17
 
18
Garcia-Molina, H., Ullman, J. D., and Widom, J. 2002. Database Systems: The Complete Book. Prentice Hall, New Jersey.
19
20
 
21
 
22
Halpern, J. Y., van der Meyden, R., and Schneider, F. 1999. Logical foundations for trust management. Unpublished manuscript.
 
23
Halpern, J. Y. and Weissman, V. 2003. Using first-order logic to reason about policies. In Proceedings of the 16th IEEE Computer Security Foundations Workshop (CSFW'03). 187--201.
24
 
25
 
26
Iannella, R. 2001. ODRL: The open digital rights language initiative. Available at http://odrl.net/.
 
27
Ioannidis, Y. and Sellis, T. 1992. Supporting inconsistent rules in database systems. J. Intell. Inform. Syst. 1, 3/4, 243--270.
28
 
29
30
31
 
32
 
33
 
34
 
35
Microsoft. 2003. Information rights management in Office Professional Edition 2003. Available at http://www.microsoft.com/office/editions/prodinfo/technologies/irm.mspx.
 
36
Moses, T. 2005. XACML: The eXtensible Access Control Markup Language, version 2.0. Available at http://www.xacml.org.
 
37
MPEG. 2004. Information technology---Multimedia framework (MPEG-21) -- Part 5: Rights Expression Language (ISO/IEC 21000-5:2004). Available at http://www.iso.ch/iso/en/.
38
 
39
 
40
 
41
Pucella, R. and Weissman, V. 2004. A formal foundation for ODRL rights. In Workshop on Issues in the Theory of Security (WITS'04).
 
42
Rivest, R. and Lampson, B. 1996. SDSI --- A simple distributed security infrastructure. Available at http://theory.lcs.mit.edu/~cis/sdsi.html.
 
43
Robinson, G. and Wos, L. 1983. Paramodulation and theorem-proving in first-order theories with equality. In Automation of Reasoning 2: Classical Papers on Computational Logic 1967-1970, J. Siekmann and G. Wrightson, Eds. Springer, Berlin, Heidelberg, 298--313.
 
44
 
45
 
46
Stockmeyer, L. J. 1977. The polynomial-time hierarchy. Theor. Comput. Sci. 3, 1--22.
 
47
Weissman, V. and Lagoze, C. 2004. Towards a policy language for humans and computers. In Proceedings of the 8th European Conference on Digital Libraries (ECDL'04). 513--525.
 
48
Wright, G. H. v. 1951. An Essay in Modal Logic. North-Holland, Amsterdam.


Collaborative Colleagues:
Joseph Y. Halpern: colleagues
Vicky Weissman: colleagues