{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T12:09:21Z","timestamp":1770725361781,"version":"3.49.0"},"reference-count":30,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,9]]},"DOI":"10.1109\/isc2.2018.8656943","type":"proceedings-article","created":{"date-parts":[[2019,3,5]],"date-time":"2019-03-05T01:16:13Z","timestamp":1551748573000},"page":"1-8","source":"Crossref","is-referenced-by-count":4,"title":["FEMRL: A Framework for Large-Scale Privacy-Preserving Linkage of Patients\u2019 Electronic Health Records"],"prefix":"10.1109","author":[{"given":"Dimitrios","family":"Karapiperis","sequence":"first","affiliation":[]},{"given":"Aris","family":"Gkoulalas-Divanis","sequence":"additional","affiliation":[]},{"given":"Vassilios S.","family":"Verykios","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2012.11.005"},{"key":"ref10","first-page":"15","article-title":"Ox-link: The Oxford medical record linkage system","author":"gill","year":"1997","journal-title":"Record Linkage Workshop and Exposition"},{"key":"ref11","first-page":"518","article-title":"Similarity search in high dimensions via hashing","author":"gionis","year":"1999","journal-title":"VLDB"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15838-4_24"},{"key":"ref13","article-title":"FRIL: A Tool for Comparative Record Linkage","author":"jurczyk","year":"2008","journal-title":"AMIA"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMW.2016.7867099"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2017.58"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2761759"},{"key":"ref17","article-title":"Efficient Record Linakge Using a Compact Hamming Space","author":"karapiperis","year":"2016","journal-title":"EDBT"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2014.2349916"},{"key":"ref19","first-page":"26","article-title":"Research use of linked helath data: a best practice protocol","author":"kelman","year":"2002","journal-title":"Australian NZ J Public Health"},{"key":"ref28","first-page":"1105","article-title":"SOEMPI: A Secure Open Enterprise Master Patient Index Software Toolkit for Private Record Linkage","author":"toth","year":"2014","journal-title":"AMIA Symposium"},{"key":"ref4","first-page":"17","article-title":"Febrl A Freely Available Record Linkage System with a Graphical User Interface","volume":"80","author":"christen","year":"2008","journal-title":"HDKM"},{"key":"ref27","article-title":"Link Plus: Probabilistic record linkage software","author":"thoburn","year":"2007","journal-title":"Probabilistic Record Linkage Conf"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/978-3-319-23633-9_11","article-title":"Application of Privacy-Preserving Techniques in Operational Record Linkage Centres","author":"boyd","year":"2015","journal-title":"Medical Data Privacy Handbook"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/997817.997857"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.jbi.2015.12.004"},{"key":"ref5","first-page":"628","article-title":"Efficient Cryptanalysis of Bloom Filters for Privacy-Preserving Record Linkage","author":"christen","year":"2017","journal-title":"PAKDD"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2013.91"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327492"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465259"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.2307\/2286061"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-23633-9_10"},{"key":"ref20","first-page":"1156","article-title":"Efficient similartiy search over encrypted data","author":"kuzu","year":"2012","journal-title":"ICDE"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.29012\/jpc.v6i2.640"},{"key":"ref21","first-page":"226","article-title":"A constraint satisfaction cryptanalysis of Bloom filters in private record linkage","author":"kuzu","year":"2011","journal-title":"PETS"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.jbi.2013.12.003"},{"key":"ref23","author":"rajaraman","year":"2010","journal-title":"Chapter 3 Finding similar items In Mining of Massive Da-tasets"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1093\/ije\/dys195"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1186\/1472-6947-9-41"}],"event":{"name":"2018 IEEE International Smart Cities Conference (ISC2)","location":"Kansas City, MO, USA","start":{"date-parts":[[2018,9,16]]},"end":{"date-parts":[[2018,9,19]]}},"container-title":["2018 IEEE International Smart Cities Conference (ISC2)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8651074\/8656657\/08656943.pdf?arnumber=8656943","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,27]],"date-time":"2022-01-27T06:39:46Z","timestamp":1643265586000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8656943\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9]]},"references-count":30,"URL":"https:\/\/doi.org\/10.1109\/isc2.2018.8656943","relation":{},"subject":[],"published":{"date-parts":[[2018,9]]}}}