{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:23:32Z","timestamp":1750307012531,"version":"3.41.0"},"reference-count":37,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2012,8,1]],"date-time":"2012-08-01T00:00:00Z","timestamp":1343779200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA9550-09-1-0223"],"award-info":[{"award-number":["FA9550-09-1-0223"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000145","name":"Division of Information and Intelligent Systems","doi-asserted-by":"publisher","award":["IIS 0916614CNS-0915436CNS-0913875"],"award-info":[{"award-number":["IIS 0916614CNS-0915436CNS-0913875"]}],"id":[{"id":"10.13039\/100000145","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["CCF-0939370"],"award-info":[{"award-number":["CCF-0939370"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000144","name":"Division of Computer and Network Systems","doi-asserted-by":"publisher","award":["IIS 0916614CNS-0915436CNS-0913875"],"award-info":[{"award-number":["IIS 0916614CNS-0915436CNS-0913875"]}],"id":[{"id":"10.13039\/100000144","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["J. Data and Information Quality"],"published-print":{"date-parts":[[2012,8]]},"abstract":"<jats:p>\n            Record linkage is used to associate entities from multiple data sources. For example, two organizations contemplating a merger may want to know how common their customer bases are so that they may better assess the benefits of the merger. Another example is a database of people who are forbidden from a certain activity by regulators, may need to be compared to a list of people engaged in that activity. The autonomous entities who wish to carry out the record matching computation are often reluctant to fully share their data; they fear losing control over its subsequent dissemination and usage, or they want to insure privacy because the data is proprietary or confidential, and\/or they are cautious simply because privacy laws forbid its disclosure or regulate the form of that disclosure. In such cases, the problem of carrying out the linkage computation without full data exchange has been called\n            <jats:italic>private record linkage<\/jats:italic>\n            . Previous private record linkage techniques have made use of a third party. We provide efficient techniques for private record linkage that improve on previous work in that (1) our techniques make no use of a third party, and (2) they achieve much better performance than previous schemes in terms of their execution time while maintaining acceptable quality of output compared to nonprivacy settings. Our protocol consists of two phases. The first phase primarily produces candidate record pairs for matching, by carrying out a very fast (but not accurate) matching between such pairs of records. The second phase is a novel protocol for efficiently computing distances between each candidate pair (without any expensive cryptographic operations such as modular exponentiations). Our experimental evaluation of our approach validates these claims.\n          <\/jats:p>","DOI":"10.1145\/2287714.2287715","type":"journal-article","created":{"date-parts":[[2012,8,6]],"date-time":"2012-08-06T18:11:37Z","timestamp":1344276697000},"page":"1-28","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Efficient and Practical Approach for Private Record Linkage"],"prefix":"10.1145","volume":"3","author":[{"given":"Mohamed","family":"Yakout","sequence":"first","affiliation":[{"name":"Purdue University"}]},{"given":"Mikhail J.","family":"Atallah","sequence":"additional","affiliation":[{"name":"Purdue University"}]},{"given":"Ahmed","family":"Elmagarmid","sequence":"additional","affiliation":[{"name":"Purdue University"}]}],"member":"320","published-online":{"date-parts":[[2012,8]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872771"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2006.144"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1077501.1077513"},{"volume-title":"Data Quality Assessment","author":"Arkady M.","key":"e_1_2_1_4_1","unstructured":"Arkady , M. 2007. Data Quality Assessment . Technics Publications , LLC. Arkady, M. 2007. Data Quality Assessment. Technics Publications, LLC."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1005140.1005147"},{"volume-title":"Proceedings of Statistics Canada Symposium","author":"Bachteler T.","key":"e_1_2_1_6_1","unstructured":"Bachteler , T. , Schnell , R. , and Reiher , J . 2010. An empirical comparison of approaches to approximate string matching in private record linkage . In Proceedings of Statistics Canada Symposium , Social Statistics: The Interplay among Censuses, Surveys and Administrative Data. Bachteler, T., Schnell, R., and Reiher, J. 2010. An empirical comparison of approaches to approximate string matching in private record linkage. In Proceedings of Statistics Canada Symposium, Social Statistics: The Interplay among Censuses, Surveys and Administrative Data."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02776078"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2011.127"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1186\/1472-6947-4-9"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/772862.772867"},{"volume-title":"Proceedings of the 1st Workshop on Security and Privacy in E-Commerce.","author":"Du W.","key":"e_1_2_1_11_1","unstructured":"Du , W. and Atallah , M. J . 2000. Protocols for secure remote database access with approximate matching . In Proceedings of the 1st Workshop on Security and Privacy in E-Commerce. Du, W. and Atallah, M. J. 2000. Protocols for secure remote database access with approximate matching. In Proceedings of the 1st Workshop on Security and Privacy in E-Commerce."},{"volume-title":"Proceedings of the 17th Annual Computer Security Applications Conference. 102--110","author":"Du W.","key":"e_1_2_1_12_1","unstructured":"Du , W. and Atallah , M. J . 2001. Privacy-preserving statistical analysis . In Proceedings of the 17th Annual Computer Security Applications Conference. 102--110 . Du, W. and Atallah, M. J. 2001. Privacy-preserving statistical analysis. In Proceedings of the 17th Annual Computer Security Applications Conference. 102--110."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2007.9"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2006.116"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1969.10501049"},{"volume-title":"Proceedings of the Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT).","author":"Freedman M. J.","key":"e_1_2_1_16_1","unstructured":"Freedman , M. J. , Nissim , K. , and Pinkas , B . 2004. Effcient private matching and set intersection . In Proceedings of the Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT). Freedman, M. J., Nissim, K., and Pinkas, B. 2004. Effcient private matching and set intersection. In Proceedings of the Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT)."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/11496618_9"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009761603038"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2003.1195989"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497458"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1739041.1739059"},{"volume-title":"Proceedings of the 8th International Conference on Database Systems for Advanced Applications (DASFAA). IEEE Computer Society","author":"Jin L.","key":"e_1_2_1_22_1","unstructured":"Jin , L. , Li , C. , and Mehrotra , S . 2003. Efficient record linkage in large data sets . In Proceedings of the 8th International Conference on Database Systems for Advanced Applications (DASFAA). IEEE Computer Society , Los Alamitos, CA, 137. Jin, L., Li, C., and Mehrotra, S. 2003. Efficient record linkage in large data sets. In Proceedings of the 8th International Conference on Database Systems for Advanced Applications (DASFAA). IEEE Computer Society, Los Alamitos, CA, 137."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/BCI.2009.29"},{"key":"e_1_2_1_24_1","doi-asserted-by":"crossref","unstructured":"Kissner L. and Song D. 2005. Private and threshold set-intersection. Tech. rep. CMU-CS-05-113. Kissner L. and Song D. 2005. Private and threshold set-intersection. Tech. rep. CMU-CS-05-113.","DOI":"10.21236\/ADA461119"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142473.1142599"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01200757"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/347090.347123"},{"volume-title":"Proceedings 2nd ACM SIGMOD Workshop Research Issues in Data Mining and Knowledge Discovery (DMKD). 23--29","author":"Monge A. E.","key":"e_1_2_1_28_1","unstructured":"Monge , A. E. and Elkan , C. P . 1997. An efficient domain-independent algorithm for detecting approximately duplicate database records . In Proceedings 2nd ACM SIGMOD Workshop Research Issues in Data Mining and Knowledge Discovery (DMKD). 23--29 . Monge, A. E. and Elkan, C. P. 1997. An efficient domain-independent algorithm for detecting approximately duplicate database records. In Proceedings 2nd ACM SIGMOD Workshop Research Issues in Data Mining and Knowledge Discovery (DMKD). 23--29."},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/1756123.1756146"},{"volume-title":"Proceedings of the 4th IEEE International Conference on Data Mining (ICDM), Workshop on Security Aspects of Data Mining (PSDM).","author":"Ravikumar P.","key":"e_1_2_1_30_1","unstructured":"Ravikumar , P. and Fienberg , S. E . 2004. A secure protocol for computing string distance metrics . In Proceedings of the 4th IEEE International Conference on Data Mining (ICDM), Workshop on Security Aspects of Data Mining (PSDM). Ravikumar, P. and Fienberg, S. E. 2004. A secure protocol for computing string distance metrics. In Proceedings of the 4th IEEE International Conference on Data Mining (ICDM), Workshop on Security Aspects of Data Mining (PSDM)."},{"volume-title":"Proceedings of the 4th IEEE International Conference on Data Mining (ICDM), Workshop on Security Aspects of Data Mining (PSDM).","author":"Ravikumar P.","key":"e_1_2_1_31_1","unstructured":"Ravikumar , P. , Cohen , W. , and Fienberg , S. E . 2004. A secure protocol for computing string distance metrics . In Proceedings of the 4th IEEE International Conference on Data Mining (ICDM), Workshop on Security Aspects of Data Mining (PSDM). Ravikumar, P., Cohen, W., and Fienberg, S. E. 2004. A secure protocol for computing string distance metrics. In Proceedings of the 4th IEEE International Conference on Data Mining (ICDM), Workshop on Security Aspects of Data Mining (PSDM)."},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247553"},{"key":"e_1_2_1_33_1","volume-title":"Applied Cryptography","author":"Schneier B.","unstructured":"Schneier , B. 1996. Applied Cryptography 2 nd Ed. John Wiley & amp; Sons. Schneier, B. 1996. Applied Cryptography 2nd Ed. John Wiley &amp; Sons.","edition":"2"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1186\/1472-6947-9-41"},{"volume-title":"The Scientist and Engineer\u2019s Guide to Digital Signal Processing","author":"Smith S. W.","key":"e_1_2_1_35_1","unstructured":"Smith , S. W. 1997. The Scientist and Engineer\u2019s Guide to Digital Signal Processing . California Technical Publishing . Smith, S. W. 1997. The Scientist and Engineer\u2019s Guide to Digital Signal Processing. California Technical Publishing."},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218488502001648"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2009.221"}],"container-title":["Journal of Data and Information Quality"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2287714.2287715","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2287714.2287715","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:49:04Z","timestamp":1750236544000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2287714.2287715"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,8]]},"references-count":37,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,8]]}},"alternative-id":["10.1145\/2287714.2287715"],"URL":"https:\/\/doi.org\/10.1145\/2287714.2287715","relation":{},"ISSN":["1936-1955","1936-1963"],"issn-type":[{"type":"print","value":"1936-1955"},{"type":"electronic","value":"1936-1963"}],"subject":[],"published":{"date-parts":[[2012,8]]},"assertion":[{"value":"2009-09-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2012-04-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2012-08-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}