Minimal disclosure in hierarchical Hippocratic databases with delegation

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

Volumn 3679 LNCS, Issue , 2005, Pages 438-454

  Massacci, Fabio ^a   Mylopoulos, John ^a,b   Zannone, Nicola ^a  

^a UNIVERSITY OF TRENTO   (Italy)

^b UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA PRIVACY; DATA REDUCTION; DATABASE SYSTEMS; MATHEMATICAL MODELS; ONLINE SYSTEMS;

AUTHORIZATION TABLE; DELEGATION HIERARCHY; PRIVACY POLICY; VIRTUAL ORGANIZATION;

HIERARCHICAL SYSTEMS;

EID: 33646066334     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11555827_25     Document Type: Conference Paper

References (20)

1. N. R. Adam and J. C. Worthmann. Security-control methods for statistical databases: a comparative study. CSUR, 21(4):515-556, 1989.
2. R. Agrawal, A. Evfimievski, and R. Srikant. Information sharing across private databases. In Proc. of the 2003 ACM SIGMOD Int. Conf. on Management of Data. ACM Press, 2003.
3. R. Agrawal, J. Kiernan, R. Srikant, and Y. Xu. Hippocratic Databases. In Proc. of VLDB'02, pp. 143-154. Morgan Kaufmann, 2002.
4. G. Ausiello, P. G. Franciosa, and D. Frigioni. Directed Hypergraphs: Problems, Algorithmic Results, and a Novel Decremental Approach. In Proc. of ICTCS'01, LNCS 2202, pp. 312-327. Springer-Verlag, 2001.
5. G. Ausiello, R. Giaccio, G. F. Italiano, and U. Nanni. Optimal Traversal of Directed Hypergraphs. Technical Report TR-92-073, ICSI, September 1992.
6. C. L. Chang and J. R. Slage. An admissible and optimal algorithm for searching AND/OR graphs. Artif. Intell., 2:117-128, 1971.
7. Y. Desmedt and Y. Wang. Maximum flows and critical vertices in and/or graphs. In Proc. of COCOON'02, pp. 238-248. Springer-Verlag, 2002.
8. G. Gallo, G. Longo, S. Pallottino, and S. Nguyen. Directed hypergraphs and applications. Discrete Applied Mathematics, 42(2-3): 177-201, 1993.
9. P. Giorgini, F. Massacci, J. Mylopoulos, and N. Zannone. Requirements Engineering meets Trust Management: Model, Methodology, and Reasoning. In Proc. of iTrust'04, LNCS 2995, pp. 176-190. Springer-Verlag, 2004.
10. P. Giorgini, J. Mylopoulos, E. Nicchiarelli, and R. Sebastiani. Reasoning with Goal Models. In Proc. of ER'02, pp. 167-181, 2002.
11. G. Karjoth, M. Schunter, and M. Waidner. Platform for Enterprise Privacy Practices: Privacy-enabled Management of Customer Data. In Proc. of PET'02. Springer-Verlag, 2002.
12. K. LeFevre, R. Agrawal, V. Ercegovac, R. Ramakrishnan, Y. Xu, and D. J. DeWitt. Limiting Disclosure in Hippocratic Databases. In Proc. of VLDB'04, 2004.
13. A. Martelli and U. Montanari. Additive AND/OR Graphs. In Proc. of IJCAI'73, pp. 1-11. Morgan Kaufmann Publisher, INC., 1973.
14. F. Massacci, J. Mylopoulos, N. Zannone, Minimal Disclosure in Hierarchical Hippocratic Databases with Delegation, Technical Report DIT-05-051, Univ. di Trento 2005. Available on the web at http://eprints.biblio.unitn.it.
15. N. J. Nilsson. Problem solving methods in AI. McGraw-Hill, 1971.
16. M. P. Papazoglou. Web Services and Business Transactions. World Wide Web: Internet and Web Inform. Sys., 6:49-91, 2003.
17. S. Sahni. Computationally related problems. SIAM J. on Comp., 3(4):262-279, 1974.
18. K. Seamons, M. Winslett, and T. Yu. Limiting the Disclosure of Access Control Policies during Automated Trust Negotiation. In Proc. of NDSS'01, pp. 109-125. IEEE Press, 2001.
19. R. Sebastiani, P. Giorgini, and J. Mylopoulos. Simple and minimum-cost satisfiability for goal models. In Proc. of CAiSE'04, LNCS 3084, pp. 20-35. Springer-Verlag, 2004.
20. A. Turner, A. Dogac, and H. Toroslu. A Semantic based Privacy Framework for Web Services. In Proc. of ESSW'03, 2003.