{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T19:16:49Z","timestamp":1774725409518,"version":"3.50.1"},"reference-count":34,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2018,2,1]],"date-time":"2018-02-01T00:00:00Z","timestamp":1517443200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2018,2,1]]},"DOI":"10.1109\/tkde.2017.2761759","type":"journal-article","created":{"date-parts":[[2017,10,10]],"date-time":"2017-10-10T19:02:06Z","timestamp":1507662126000},"page":"292-304","source":"Crossref","is-referenced-by-count":32,"title":["FEDERAL: A Framework for Distance-Aware Privacy-Preserving Record Linkage"],"prefix":"10.1109","volume":"30","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3878-5988","authenticated-orcid":false,"given":"Dimitrios","family":"Karapiperis","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0011-6591","authenticated-orcid":false,"given":"Aris","family":"Gkoulalas-Divanis","sequence":"additional","affiliation":[]},{"given":"Vassilios S.","family":"Verykios","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814075"},{"key":"ref32","first-page":"628","article-title":"Efficient cryptanalysis of Bloom\n filters for privacy-preserving record linkage","author":"christen","year":"0","journal-title":"Proc 12th Pacific-Asia Conf Adv Knowl Discovery Data Mining"},{"key":"ref31","doi-asserted-by":"crossref","DOI":"10.29012\/jpc.v6i2.640","article-title":"Cryptanalysis of basic bloom filters\n used for privacy preserving record linkage","volume":"6","author":"niedermeyer","year":"2014","journal-title":"J Privacy Confidentiality"},{"key":"ref30","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1007\/978-3-642-22263-4_13","article-title":"A constraint satisfaction cryptanalysis of\n Bloom filters in private record linkage","author":"kuzu","year":"2011","journal-title":"Proc 11th Int Conf Privacy Enhancing Technol"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMW.2016.7867099"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.jbi.2015.12.004"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-016-0919-y"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1186\/1472-6947-4-9"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2017.58"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/1005140.1005147"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2009.221"},{"key":"ref16","author":"rajaraman","year":"2010","journal-title":"Mining of Massive Datasets"},{"key":"ref17","doi-asserted-by":"crossref","first-page":"933","DOI":"10.14778\/1453856.1453957","article-title":"Ed-Jjoin: An efficient algorithm for similarity joins with edit distance constraints","volume":"1","author":"xiao","year":"2008","journal-title":"Proc VLDB Endowment"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.14778\/2078331.2078340"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989431"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.2298\/CSIS140215040K"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2012.11.005"},{"key":"ref27","first-page":"209","article-title":"Efficient record linakge using a\n compact hamming space","author":"karapiperis","year":"2016","journal-title":"Proc Intl Conf Extending Database Technology"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1186\/1472-6947-9-41"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1739041.1739059"},{"key":"ref29","first-page":"1156","article-title":"Efficient similartiy search over encrypted data","author":"kuzu","year":"2012","journal-title":"Proc IEEE 25th Int Conf Data Eng"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497458"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48910-X_16"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2452376.2452398"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2396761.2398480"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2014.2349916"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247553"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920992"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/1314333.1314346"},{"key":"ref21","first-page":"759","article-title":"Efficient approximate entity extraction\n with edit distance constraints","author":"wang","year":"2009","journal-title":"Proc ACM SIGMOD Int Conf Manag Data"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2013.91"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/2661829.2661875"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327494"},{"key":"ref25","doi-asserted-by":"crossref","DOI":"10.2139\/ssrn.3549247","article-title":"A novel\n error-tolerant anonymous linking code","author":"schnell","year":"2011"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/8253562\/08063935.pdf?arnumber=8063935","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,25]],"date-time":"2022-01-25T22:28:05Z","timestamp":1643149685000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8063935\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2,1]]},"references-count":34,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2017.2761759","relation":{},"ISSN":["1041-4347"],"issn-type":[{"value":"1041-4347","type":"print"}],"subject":[],"published":{"date-parts":[[2018,2,1]]}}}