Rewriting-Based Access Control Policies

Electronic Notes in Theoretical Computer Science

Volumn 171, Issue 4, 2007, Pages 59-72

  de Oliveira, Anderson Santana ^a  

^a LORIA   (France)

Author keywords

Access Control Policies; Term Rewriting Systems

Indexed keywords

AUTHENTICATION; DECISION THEORY; LAW ENFORCEMENT; LINEAR ALGEBRA;

EVALUATION PRODUCES; REWRITING;

ACCESS CONTROL;

EID: 34250823438     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2007.02.055     Document Type: Article

References (25)

1. Baader F., and Nipkow T. Term rewriting and all that (1998), Cambridge University Press, New York, NY, USA
2. Barker S., and Fernández M. Term rewriting for access control. In: Damiani E., and Liu P. (Eds). DBSec. Lecture Notes in Computer Science 4127 (2006) 179-193
3. Bauer, L., J. Ligatti and D. Walker, Composing security policies with polymer., in: V. Sarkar and M.W. Hall, editors, PLDI (2005), pp. 305-314
4. Bell, E. D. and L.J. LaPadula, Secure computer systems: Mathematical foundations, Technical Report Mitre Report ESD-TR-73-278 (Vol. I-III), Mitre Corporation (1974)
5. Bishop M. Introduction to Computer Security (2004), Addison-Wesley Professional
6. Bouhoula, A. and F. Jacquemard, Automatic verification of sufficient completeness for conditional constrained term rewriting systems, Technical Report RR-5863, INRIA (2006). URL http://hal.inria.fr/inria-00070163/en/
7. Cirstea H. Specifying authentication protocols using rewriting and strategies. In: Ramakrishnan I.V. (Ed). PADL. Lecture Notes in Computer Science 1990 (2001) 138-152
8. Cirstea H., and Kirchner C. The rewriting calculus - Part I and II. Logic Journal of the Interest Group in Pure and Applied Logics 9 (2001) 427-498
9. Clavel M., Durán F., Eker S., Lincoln P., Martí-Oliet N., Meseguer J., and Quesada J.F. Maude: specification and programming in rewriting logic. Theor. Comput. Sci. 285 (2002) 187-243
10. di Vimercati S.D.C., Samarati P., and Jajodia S. Policies, models, and languages for access control. In: Bhalla S. (Ed). DNIS. Lecture Notes in Computer Science 3433 (2005) 225-237
11. Dougherty D.J., Fisler K., and Krishnamurthi S. Specifying and reasoning about dynamic access-control policies. In: Furbach U., and Shankar N. (Eds). IJCAR. Lecture Notes in Computer Science 4130 (2006) 632-646
12. Echahed, R. and F. Prost, Security policy in a declarative style., in: P. Barahona and A.P. Felty, editors, PPDP (2005), pp. 153-163. URL http://doi.acm.org/10.1145/1069774.1069789
13. Gnaedig, I. and H. Kirchner, Computing constructor forms with non terminating rewrite programs., in: A. Bossi and M.J. Maher, editors, PPDP (2006), pp. 121-132
14. Goguen, J. A. and J. Meseguer, Security policies and security models., in: IEEE Symposium on Security and Privacy, 1982, pp. 11-20
15. Gramlich B. On termination and confluence properties of disjoint and constructor-sharing conditional rewrite systems. Theor. Comput. Sci. 165 (1996) 97-131
16. Halpern, J. Y. and V. Weissman, Using first-order logic to reason about policies., in: CSFW (2003), pp. 187-201
17. Jacquemard F., Rusinowitch M., and Vigneron L. Compiling and verifying security protocols. In: Parigot M., and Voronkov A. (Eds). LPAR. Lecture Notes in Computer Science 1955 (2000) 131-160
18. Jajodia S., Samarati P., Sapino M.L., and Subrahmanian V.S. Flexible support for multiple access control policies. ACM Trans. Database Syst. 26 (2001) 214-260
19. Middeldorp, A., A sufficient condition for the termination of the direct sum of term rewriting systems, in: LICS (1989), pp. 396-401
20. Moses, T., Extensible access control markup language (xacml) version 2.0, Technical report, OASIS (2005)
21. Pavlich-Mariscal J.A., Michel L., and Demurjian S.A. A formal enforcement framework for role-based access control using aspect-oriented programming. In: Briand L.C., and Williams C. (Eds). MoDELS. Lecture Notes in Computer Science 3713 (2005) 537-552
22. Rusinowitch M. On termination of the direct sum of term-rewriting systems. Inf. Process. Lett. 26 (1987) 65-70
23. Schneider F.B. Enforceable security policies. ACM Trans. Inf. Syst. Secur. 3 (2000) 30-50
24. Toyama Y. Counterexamples to termination for the direct sum of term rewriting systems. Inf. Process. Lett. 25 (1987) 141-143
25. Toyama Y. On the church-rosser property for the direct sum of term rewriting systems. J. ACM 34 (1987) 128-143