Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
research-article

Hybrid Private Record Linkage: Separating Differentially Private Synopses from Matching Records

Published: 26 April 2019 Publication History

Abstract

Private record linkage protocols allow multiple parties to exchange matching records, which refer to the same entities or have similar values, while keeping the non-matching ones secret. Conventional protocols are based on computationally expensive cryptographic primitives and therefore do not scale. To address these scalability issues, hybrid protocols have been proposed that combine differential privacy techniques with secure multiparty computation techniques. However, a drawback of such protocols is that they disclose to the parties both the matching records and the differentially private synopses of the datasets involved in the linkage. Consequently, differential privacy is no longer always satisfied. To address this issue, we propose a novel framework that separates the private synopses from the matching records. The two parties do not access the synopses directly, but still use them to efficiently link records. We theoretically prove the security of our framework under the state-of-the-art privacy notion of differential privacy for record linkage (DPRL). In addition, we develop a simple but effective strategy for releasing private synopses. Extensive experimental results show that our framework is superior to the existing methods in terms of efficiency.

References

[1]
Rakesh Agrawal, Alexandre V. Evfimievski, and Ramakrishnan Srikant. 2003. Information sharing across private databases. In Proceedings of the SIGMOD 2003. 86--97.
[2]
Ali Al-Lawati, Dongwon Lee, and Patrick D. McDaniel. 2005. Blocking-aware private record linkage. In Proceedings of the IQIS 2005 (SIGMOD 2005 Workshop). 59--68.
[3]
Burton H. Bloom. 1970. Space/time trade-offs in hash coding with allowable errors. Commun. ACM 13, 7 (1970), 422--426.
[4]
Luca Bonomi, Li Xiong, Rui Chen, and Benjamin C. M. Fung. 2012. Frequent grams based embedding for privacy preserving record linkage. In Proceedings of the CIKM 2012. 1597--1601.
[5]
Jianneng Cao, Fang-Yu Rao, Elisa Bertino, and Murat Kantarcioglu. 2015. A hybrid private record linkage scheme: Separating differentially private synopses from matching records. In Proceedings of the ICDE 2015. 1011--1022.
[6]
Census. 1996. Retrieved from http://archive.ics.uci.edu/ml/datasets/Census+Income.
[7]
Graham Cormode, Cecilia M. Procopiuc, Divesh Srivastava, Entong Shen, and Ting Yu. 2012. Differentially private spatial decompositions. In Proceedings of the ICDE 2012. 20--31.
[8]
Ivan Damgård and Mads Jurik. 2001. A generalisation, a simplification, and some applications of Paillier’s probabilistic public-key system. In Proceedings of the PKC 2001. 119--136.
[9]
Frederick Douglas. 2012. Advanced crypto software collection. Retrieved from http://hms.isi.jhu.edu/acsc/damgard-jurik/.
[10]
Cynthia Dwork, Frank McSherry, Kobbi Nissim, and Adam D. Smith. 2006. Calibrating noise to sensitivity in private data analysis. In Proceedings of the TCC 2006. 265--284.
[11]
Ivan P. Fellegi and Alan B. Sunter. 1969. A theory for record linkage. J. Amer. Statist. Assoc. 64, 328 (1969), 1183--1210.
[12]
Michael J. Freedman, Kobbi Nissim, and Benny Pinkas. 2004. Efficient private matching and set intersection. In Proceedings of the EUROCRYPT 2004. 1--19.
[13]
Oded Goldreich. 2001. The Foundations of Cryptography—Volume 1, Basic Techniques. Cambridge University Press.
[14]
Oded Goldreich. 2004. The Foundations of Cryptography—Volume 2, Basic Applications. Cambridge University Press.
[15]
Rob Hall and Stephen E. Fienberg. 2010. Privacy-preserving record linkage. In Proceedings of the PSD 2010. 269--283.
[16]
Michael Hay, Vibhor Rastogi, Gerome Miklau, and Dan Suciu. 2010. Boosting the accuracy of differentially private histograms through consistency. PVLDB 3, 1 (2010), 1021--1032.
[17]
Xi He, Ashwin Machanavajjhala, Cheryl J. Flynn, and Divesh Srivastava. 2017. Composing differential privacy and secure computation: A case study on scaling private record linkage. In Proceedings of the CCS 2017. 1389--1406.
[18]
Yuan Hong, Jaideep Vaidya, Haibing Lu, Panagiotis Karras, and Sanjay Goel. 2015. Collaborative search log sanitization: Toward differential privacy and boosted utility. IEEE Trans. Dependable Sec. Comput. 12, 5 (2015), 504--518.
[19]
Yan Huang, David Evans, Jonathan Katz, and Lior Malka. 2011. Faster secure two-party computation using garbled circuits. In Proceedings of the USENIX Security 2011.
[20]
Ali Inan, Murat Kantarcioglu, Gabriel Ghinita, and Elisa Bertino. 2010. Private record matching using differential privacy. In Proceedings of the EDBT 2010. 123--134.
[21]
Alexandros Karakasidis and Vassilios S. Verykios. 2009. Privacy preserving record linkage using phonetic codes. In Proceedings of the BCI 2009. 101--106.
[22]
Lea Kissner and Dawn Xiaodong Song. 2005. Privacy-preserving set operations. In Proceedings of the CRYPTO 2005. 241--257.
[23]
Vladimir Kolesnikov, Ahmad-Reza Sadeghi, and Thomas Schneider. 2009. Improved garbled circuit building blocks and applications to auctions and computing minima. In Proceedings of the CANS 2009. 1--20.
[24]
Vladimir Kolesnikov and Thomas Schneider. 2008. Improved garbled circuit: Free XOR gates and applications. In Proceedings of the ICALP 2008. 486--498.
[25]
Mehmet Kuzu, Murat Kantarcioglu, Ali Inan, Elisa Bertino, Elizabeth Durham, and Bradley Malin. 2013. Efficient privacy-aware record integration. In Proceedings of the Joint 2013 EDBT/ICDT Conferences, EDBT 2013. 167--178.
[26]
Sahar Mazloom and S. Dov Gordon. 2018. Secure computation with differentially private access patterns. In Proceedings of the CCS 2018. 490--507.
[27]
Noman Mohammed, Dima Alhadidi, Benjamin C. M. Fung, and Mourad Debbabi. 2014. Secure two-party differentially private data release for vertically partitioned data. IEEE Trans. Dependable Sec. Comput. 11, 1 (2014), 59--71.
[28]
Pascal Paillier. 1999. Public-key cryptosystems based on composite degree residuosity classes. In Proceedings of the EUROCRYPT 1999. 223--238.
[29]
Wahbeh H. Qardaji, Weining Yang, and Ninghui Li. 2013. Differentially private grids for geospatial data. In Proceedings of the ICDE 2013. 757--768.
[30]
Fang-Yu Rao, Jianneng Cao, Elisa Bertino, and Murat Kantarcioglu. 2018. A hybrid private record linkage scheme: Separating differentially private synopses from matching records. Retrieved from https://www.cs.purdue.edu/homes/raof/DPLinkage_full_version.pdf.
[31]
Monica Scannapieco, Ilya Figotin, Elisa Bertino, and Ahmed K. Elmagarmid. 2007. Privacy preserving schema and data matching. In Proceedings of the SIGMOD 2007. 653--664.
[32]
Rainer Schnell, Tobias Bachteler, and Jörg Reiher. 2009. Privacy-preserving record linkage using Bloom filters. BMC Med. Inf. 8 Decision Making 9 (2009), 41.
[33]
Mohamed Yakout, Mikhail J. Atallah, and Ahmed K. Elmagarmid. 2009. Efficient private record linkage. In Proceedings of the ICDE 2009. 1283--1286.
[34]
Andrew Chi-Chih Yao. 1986. How to generate and exchange secrets (extended abstract). In Proceedings of the FOCS 1986. 162--167.
[35]
Jun Zhang, Xiaokui Xiao, and Xing Xie. 2016. PrivTree: A differentially private algorithm for hierarchical decompositions. In Proceedings of the SIGMOD 2016. 155--170.

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Privacy and Security
ACM Transactions on Privacy and Security  Volume 22, Issue 3
August 2019
143 pages
ISSN:2471-2566
EISSN:2471-2574
DOI:10.1145/3328797
Issue’s Table of Contents
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 26 April 2019
Accepted: 01 March 2019
Revised: 01 January 2019
Received: 01 September 2018
Published in TOPS Volume 22, Issue 3

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. Differential privacy
  2. record linkage
  3. secure multiparty computation

