{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T06:24:48Z","timestamp":1773728688287,"version":"3.50.1"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031203084","type":"print"},{"value":"9783031203091","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-20309-1_52","type":"book-chapter","created":{"date-parts":[[2022,12,7]],"date-time":"2022-12-07T06:11:35Z","timestamp":1670393495000},"page":"591-602","update-policy":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Multi-party Privacy-Preserving Record Linkage Method Based on Trusted Execution Environment"],"prefix":"10.1007","author":[{"given":"Xuefei","family":"He","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haiping","family":"Wei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shumin","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Derong","family":"Shen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,12,8]]},"reference":[{"key":"52_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/978-3-030-87571-8_24","volume-title":"Web Information Systems and Applications","author":"T Li","year":"2021","unstructured":"Li, T., Liu, Q., Huang, R.: Multi-user fully homomorphic encryption scheme based on policy for cloud computing. In: Xing, C., Fu, X., Zhang, Y., Zhang, G., Borjigin, C. (eds.) WISA 2021. LNCS, vol. 12999, pp. 274\u2013286. Springer, Cham (2021). https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/978-3-030-87571-8_24"},{"key":"52_CR2","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play ANY mental game. ACM (1987)","DOI":"10.1145\/28395.28420"},{"key":"52_CR3","doi-asserted-by":"crossref","unstructured":"Bloom, Burton, H.: Space\/time trade-offs in hash coding with allowable errors.\u00a0Commun. ACM\u00a0.13(7), 422\u2212426 (1970)","DOI":"10.1145\/362686.362692"},{"key":"52_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/978-3-642-22263-4_13","volume-title":"Privacy Enhancing Technologies","author":"M Kuzu","year":"2011","unstructured":"Kuzu, M., Kantarcioglu, M., Durham, E., Malin, B.: A constraint satisfaction cryptanalysis of bloom filters in private record linkage. In: Fischer-H\u00fcbner, S., Hopper, N. (eds.) PETS 2011. LNCS, vol. 6794, pp. 226\u2013245. Springer, Heidelberg (2011). https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/978-3-642-22263-4_13"},{"key":"52_CR5","doi-asserted-by":"crossref","unstructured":"Ali, I., Murat, K., Elisa, B., Monica, S.: A hybrid approach to private record linkage. In: 2008 IEEE 24th International Conference on Data Engineering (ICDE 2008), pp. 496\u2212505. IEEE Computer Society, USA (2008)","DOI":"10.1109\/ICDE.2008.4497458"},{"key":"52_CR6","doi-asserted-by":"crossref","unstructured":"Ali, A., Dongwon, L., Patrick, M.D.: Blocking-aware private record linkage. In: Proceedings of the 2nd International Workshop on Information Quality in Information Systems (IQIS 2005), pp. 59\u221268. Association for Computing Machinery, New York, USA (2005)","DOI":"10.1145\/1077501.1077513"},{"key":"52_CR7","unstructured":"Ravikumar, P., Cohen, W.W., Fienberg, S.E.: A secure protocol for computing string distance metrics. In: IEEE International Conference on Data Mining (ICDM 2004), Workshop on Privacy and Security Aspects of Data Mining (2004)"},{"issue":"9","key":"52_CR8","first-page":"1","volume":"4","author":"T Churches","year":"2004","unstructured":"Churches, T., Christen, P.: Some methods for blindfolded record linkage. BMC Med Inform Decis Mak 4(9), 1\u201317 (2004)","journal-title":"BMC Med Inform Decis Mak"},{"key":"52_CR9","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1023\/A:1009761603038","volume":"2","author":"MA Hern\u00e1ndez","year":"1998","unstructured":"Hern\u00e1ndez, M.A., Stolfo, S.J.: Real-world data is dirty: data cleansing and the Merge\/Purge problem. Data Min. Knowl. Disc. 2, 9\u201337 (1998)","journal-title":"Data Min. Knowl. Disc."},{"key":"52_CR10","doi-asserted-by":"crossref","unstructured":"Inan, A., Kantarcioglu, M., Bertino, E., Scannapieco, M.: A hybrid approach to private record linkage. In: 2008 IEEE 24th International Conference on Data Engineering, pp. 496\u2212505. Cancun, Mexico (2008)","DOI":"10.1109\/ICDE.2008.4497458"},{"key":"52_CR11","doi-asserted-by":"crossref","unstructured":"Florian, K.: Distance-preserving pseudonymization for timestamps and spatial data. In: Proceedings of the 2007 ACM Workshop on Privacy in Electronic Society (WPES 2007), pp. 68\u221271. Association for Computing Machinery, New York, USA (2007)","DOI":"10.1145\/1314333.1314346"},{"key":"52_CR12","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.datak.2015.07.009","volume":"100","author":"J Herranz","year":"2015","unstructured":"Herranz, J., Nin, J., Rodr\u00edguez, P., Tassa, T.: Revisiting distance-based record linkage for privacy-preserving release of statistical datasets. Data Knowl. Eng. 100, 78\u201393 (2015)","journal-title":"Data Knowl. Eng."},{"key":"52_CR13","unstructured":"Zhang, C., Li, S., Xia, J., et al.: Batchcrypt: efficient homomorphic encryption for cross-silo federated learning. In: 2020 USENIX Annual Technical Conference (USENIX ATC 20), pp. 493\u2212506 (2020)"},{"key":"52_CR14","unstructured":"Pascal, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Proceedings of the 17th International Conference on Theory and Application of Cryptographic Techniques (EUROCRYPT 2004), pp. 223\u2212238. Springer, Heidelberg (2004)"},{"issue":"9","key":"52_CR15","doi-asserted-by":"publisher","first-page":"1537","DOI":"10.1109\/TKDE.2011.127","volume":"24","author":"C Peter","year":"2012","unstructured":"Peter, C.: A survey of indexing techniques for scalable record linkage and deduplication. IEEE Trans. Knowl. Data Eng. 24(9), 1537\u20131555 (2012)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"52_CR16","unstructured":"Randall, S.M., Brown, A.P., Ferrante, A.M., Boyd, J.H., Semmens, J.B.: Privacy preserving record linkage using homomorphic encryption. In: First International Workshop on Population Informatics for Big Data (PopInfo 2015) (2015)"},{"key":"52_CR17","doi-asserted-by":"crossref","unstructured":"Durham, E.A., Kantarcioglu, M., Xue, Y., Toth, C., Kuzu, M., Malin, B.: Composite bloom filters for secure record linkage. In: IEEE Transactions on Knowledge and Data Engineering, pp. 2956\u22122968 (2014)","DOI":"10.1109\/TKDE.2013.91"},{"key":"52_CR18","doi-asserted-by":"crossref","unstructured":"Karapiperis, D., Gkoulala, A., Verykios, V.S.: FEDERAL: a framework for distance aware privacy-preserving record linkage. In: IEEE Transactions on Knowledge and Data Engineering, vol. 30, no. 2, p. 292\u2212304 (2018)","DOI":"10.1109\/TKDE.2017.2761759"},{"key":"52_CR19","doi-asserted-by":"crossref","unstructured":"Vatsalan, D., Peter, C.: Scalable privacy-preserving record linkage for multiple databases. In: Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management (CIKM 214), pp. 1795\u22121798. Association for Computing Machinery, New York, USA (2014)","DOI":"10.1145\/2661829.2661875"}],"container-title":["Lecture Notes in Computer Science","Web Information Systems and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-20309-1_52","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,10]],"date-time":"2024-10-10T00:37:52Z","timestamp":1728520672000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/link.springer.com\/10.1007\/978-3-031-20309-1_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031203084","9783031203091"],"references-count":19,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/978-3-031-20309-1_52","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"8 December 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WISA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Web Information Systems and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dalian","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wisa22022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2.zoppoz.workers.dev:443\/https\/conf.ccf.org.cn\/web\/html7\/index.html?globalId=m9475032704175349761645943983427&type=1","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"212","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"45","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"19","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"21% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}