Abstract
We present protocols for distributed computation of relational intersections and equi-joins such that each site gains no information about the tuples at the other site that do not intersect or join with its own tuples. Such protocols form the building blocks of distributed information systems that manage sensitive information, such as patient records and financial transactions, that must be shared in only a limited manner. We discuss applications of our protocols, outlining the ramifications of assumptions such as semi-honesty. In addition to improving on the efficiency of earlier protocols, our protocols are asymmetric, making them especially applicable to applications in which a low-powered client interacts with a server in a privacy-preserving manner. We present a brief experimental study of our protocols.
This work was supported by the National Science Foundation with grants IIS-9984296 (CAREER) and IIS-0081860 (ITR).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Agrawal, R., Evfimievski, A., Srikant, R.: Information sharing across private databases. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, San Diego, CA (June 2003)
Agrawal, R., Srikant, R.: Privacy-preserving data mining. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, May 2000, pp. 439–450. ACM Press, New York (2000)
Atallah, M.J., Du. Secure, W.: multi-party computational geometry. In: Proceedings of the International Workshop on Algorithms and Data Structures (2001)
Beimel, A., Ishai, Y.: Information-theoretic private information retrieval: A unified construction. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, p. 912. Springer, Heidelberg (2001)
Ben-Or, M., Wigderson, A.: Completeness theorems for non-cryptographic faulttolerant distributed computation. In: Proceedings of the ACM Symposium on Theory of Computing, pp. 1–10 (1988)
Canny, J.: Collaborative filtering with privacy. In: Proceedings of the IEEE symposium on Security and Privacy, Oakland, CA (May 2002)
Canny, J.: Collaborative filtering with privacy via factor analysis. In: Proceedings of the annual international ACM SIGIR conference on Research and Development in information retrieval, Tampere, Finland (August 2002)
Chaum, D., Crepeau, C., Damgard, I.: Multiparty unconditionally secure protocols. In: Proceedings of the ACM Symposium on Theory of Computing, pp. 11–19 (1988)
Chor, B., Gilboa, N.: Computationally private information retrieval. In: Proceedings of the ACM Symposium on Theory of Computing, pp. 304–313 (1997)
Di-Crescenzo, G., Ishai, Y., Ostrovsky, R.: Universal service-providers for database private information retrieval. In: Proceedings of the ACM SIGACTSIGOPS Symposium on Principles of Distributed Computing (1998)
Du, W., Atallah, M.J.: Secure multi-party computation problems and their applications: A review and open problems. In: Proceedings of the Workshop on New Security Paradigms, Cloudcroft, New, Mexico, USA, September 2001, pp. 11–20 (2001)
Du, W., Zhan, Z.: Using randomized response techniques for privacy-preserving data mining. In: Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Washington, DC (August 2003)
Evfimievski, A., Srikant, R., Agrawal, R., Gehrke, J.: Privacy preserving mining of association rules. In: Proceedings of ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD) (July 2002)
Fagin, R., Naor, M., Winkler, P.: Comparing information without leaking it. Communications of the ACM 39(5), 77–85 (1996)
Gertner, Y., Ishai, Y., Kushilevitz, E., Malkin, T.: Protecting data privacy in private information retrieval schemes. In: Proceedings of the ACM Symposium on Theory of Computing, May 1998, pp. 151–160 (1998)
Hogg, T., Huberman, B.A., Franklin, M.: Protecting privacy while sharing information in electronic communities. In: Proceedings of the Conference on Computers, Freedom and Privacy: Challenging the Assumptions (April 2000)
Huberman, B.A., Franklin, M., Hogg, T.: Enhancing privacy and trust in electronic communities. In: Proceedings of ACM Conference on Electronic Commerce, pp. 78–86 (1999)
Ioannidis, I., Grama, A., Atallah, M.: A secure protocol for computing dot products in clustered and distributed environments. In: Proceedings of the International Conference on Parallel Processing, Vancouver, Canada (August 2002)
Iyengar, V.S.: Transforming data to satisfy privacy constraints. In: Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Edmonton, Alberta, Canada, July 2002, pp. 279–288 (2002)
Lindel, Y., Pinkas, B.: Privacy preserving data mining. In: Proceedings of Advances in Cryptology (August 2000)
Stallings, W.: Cryptography and Network Security, 3rd edn. Prentice Hall, New Jersey (2003)
Vaidya, J., Clifton, C.: Privacy-preserving k-means clustering over vertically partitioned data. In: Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Washington, DC, pp. 206–215 (2003)
Vaidya, J., Clifton, C.: Secure set intersection cardinality with application to association rule mining (2003) (manuscript)
Yao, A.C.: How to generate and exchange secrets. In: Proceedings of the Annual Symposium on Foundations of Computer Science, Toronto, Canada, October 1986, pp. 162–167 (1986)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liang, G., Chawathe, S.S. (2004). Privacy-Preserving Inter-database Operations. In: Chen, H., Moore, R., Zeng, D.D., Leavitt, J. (eds) Intelligence and Security Informatics. ISI 2004. Lecture Notes in Computer Science, vol 3073. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25952-7_6
Download citation
DOI: https://doi.org/10.1007/978-3-540-25952-7_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22125-8
Online ISBN: 978-3-540-25952-7
eBook Packages: Springer Book Archive