Qualifiers

  • Research-article
  • Research
  • Refereed

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)23
  • Downloads (Last 6 weeks)3
Reflects downloads up to 17 Oct 2024

Other Metrics

Citations

Cited By

View all
  • (2023)More Sparking Soundex-Based Privacy-Preserving Record LinkageAlgorithmic Aspects of Cloud Computing10.1007/978-3-031-33437-5_5(73-93)Online publication date: 26-May-2023
  • (2023)Security with PrivacyGranular, Fuzzy, and Soft Computing10.1007/978-1-0716-2628-3_754(639-648)Online publication date: 30-Mar-2023
  • (2022)A Credit Conflict Detection Model Based on Decision Distance and Probability MatrixWireless Communications & Mobile Computing10.1155/2022/37951832022Online publication date: 1-Jan-2022
  • (2022)Recommendations in Smart Devices Using Federated Tensor LearningIEEE Internet of Things Journal10.1109/JIOT.2021.31165059:11(8425-8437)Online publication date: 1-Jun-2022
  • (2022)Efficient Privacy Preserving Record Linkage at Scale using Apache Spark2022 IEEE International Conference on Big Data (Big Data)10.1109/BigData55660.2022.10020832(402-407)Online publication date: 17-Dec-2022
  • (2022)Privacy-Preserving Record Linkage Using Local Sensitive Hash and Private Set IntersectionApplied Cryptography and Network Security Workshops10.1007/978-3-031-16815-4_22(398-424)Online publication date: 24-Sep-2022
  • (2021)Blockchain-based Privacy-Preserving Record LinkageInformation Systems10.1016/j.is.2021.101826102:COnline publication date: 1-Dec-2021
  • (2021)Security with PrivacyEncyclopedia of Complexity and Systems Science10.1007/978-3-642-27737-5_754-1(1-10)Online publication date: 11-Jul-2021
  • (2020)Improving utility and security of the shuffler-based differential privacyProceedings of the VLDB Endowment10.14778/3424573.342457613:13(3545-3558)Online publication date: 27-Oct-2020
  • (2020)Privacy-Enhancing Preferential LBS Query for Mobile Social Network UsersWireless Communications & Mobile Computing10.1155/2020/88923212020Online publication date: 1-Jan-2020
  • Show More Cited By

View Options

Get Access

Login options

Full Access

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

HTML Format

View this article in HTML Format.

HTML Format

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media