Specifying and reasoning about dynamic access-control policies

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4130 LNAI, Issue , 2006, Pages 632-646

  Dougherty, Daniel J ^a   Fisler, Kathi ^a   Krishnamurthi, Shriram ^b  

^a Worcester Polytechnic Institute   (United States)

^b Brown Univerity   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; AUTOMATA THEORY; COMPUTER HARDWARE DESCRIPTION LANGUAGES; COMPUTER SCIENCE; SECURITY OF DATA;

ACCESS CONTROL POLICIES; DECIDABLE ANALYSES; MODULAR REASONING; POLICY EQUIVALENCE;

FORMAL LOGIC;

EID: 33749558954     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11814771_51     Document Type: Conference Paper

References (44)

1. S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995.
2. S. Abiteboul, V. Vianu, B. S. Fordham, and Y. Yesha. Relational transducers for electronic commerce. Journal of Computer and System Sciences, 61(2):236-269, 2000.
3. T. Ahmed and A. R. Tripathi. Static verification of security requirements in role based CSCW systems. In Symposium on Access Control Models and Technologies, pages 196-203, 2003.
4. M. Backes, G. Karjoth, W. Bagga, and M. Schunter. Efficient comparison of enterprise privacy policies. In Symposium on Applied Computing, pages 375-382, 2004.
5. M. Y. Becker and P. Sewell. Cassandra: Flexible trust management, applied to electronic health records. In IEEE Computer Security Foundations Workshop, 2004.
6. D. Bell and L. J. LaPadula. Secure computer systems: Mathematical foundations and model. Technical Report M74-244, The Mitre Corporation, 1976.
7. E. Bertino, P. A. Bonatti, and E. Ferrari. TRBAC: A temporal role-based access control model. ACM Transactions on Information and Systems Security, 4(3):191-233, 2001.
8. E. Bertino, P. Samarati, and S. Jajodia. Authorizations in relational database management systems. In ACM Conference on Computer and Communications Security, pages 130-139, 1993.
9. P. Bonatti, S. D. C. di Vimercati, and P. Samarati. An algebra for composing access control policies. ACM Transactions on Information and Systems Security, 5(1): 1-35, 2002.
10. S. Cosmadakis and P. Kanellakis. Functional and inclusion dependencies: A graph theoretic approach. In P. Kanellakis and F. Preparata, editors, Advances in Computing Research, volume 3: Theory of Databases, pages 163-185. JAI Press, 1986.
11. P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In ACM Symposium on Principles of Programming Languages, pages 238-252, 1977.
12. J. DeTreville. Binder: a logic-based security language. In IEEE Symposium on Security and Privacy, pages 95-103, 2002.
13. A. Deutsch, L. Sui, and V. Vianu. Specification and verification of data-driven web services. In ACM Symposium on Principles of Database Systems, pages 71-82, 2004.
14. K. Fisler, S. Krishnamurthi, L. A. Meyerovich, and M. C. Tschantz. Verification and change-impact analysis of access-control policies. In International Conference on Software Engineering, pages 196-205, May 2005.
15. M. F. Frias, J. P. Galeotti, C. G. L. Pombo, and N. M. Aguirre. DynAlloy: upgrading Alloy with actions. In International Conference on Software Engineering, pages 442-451. ACM Press, 2005.
16. G. Gottlob, N. Leone, and F. Scarcello. The complexity of acyclic conjunctive queries. J. ACM, 48(3):431-498, 2001.
17. D. P. Guelev, M. D. Ryan, and P.-Y. Schobbens. Model-checking access control policies. In Information Security Conference, number 3225 in Lecture Notes in Computer Science. Springer-Verlag, 2004.
18. M. A. Harrison, W. L. Ruzzo, and J. D. Ullman. Protection in operating systems. Communications of the ACM, 19(8):461-471, Aug. 1976.
19. I. Hodkinson, F. Wolter, and M. Zakharyaschev. Decidable fragments of first-order temporal logics. Annals of Pure and Applied Logic, 106:85-134, 2000.
20. I. Hodkinson, F. Wolter, and M. Zakharyaschev. Decidable and undecidable fragments of first-order branching temporal logics. In IEEE Symposium on Logic in Computer Science, pages 393-402, 2002.
21. G. Hughes and T. Bultan. Automated verification of access control policies. Technical Report 2004-22, University of California, Santa Barbara, 2004.
22. D. Jackson. Automating first-order relational logic. In ACM SIGSOFT International Symposium on the Foundations of Software Engineering, Nov. 2000.
23. T. Jim. SD3: A trust management system with certified evaluation. In IEEE Symposium on Security and Privacy, pages 106-115, 2001.
24. N. D. Jones. Space-bounded reducibility among combinatorial problems. Journal of Computer and System Sciences, 11(1):68-85, 1975.
25. M. Koch, L. V. Mancini, and F. Parisi-Presicce. Decidability of safety in graph-based models for access control. In European Symposium on Research in Computer Security, pages 299-243, 2002.
26. G. Kolaczek. Specification and verification of constraints in role based access control for enterprise security system. In International Workshop on Enabling Technologies: Infrastructure for Collaborative Enterprises, pages 190-195, 2003.
27. S. Krishnamurthi. The CONTINUE server. In Symposium on the Practical Aspects of Declarative Languages, number 2562 in Springer Lecture Notes in Computer Science, pages 2-16, January 2003.
28. B. W. Lampson. Protection. ACM Operating Systems Review, 8(1):18-24, Jan. 1974.
29. N. Li, B. N. Grosof, and J. Feigenbaum. Delegation logic: A logic-based approach to distributed authorization. ACM Transactions on Information and Systems Security, 6(1):128-171, 2003.
30. N. Li and J. C. Mitchell. Datalog with constraints: A foundation for trust management languages. In Symposium on the Practical Aspects of Declarative Languages, pages 58-73, 2003.
31. N. Li, J. C. Mitchell, and W. H. Winsborough. Beyond proof-of- compliance: Security analysis in trust management. Journal of the ACM, 52(3):474-514, May 2005.
32. N. Li and M. V. Tripunitara. Security analysis in role-based access control. In ACM Symposium on Access Control Models and Technologies, 2004.
33. T. Moses, extensible Access Control Markup Language (XACML) version 1.0. Technical report, OASIS, Feb. 2003.
34. A. Pimlott and O. Kiselyov. Soutei, a logic-based trust-management system. In Functional and Logic Programming, pages 130-145, 2006.
35. Y. Sagiv. Optimizing datalog programs. In Foundations of Deductive Databases and Logic Programming, pages 659-698. Morgan Kaufmann, 1988.
36. R. Sandhu. The schematic protection model: its definition and analysis for acyclic attenuating systems. Journal of the ACM, 35(2):404-412, 1988.
37. R. S. Sandhu, E. J. Coyne, H. L. Feinstein, and C. E. Youman. Role-based access control models. IEEE Computer, 29(2):38-47, 1996.
38. B. Sarna-Starosta and S. D. Stoller. Policy analysis for security-enhanced Linux. In Proceedings of the 2004 Workshop on Issues in the Theory of Security, pages 1-12, April 2004.
39. A. Schaad and J. D. Moffett. A lightweight approach to specification and analysis of role-based access control extensions. In Symposium on Access Control Models and Technologies, pages 13-22, 2002.
40. O. Shmueli. Decidability and expressiveness aspects of logic queries. In ACM Symposium on Principles of Database Systems, pages 237-249, 1987.
41. M. Spielmann. Verification of relational transducers for electronic commerce. In ACM Symposium on Principles of Database Systems, pages 92-103. ACM Press, 2000.
42. M. Y. Vardi. The complexity of relational query languages (extended abstract). In Symposium on the Theory of Computing, pages 137-146. ACM, 1982.
43. V. Weissman and J. Halpern. Using first-order logic to reason about policies. In IEEE Computer Security Foundations Workshop, pages 187-201, 2003.
44. E. Yahav, T. Reps, M. Sagiv, and R. Wilhelm. Verifying temporal heap properties specified via evolution logic. In P. Degano, editor, European Symposium on Programming, volume 2618 of Lecture Notes in Computer Science, pages 204-222. Springer-Verlag, 2003.