Comparing rule-based policies

Proceedings - 2008 IEEE Workshop on Policies for Distributed Systems and Networks, POLICY 2008

Volumn , Issue , 2008, Pages 11-18

  Bonatti, P A ^a   Mogavero, F ^a  

^a UNIVERSITY OF NAPLES FEDERICO II   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; DATA DESCRIPTION; FINANCIAL DATA PROCESSING;

APPLICATION SCENARIOS; CERTIFICATE CHAINS; DESCRIPTION LOGICS; DISTRIBUTED SYSTEMS; OBJECT HIERARCHIES; POLICY LANGUAGES; POLICY VALIDATION; QUERY OPTIMIZATION; RECURSION; RECURSIVE RULES; RELATIONAL ALGEBRA; RULE-BASED; SERVICE SELECTION; SOUNDNESS AND COMPLETENESS;

LAWS AND LEGISLATION;

EID: 51849141916     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/POLICY.2008.16     Document Type: Conference Paper

References (14)

1. A. Aho, Y. Sagiv, and J. Ullman. Equivalences among relational expressions. SIAM J. of Computing, 8(2):218-246, 1979.
2. M. Y. Becker and P. Sewell. Cassandra: distributed access control policies with tunable expressiveness. In 5th IEEE International Workshop on Policies for Distributed Systems and Networks, Yorktown Heights, June 2004.
3. P. A. Bonatti. On the decidability of containment of recursive datalog queries - preliminary report. In A. Deutsch, editor, PODS, pages 297-306. ACM, 2004.
4. P. A. Bonatti, S. D. C. di Vimercati, and P. Samarati. An algebra for composing access control policies. ACM Trans. Inf. Syst. Secur., 5(1):1-35, 2002.
5. P. A. Bonatti and D. Olmedilla. Driving and monitoring provisional trust negotiation with metapolicies. In IEEE 6th International Workshop on Policies for Distributed Systems and Networks (POLICY 2005), Stockholm, Sweden, June 2005.
6. D. Calvanese, G. D. Giacomo, and M. Y. Vardi. Decidable containment of recursive queries. Theor. Comput. Sci., 336(1):33-56, 2005.
7. A. Chandra and P. Merlin. Optimal implementation of conjunctive queries in relational data bases. In Proc. Ninth Annual ACM Symp. on Theory of Computing, pages 77-90, 1976.
8. Cornwell et al. User-controllable security and privacy for pervasive computing. In The 8th IEEE Workshop on Mobile Computinf Systems and Applications (HotMobile 2007), 2007.
9. D. Florescu, A. Y. Levy, and D. Suciu. Query containment for conjunctive queries with regular expressions. In PODS, pages 139-148. ACM Press, 1998.
10. R. Gavriloaie, W. Nejdl, D. Olmedilla, K. Seamons, and M. Winslett. No registration needed: How to use declarative policies and negotiation to access sensitive resources on the semantic web. In 1st First European Semantic Web Symposium, Heraklion, Greece, May 2004.
11. N. Li, J. Mitchell, and W. Winsborough. Design of a role-based trust-management framework. In SP '02: Proceedings of the 2002 IEEE Symposium on Security and Privacy, page 114. IEEE Computer Society, 2002.
12. Y. Sagiv and M. Yannakakis. Equivalences among relational expressions with the union and difference operators. JACM, 27(4):633-655, 1980.
13. O. Shmueli. Equivalence of datalog queries is undecidable. J. Log. Program., 15(3):231-241, 1993.
14. T. Yu, M. Winslett, and K. Seamons. Interoperable strategies in automated trust negotiation. In CCS '01: Proceedings of the 8th ACM conference on Computer and Communications Security, pages 146-155. ACM Press, 2001.