Abstract
Hippocratic Databases have been proposed as a mechanism to guarantee the respect of privacy principles in data management. We argue that three major principles are missing from the proposed mechanism: hierarchies of purposes, delegation of tasks and authorizations (i.e. outsourcing), and the minimal disclosure of private information.
In this paper, we propose a flexible framework for the negotiation of personal information among customers and (possibly virtual) enterprises based on user preferences when enterprises may adopt different processes to provide the same service. We use a goal-oriented approach to analyze the purposes of a Hippocratic system and derive a purpose and delegation hierarchy. Based on this hierarchy, effective algorithms are given to determine the minimum set of authorizations needed for a service. In this way, the minimal authorization table of a global business process can be automatically constructed from the collection of privacy policy tables associated with the collaborating enterprises. By using effective on-line algorithms, the derivation of such minimal information can also be done on-the-fly by the customer wishing to use the services of a virtual organization.
This work has been partially funded by the IST programme of the EU Commission, through an FET under the IST-2001-37004 WASP project, by the FIRB programme of MIUR under the RBNE0195K5 and RBAU01P5SS projects, by MOSTRO and SMTPPs projects of PAT.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Adam, N.R., Worthmann, J.C.: Security-control methods for statistical databases: a comparative study. CSUR 21(4), 515–556 (1989)
Agrawal, R., Evfimievski, A., Srikant, R.: Information sharing across private databases. In: Proc. of the 2003 ACM SIGMOD Int. Conf. on Management of Data. ACM Press, New York (2003)
Agrawal, R., Kiernan, J., Srikant, R., Xu, Y.: Hippocratic Databases. In: Proc. of VLDB 2002, pp. 143–154. Morgan Kaufmann, San Francisco (2002)
Ausiello, G., Franciosa, P.G., Frigioni, D.: Directed hypergraphs: Problems, algorithmic results, and a novel decremental approach. In: Restivo, A., Ronchi Della Rocca, S., Roversi, L. (eds.) ICTCS 2001. LNCS, vol. 2202, pp. 312–327. Springer, Heidelberg (2001)
Ausiello, G., Giaccio, R., Italiano, G.F., Nanni, U.: Optimal Traversal of Directed Hypergraphs. Technical Report TR-92-073, ICSI (September 1992)
Chang, C.L., Slage, J.R.: An admissible and optimal algorithm for searching AND/OR graphs. Artif. Intell. 2, 117–128 (1971)
Desmedt, Y., Wang, Y.: Maximum flows and critical vertices in AND/OR graphs. In: Ibarra, O.H., Zhang, L. (eds.) COCOON 2002. LNCS, vol. 2387, pp. 238–248. Springer, Heidelberg (2002)
Gallo, G., Longo, G., Pallottino, S., Nguyen, S.: Directed hypergraphs and applications. Discrete Applied Mathematics 42(2-3), 177–201 (1993)
Giorgini, P., Massacci, F., Mylopoulos, J., Zannone, N.: Requirements Engineering meets Trust Management: Model, Methodology, and Reasoning. In: Jensen, C., Poslad, S., Dimitrakos, T. (eds.) iTrust 2004. LNCS, vol. 2995, pp. 176–190. Springer, Heidelberg (2004)
Giorgini, P., Mylopoulos, J., Nicchiarelli, E., Sebastiani, R.: Reasoning with Goal Models. In: Proc. of ER 2002, pp. 167–181 (2002)
Karjoth, G., Schunter, M., Waidner, M.: Platform for Enterprise Privacy Practices: Privacy-enabled Management of Customer Data. In: Proc. of PET 2002. Springer, Heidelberg (2002)
LeFevre, K., Agrawal, R., Ercegovac, V., Ramakrishnan, R., Xu, Y., DeWitt, D.J.: Limiting Disclosure in Hippocratic Databases. In: Proc. of VLDB 2004 (2004)
Martelli, A., Montanari, U.: Additive AND/OR Graphs. In: Proc. of IJCAI 1973, pp. 1–11. Morgan Kaufmann Publisher, INC., San Francisco (1973)
Massacci, F., Mylopoulos, J., Zannone, N.: 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
Nilsson, N.J.: Problem solving methods in AI. McGraw-Hill, New York (1971)
Papazoglou, M.P.: Web Services and Business Transactions. World Wide Web: Internet and Web Inform. Sys. 6, 49–91 (2003)
Sahni, S.: Computationally related problems. SIAM J. on Comp. 3(4), 262–279 (1974)
Seamons, K., Winslett, M., Yu, T.: Limiting the Disclosure of Access Control Policies during Automated Trust Negotiation. In: Proc. of NDSS 2001, pp. 109–125. IEEE Press, Los Alamitos (2001)
Sebastiani, R., Giorgini, P., Mylopoulos, J.: Simple and minimum-cost satisfiability for goal models. In: Persson, A., Stirna, J. (eds.) CAiSE 2004. LNCS, vol. 3084, pp. 20–35. Springer, Heidelberg (2004)
Tumer, A., Dogac, A., Toroslu, H.: A Semantic based Privacy Framework for Web Services. In: Proc. of ESSW 2003 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Massacci, F., Mylopoulos, J., Zannone, N. (2005). Minimal Disclosure in Hierarchical Hippocratic Databases with Delegation. In: di Vimercati, S.d.C., Syverson, P., Gollmann, D. (eds) Computer Security – ESORICS 2005. ESORICS 2005. Lecture Notes in Computer Science, vol 3679. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11555827_25
Download citation
DOI: https://doi.org/10.1007/11555827_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28963-0
Online ISBN: 978-3-540-31981-8
eBook Packages: Computer ScienceComputer Science (R0)