{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T06:30:24Z","timestamp":1725949824910},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319639628"},{"type":"electronic","value":"9783319639628"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-63962-8_17-1","type":"book-chapter","created":{"date-parts":[[2018,2,27]],"date-time":"2018-02-27T01:32:53Z","timestamp":1519695173000},"page":"1-8","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Privacy-Preserving Record Linkage"],"prefix":"10.1007","author":[{"given":"Dinusha","family":"Vatsalan","sequence":"first","affiliation":[]},{"given":"Dimitrios","family":"Karapiperis","sequence":"additional","affiliation":[]},{"given":"Vassilios S.","family":"Verykios","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,2,7]]},"reference":[{"key":"17-1_CR1","first-page":"39","volume-title":"Secure and private sequence comparisons","author":"M Atallah","year":"2003","unstructured":"Atallah M, Kerschbaum F, Du W (2003) Secure and private sequence comparisons. In: ACM WPES, pp 39\u201344"},{"key":"17-1_CR2","doi-asserted-by":"crossref","unstructured":"Bhattacharya I, Getoor L (2007) Collective entity resolution in relational data. TKDD 1(1):5-es","DOI":"10.1145\/1217299.1217304"},{"key":"17-1_CR3","volume-title":"Medical data privacy handbook","author":"J Boyd","year":"2015","unstructured":"Boyd J, Randall S, Ferrante A (2015) Application of privacy-preserving techniques in operational record linkage centres. In: Gkoulalas-Divanis A, Loukides G (eds) Medical data privacy handbook. Springer, Cham"},{"key":"17-1_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31164-2","volume-title":"Data matching","author":"P Christen","year":"2012","unstructured":"Christen P (2012) Data matching. Data-centric systems and applications. Springer, Berlin\/Heidelberg"},{"key":"17-1_CR5","unstructured":"Christen P, Schnell R, Vatsalan D, Ranbaduge T (2017) Efficient cryptanalysis of bloom filters for PPRL. In: Kim J et al (eds) PAKDD. Springer, pp 628\u2013640"},{"key":"17-1_CR6","first-page":"1027","volume-title":"A fast approach for parallel deduplication on multicore processors","author":"G Dal Bianco","year":"2011","unstructured":"Dal Bianco G, Galante R, Heuser CA (2011) A fast approach for parallel deduplication on multicore processors. In: SAC. ACM, pp 1027\u20131032"},{"key":"17-1_CR7","unstructured":"Durham EA (2012) A framework for accurate, efficient private record linkage. PhD thesis, Vanderbilt University, Nashville"},{"key":"17-1_CR8","unstructured":"Office for National Statistics (2013) Matching anonymous data. In: Beyond 2011"},{"issue":"2","key":"17-1_CR9","doi-asserted-by":"publisher","first-page":"716","DOI":"10.1145\/1138394.1138401","volume":"31","author":"D Kalashnikov","year":"2006","unstructured":"Kalashnikov D, Mehrotra S (2006) Domain-independent data cleaning via analysis of entity-relationship graph. TODS 31(2):716\u2013767","journal-title":"TODS"},{"key":"17-1_CR10","first-page":"527","volume-title":"Scalable blocking for PPRL","author":"A Karakasidis","year":"2015","unstructured":"Karakasidis A, Koloniari G, Verykios VS (2015) Scalable blocking for PPRL. In: SIGKDD. ACM, pp 527\u2013536"},{"issue":"4","key":"17-1_CR11","first-page":"909","volume":"27","author":"D Karapiperis","year":"2015","unstructured":"Karapiperis D, Verykios V (2015) An LSH-based blocking approach with a homomorphic matching technique for PPRL. TKDE 27(4):909\u2013921","journal-title":"TKDE"},{"key":"17-1_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-18123-3_20","volume-title":"Large-scale multi-party counting set intersection using a space efficient global synopsis","author":"D Karapiperis","year":"2015","unstructured":"Karapiperis D, Vatsalan D, Verykios VS, Christen P (2015) Large-scale multi-party counting set intersection using a space efficient global synopsis. In: DASFAA"},{"issue":"2","key":"17-1_CR13","first-page":"292","volume":"30","author":"D Karapiperis","year":"2017","unstructured":"Karapiperis D, Gkoulalas-Divanis A, Verykios VS (2017) Federal: a framework for distance-aware privacy-preserving record linkage. TKDE 30(2):292\u2013304","journal-title":"TKDE"},{"key":"17-1_CR14","first-page":"251","volume":"26","author":"CW Kelman","year":"2002","unstructured":"Kelman CW, Bass J, Holman D (2002) Research use of linked health data \u2013 a best practice protocol. ANZJPH 26:251\u2013255","journal-title":"ANZJPH"},{"issue":"1","key":"17-1_CR15","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1109\/MC.2013.405","volume":"47","author":"H Kum","year":"2014","unstructured":"Kum H, Krishnamurthy A, Machanavajjhala A, Ahalt S (2014) Social Genome: Putting Big Data to Work for Population Informatics. Computer 47(1):56\u201363","journal-title":"Computer"},{"issue":"2","key":"17-1_CR16","first-page":"212","volume":"21","author":"H-C Kum","year":"2014","unstructured":"Kum H-C, Krishnamurthy A, Machanavajjhala A, Reiter MK, Ahalt S (2014) Privacy preserving interactive record linkage. JAMIA 21(2):212\u2013220","journal-title":"JAMIA"},{"key":"17-1_CR17","doi-asserted-by":"crossref","unstructured":"Kuzu M, Kantarcioglu M, Durham E, Malin B (2011) A constraint satisfaction cryptanalysis of Bloom filters in private record linkage. In: PETS, Waterloo. LNCS, vol 6794. Springer, pp 226\u2013245","DOI":"10.1007\/978-3-642-22263-4_13"},{"issue":"1","key":"17-1_CR18","doi-asserted-by":"crossref","first-page":"59","DOI":"10.29012\/jpc.v1i1.566","volume":"1","author":"Y Lindell","year":"2009","unstructured":"Lindell Y, Pinkas B (2009) Secure multiparty computation for privacy-preserving data mining. JPC 1(1):59\u201398","journal-title":"JPC"},{"issue":"3","key":"17-1_CR19","first-page":"533","volume":"24","author":"C Phua","year":"2012","unstructured":"Phua C, Smith-Miles K, Lee V, Gayler R (2012) Resilient identity crime detection. IEEE TKDE 24(3):533\u2013546","journal-title":"IEEE TKDE"},{"key":"17-1_CR20","first-page":"1161","volume-title":"Scalable block scheduling for efficient multi-database record linkage","author":"T Ranbaduge","year":"2016","unstructured":"Ranbaduge T, Vatsalan D, Christen P (2016) Scalable block scheduling for efficient multi-database record linkage. In: ICDM. IEEE, pp 1161\u20131166"},{"key":"17-1_CR21","first-page":"205","volume":"50","author":"SM Randall","year":"2014","unstructured":"Randall SM, Ferrante AM, Boyd JH, Bauer JK, Semmens JB (2014) PPRL on large real world datasets. JBI 50:205\u2013212","journal-title":"JBI"},{"issue":"2","key":"17-1_CR22","first-page":"71","volume":"45","author":"SM Randall","year":"2016","unstructured":"Randall SM, Ferrante AM, Boyd JH, Brown AP, Semmens JB (2016) Limited privacy protection and poor sensitivity: is it time to move on from the statistical linkage key-581? HIMJ 45(2):71\u201379","journal-title":"HIMJ"},{"issue":"41","key":"17-1_CR23","first-page":"1","volume":"9","author":"R Schnell","year":"2009","unstructured":"Schnell R, Bachteler T, Reiher J (2009) Privacy-preserving record linkage using Bloom filters. BMC MIDM 9(41):1\u201311","journal-title":"BMC MIDM"},{"key":"17-1_CR24","volume-title":"PPRL with PPJoin","author":"Z Sehili","year":"2015","unstructured":"Sehili Z, Kolb L, Borgs C, Schnell R, Rahm E (2015) PPRL with PPJoin. In: BTW, Hamburg"},{"key":"17-1_CR25","first-page":"2473","volume-title":"GeCo: an online personal data generator and corruptor","author":"K-N Tran","year":"2013","unstructured":"Tran K-N, Vatsalan D, Christen P (2013) GeCo: an online personal data generator and corruptor. In: CIKM, San Francisco. ACM, pp 2473\u20132476"},{"key":"17-1_CR26","unstructured":"Vatsalan D, Christen P (2012) An iterative two-party protocol for scalable PPRL. In: AusDM, CRPIT, Sydney, vol 134,"},{"key":"17-1_CR27","volume-title":"Scalable PPRL for multiple databases","author":"D Vatsalan","year":"2014","unstructured":"Vatsalan D, Christen P (2014) Scalable PPRL for multiple databases. In: CIKM, Shanghai. ACM"},{"key":"17-1_CR28","first-page":"285","volume":"59","author":"D Vatsalan","year":"2016","unstructured":"Vatsalan D, Christen P (2016) Privacy-preserving matching of similar patients. JBI 59:285\u2013298","journal-title":"JBI"},{"issue":"6","key":"17-1_CR29","first-page":"946","volume":"38","author":"D Vatsalan","year":"2013","unstructured":"Vatsalan D, Christen P, Verykios VS (2013) A taxonomy of PPRL techniques. JIS 38(6):946\u2013969","journal-title":"JIS"},{"issue":"1","key":"17-1_CR30","doi-asserted-by":"crossref","first-page":"35","DOI":"10.29012\/jpc.v6i1.636","volume":"6","author":"D Vatsalan","year":"2014","unstructured":"Vatsalan D, Christen P, O\u2019Keefe CM, Verykios VS (2014) An evaluation framework for PPRL. JPC 6(1):35\u201375","journal-title":"JPC"},{"key":"17-1_CR31","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMW.2016.0130","volume-title":"Scalable privacy-preserving linking of multiple databases using counting bloom filters","author":"D Vatsalan","year":"2016","unstructured":"Vatsalan D, Christen P, Rahm E (2016) Scalable privacy-preserving linking of multiple databases using counting bloom filters. In: ICDMW PDDM, Barcelona. IEEE"},{"key":"17-1_CR32","first-page":"205","volume":"72","author":"H Zhu","year":"2017","unstructured":"Zhu H, Liu H, Ou CX, Davison RM, Yang Z (2017) Privacy preserving mechanisms for optimizing cross-organizational collaborative decisions based on the Karmarkar algorithm. JIS 72:205\u2013217","journal-title":"JIS"}],"container-title":["Encyclopedia of Big Data Technologies"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-63962-8_17-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,10]],"date-time":"2019-05-10T02:25:34Z","timestamp":1557455134000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-63962-8_17-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319639628","9783319639628"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-63962-8_17-1","relation":{},"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"7 February 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}  <script>parent.window.postMessage('ixistenz.url:https://api.crossref.org/works/10.1007%2F978-3-319-63962-8_17-1', '*'); </script> <div id='browserdiffcontainer' style='position: fixed; right: 10px; top: 10vh; min-width: 60px;  border: 1px solid white; background: rgb(251, 189, 0);; opacity: 0.9; font-family: helvetica, arial, sans serif;  font-size: 12px; z-index: 20001; padding-bottom: 20px;'><div onclick="toggle('browserdiffcontainerlist'); return false;" style='background: rgb(151, 89, 0);; color: white; '><strong>&nbsp; <span class='glyphicon glyphicon-minus'></span> NODES</strong></div><div id='browserdiffcontainerlist' style='padding-left: 10px; padding-right: 5px; max-height: 50vh; overflow: auto; '><div><a href='#diffid123' style='color: white;' onClick="parent.window.postMessage('ixistenz.opendiff:123', '*');; return false;" style='text-decoration: none; '>INTERN </a> <a style='color: white;' href='#diffid123'><sup>1</sup></a></div></div></div>
<script>
function toggle( divname ) {
  var x = document.getElementById( divname );
  if (x.style.display === 'none') {
    x.style.display = 'block';
  } else {
    x.style.display = 'none';
  }
} </script>