skip to main content
10.1145/2661829.2661875acmconferencesArticle/Chapter ViewAbstractPublication PagescikmConference Proceedingsconference-collections
poster

Scalable Privacy-Preserving Record Linkage for Multiple Databases

Published:03 November 2014Publication History

ABSTRACT

Privacy-preserving record linkage (PPRL) is the process of identifying records that correspond to the same real-world entities across several databases without revealing any sensitive information about these entities. Various techniques have been developed to tackle the problem of PPRL, with the majority of them only considering linking two databases. However, in many real-world applications data from more than two sources need to be linked. In this paper we consider the problem of linking data from three or more sources in an efficient and secure way. We propose a protocol that combines the use of Bloom filters, secure summation, and Dice coefficient similarity calculation with the aim to identify all records held by the different data sources that have a similarity above a certain threshold. Our protocol is secure in that no party learns any sensitive information about the other parties' data, but all parties learn which of their records have a high similarity with records held by the other parties. We evaluate our protocol on a large dataset showing the scalability, linkage quality, and privacy of our protocol.

References

  1. P. Christen. Data Matching. Springer, 2012.Google ScholarGoogle Scholar
  2. P. Christen and D. Vatsalan. Flexible and extensible generation and corruption of personal data. In ACM CIKM, San Francisco, 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. C. Clifton, M. Kantarcioglu, A. Doan, G. Schadow, J. Vaidya, A. Elmagarmid, and D. Suciu. Privacy- preserving data integration and sharing. In ACM SIGMOD Workshop DMKD, Paris, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. E. A. Durham, C. Toth, M. Kuzu, M. Kantarcioglu, Y. Xue, and B. Malin. Composite Bloom filters for secure record linkage. TKDE, 99(PrePrints), 2013.Google ScholarGoogle Scholar
  5. M. Kantarcioglu, W. Jiang, and B. Malin. A privacy-preserving framework for integrating person-specific databases. In PSD, Istanbul, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. A. F. Karr, X. Lin, A. P. Sanil, and J. P. Reiter. Analysis of integrated data without data integration. Chance, 17(3):26--29, 2004.Google ScholarGoogle ScholarCross RefCross Ref
  7. P. Lai, S. Yiu, K. Chow, C. Chong, and L. Hui. An Efficient Bloom filter based Solution for Multiparty Private Matching. In SAM, Las Vegas, 2006.Google ScholarGoogle Scholar
  8. N. Mohammed, B. Fung, and M. Debbabi. Anonymity meets game theory: secure data integration with malicious participants. VLDB, 20(4):567--588, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. C. M. O'Keefe, M. Yung, L. Gu, and R. Baxter. Privacy-preserving data linkage protocols. In ACM WPES, Washington DC, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. C. Quantin, H. Bouzelat, F. Allaert, and et al. How to ensure data security of an epidemiological follow-up: quality assessment of an anonymous record linkage procedure. IJMI, 49(1):117--122, 1998.Google ScholarGoogle Scholar
  11. R. Schnell, T. Bachteler, and J. Reiher. Privacy-preserving record linkage using Bloom filters. BMC Med Inform Decis Mak, 9(1), 2009.Google ScholarGoogle Scholar
  12. D. Vatsalan, P. Christen, C. M. O'Keefe, and V. S. Verykios. An evaluation framework for privacy-preserving record linkage. JPC, 6(1), 2014.Google ScholarGoogle Scholar
  13. D. Vatsalan, P. Christen, and V. S. Verykios. A taxonomy of privacy-preserving record linkage techniques. JIS, 38(6):946--969, 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Scalable Privacy-Preserving Record Linkage for Multiple Databases

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Conferences
        CIKM '14: Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management
        November 2014
        2152 pages
        ISBN:9781450325981
        DOI:10.1145/2661829

        Copyright © 2014 ACM

        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 the author(s) 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: 3 November 2014

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • poster

        Acceptance Rates

        CIKM '14 Paper Acceptance Rate175of838submissions,21%Overall Acceptance Rate1,861of8,427submissions,22%

        Upcoming Conference

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader