{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,24]],"date-time":"2025-11-24T11:15:21Z","timestamp":1763982921534,"version":"3.45.0"},"publisher-location":"Singapore","reference-count":17,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819546732"},{"type":"electronic","value":"9789819546749"}],"license":[{"start":{"date-parts":[[2025,11,25]],"date-time":"2025-11-25T00:00:00Z","timestamp":1764028800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,25]],"date-time":"2025-11-25T00:00:00Z","timestamp":1764028800000},"content-version":"vor","delay-in-days":0,"URL":"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":[[2026]]},"DOI":"10.1007\/978-981-95-4674-9_14","type":"book-chapter","created":{"date-parts":[[2025,11,24]],"date-time":"2025-11-24T11:10:49Z","timestamp":1763982649000},"page":"269-289","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Non-interactive Privacy-Preserving Record Linkage Using Polynomial Sparsity Testing"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-9935-8095","authenticated-orcid":false,"given":"Frederik","family":"Armknecht","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9073-4061","authenticated-orcid":false,"given":"Youzhe","family":"Heng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-4396-6186","authenticated-orcid":false,"given":"Jochen","family":"Sch\u00e4fer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,11,25]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Armknecht, F., Heng, Y., Schnell, R.: Strengthening privacy-preserving record linkage using diffusion. Proc. Priv. Enhanc. Technol. 2023, 298\u2013311 (04 2023)","DOI":"10.56553\/popets-2023-0054"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Tiwari, P.: A deterministic algorithm for sparse multivariate polynomial interpolation. In: Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing. Association for Computing Machinery, New York, NY, USA (1988)","DOI":"10.1145\/62212.62241"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Christen, P., Ranbaduge, T., Schnell, R.: Linking Sensitive Data: Methods and Techniques for Practical Privacy-Preserving Information Sharing. Springer (2020)","DOI":"10.1007\/978-3-030-59706-1"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Correll, P., et al.: Lumos: a statewide linkage programme in Australia integrating general practice data to guide system redesign. Integr. Healthcare J. 3, e000074 (05 2021)","DOI":"10.1136\/ihj-2021-000074"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"von\u00a0zur Gathen, J., Gerhard, J.: Modern Computer Algebra. Cambridge University Press, Cambridge, England, UK (Apr 2013)","DOI":"10.1017\/CBO9781139856065"},{"key":"14_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-26951-7_1","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"S Ghosh","year":"2019","unstructured":"Ghosh, S., Simkin, M.: The communication complexity of threshold private set intersection. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11693, pp. 3\u201329. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26951-7_1"},{"issue":"20","key":"14_CR7","doi-asserted-by":"publisher","first-page":"898","DOI":"10.1016\/j.ipl.2010.07.012","volume":"110","author":"E Grigorescu","year":"2010","unstructured":"Grigorescu, E., Jung, K., Rubinfeld, R.: A local decision test for sparse polynomials. Inf. Process. Lett. 110(20), 898\u2013901 (2010)","journal-title":"Inf. Process. Lett."},{"issue":"6","key":"14_CR8","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1007\/BF01268423","volume":"36","author":"L Gyun-y","year":"1984","unstructured":"Gyun-y, L.: A new algorithm for the inversion of Hankel and Toeplitz matrices. Ukrainian Math. J. 36(6), 536\u2013540 (1984)","journal-title":"Ukrainian Math. J."},{"key":"14_CR9","doi-asserted-by":"publisher","unstructured":"Heng, Y., Schnell, R., Armknecht, F.: Cryptanalysis of the record linkage protocol used by German cancer registries. In: Sicherheit 2024, pp. 65\u201374. Gesellschaft f\u00fcr Informatik e.V., Bonn (2024). https:\/\/doi.org\/10.18420\/sicherheit2024_004","DOI":"10.18420\/sicherheit2024_004"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Kho, A.N., et al.: Design and implementation of a privacy preserving electronic health record linkage tool in Chicago. J. American Med. Inform. Assoc. 22(5), 1072\u20131080 (Jun 2015)","DOI":"10.1093\/jamia\/ocv038"},{"key":"14_CR11","volume-title":"11th Priv","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.) 11th Priv. Enhancing Techn. Sympos. Springer, Berlin (2011)"},{"issue":"1","key":"14_CR12","doi-asserted-by":"publisher","first-page":"401","DOI":"10.3233\/SJI-200704","volume":"37","author":"R Lenz","year":"2021","unstructured":"Lenz, R., Hochg\u00fcrtel, T.: Random disclosure in confidential statistical databases. Stat. J. IAOS 37(1), 401\u2013413 (2021)","journal-title":"Stat. J. IAOS"},{"key":"14_CR13","doi-asserted-by":"publisher","unstructured":"Niedermeyer, F., Steinmetzer, S., Kroll, M., Schnell, R.: Cryptanalysis of basic bloom filters used for privacy preserving record linkage. J. Priv. Confidentiality 6 (12 2014). https:\/\/doi.org\/10.29012\/jpc.v6i2.640","DOI":"10.29012\/jpc.v6i2.640"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Sch\u00e4fer, J., Armknecht, F., Heng, Y.: R+r: Revisiting graph matching attacks on privacy-preserving record linkage. Proceedings of the 2024 Annual Computer Security Applications Conference (ACSAC), Honolulu, HI, USA (2024)","DOI":"10.1109\/ACSAC63791.2024.00064"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Vidanage, A., Christen, P., Ranbaduge, T., Schnell, R.: A graph matching attack on privacy-preserving record linkage. In: Proceedings of the 29th ACM International Conference on Information and Knowledge Management, pp. 1485\u20131494. ACM, New York (10 2020)","DOI":"10.1145\/3340531.3411931"},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"Vidanage, A., Ranbaduge, T., Christen, P., Randall, S.: A privacy attack on multiple dynamic match-key based privacy-preserving record linkage. Int. J. Popul. Data Sci. 5(1) (Aug 2020)","DOI":"10.23889\/ijpds.v5i1.1345"},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"Vidanage, A., Ranbaduge, T., Christen, P., Schnell, R.: Efficient pattern mining based cryptanalysis for privacy-preserving record linkage. In: 2019 IEEE 35th International Conference on Data Engineering ICDE. IEEE, Los Alamitos (2019)","DOI":"10.1109\/ICDE.2019.00176"}],"container-title":["Lecture Notes in Computer Science","Advances in Information and Computer Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-4674-9_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,24]],"date-time":"2025-11-24T11:10:56Z","timestamp":1763982656000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-4674-9_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,25]]},"ISBN":["9789819546732","9789819546749"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-4674-9_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025,11,25]]},"assertion":[{"value":"25 November 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"IWSEC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Fukuoka","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 November 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 November 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwsec2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iwsec.org\/2025\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}