{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:34:30Z","timestamp":1750221270715,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,12,4]],"date-time":"2017-12-04T00:00:00Z","timestamp":1512345600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,12,4]]},"DOI":"10.1145\/3151759.3151788","type":"proceedings-article","created":{"date-parts":[[2018,2,9]],"date-time":"2018-02-09T18:54:36Z","timestamp":1518202476000},"page":"224-233","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Secure similarity joins using fully homomorphic encryption"],"prefix":"10.1145","author":[{"given":"Mateus S. H.","family":"Cruz","sequence":"first","affiliation":[{"name":"University of Tsukuba, Tsukuba, Japan"}]},{"given":"Toshiyuki","family":"Amagasa","sequence":"additional","affiliation":[{"name":"University of Tsukuba, Tsukuba, Japan"}]},{"given":"Chiemi","family":"Watanabe","sequence":"additional","affiliation":[{"name":"University of Tsukuba, Tsukuba, Japan"}]},{"given":"Wenjie","family":"Lu","sequence":"additional","affiliation":[{"name":"University of Tsukuba, Tsukuba, Japan"}]},{"given":"Hiroyuki","family":"Kitagawa","sequence":"additional","affiliation":[{"name":"University of Tsukuba, Tsukuba, Japan"}]}],"member":"320","published-online":{"date-parts":[[2017,12,4]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2633600"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1999.1690"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2006.9"},{"key":"e_1_3_2_1_5_1","volume-title":"Efficient Cryptanalysis of Bloom Filters for Privacy-Preserving Record Linkage. In Pacific-Asia Conference on Knowledge Discovery and Data Mining. Springer, 628--640","author":"Christen Peter","year":"2017","unstructured":"Peter Christen , Rainer Schnell , Dinusha Vatsalan , and Thilina Ranbaduge . 2017 . Efficient Cryptanalysis of Bloom Filters for Privacy-Preserving Record Linkage. In Pacific-Asia Conference on Knowledge Discovery and Data Mining. Springer, 628--640 . Peter Christen, Rainer Schnell, Dinusha Vatsalan, and Thilina Ranbaduge. 2017. Efficient Cryptanalysis of Bloom Filters for Privacy-Preserving Record Linkage. In Pacific-Asia Conference on Knowledge Discovery and Data Mining. Springer, 628--640."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-29485-8_19"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057074"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.577"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536440"},{"key":"e_1_3_2_1_11_1","first-page":"491","article-title":"Approximate string joins in a database (almost) for free","volume":"1","author":"Gravano Luis","year":"2001","unstructured":"Luis Gravano , Panagiotis G Ipeirotis , Hosagrahar Visvesvaraya Jagadish , Nick Koudas , Shanmugauelayut Muthukrishnan , Divesh Srivastava , 2001 . Approximate string joins in a database (almost) for free . In VLDB , Vol. 1. 491 -- 500 . Luis Gravano, Panagiotis G Ipeirotis, Hosagrahar Visvesvaraya Jagadish, Nick Koudas, Shanmugauelayut Muthukrishnan, Divesh Srivastava, et al. 2001. Approximate string joins in a database (almost) for free. In VLDB, Vol. 1. 491--500.","journal-title":"VLDB"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732296.2732299"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2012.23"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1136\/amiajnl-2012-000917"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/2032397.2032432"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/1833515.1833604"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13190-5_1"},{"key":"e_1_3_2_1_19_1","first-page":"396","article-title":"SecureML: A System for Scalable Privacy-Preserving Machine Learning","volume":"2017","author":"Mohassel Payman","year":"2017","unstructured":"Payman Mohassel and Yupeng Zhang . 2017 . SecureML: A System for Scalable Privacy-Preserving Machine Learning . IACR Cryptology ePrint Archive 2017 (2017), 396 . Payman Mohassel and Yupeng Zhang. 2017. SecureML: A System for Scalable Privacy-Preserving Machine Learning. IACR Cryptology ePrint Archive 2017 (2017), 396.","journal-title":"IACR Cryptology ePrint Archive"},{"volume-title":"Public-Key Cryptosystems Based on Composite Degree Residuosity Classes","author":"Paillier Pascal","key":"e_1_3_2_1_20_1","unstructured":"Pascal Paillier . 1999. Public-Key Cryptosystems Based on Composite Degree Residuosity Classes . Springer Berlin Heidelberg , Berlin, Heidelberg , 223--238. Pascal Paillier. 1999. Public-Key Cryptosystems Based on Composite Degree Residuosity Classes. Springer Berlin Heidelberg, Berlin, Heidelberg, 223--238."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2043556.2043566"},{"key":"e_1_3_2_1_22_1","volume-title":"Privacy-preserving record linkage using Bloom filters. BMC medical informatics and decision making 9, 1","author":"Schnell Rainer","year":"2009","unstructured":"Rainer Schnell , Tobias Bachteler , and J\u00f6rg Reiher . 2009. Privacy-preserving record linkage using Bloom filters. BMC medical informatics and decision making 9, 1 ( 2009 ), 41. Rainer Schnell, Tobias Bachteler, and J\u00f6rg Reiher. 2009. Privacy-preserving record linkage using Bloom filters. BMC medical informatics and decision making 9, 1 (2009), 41."},{"key":"e_1_3_2_1_23_1","unstructured":"Ziad Sehili Lars Kolb Christian Borgs Rainer Schnell and Erhard Rahm. 2015. Privacy Preserving Record Linkage with PPJoin.. In BTW. 85--104.  Ziad Sehili Lars Kolb Christian Borgs Rainer Schnell and Erhard Rahm. 2015. Privacy Preserving Record Linkage with PPJoin.. In BTW. 85--104."},{"key":"e_1_3_2_1_24_1","first-page":"S6","article-title":"Privacy-preserving search for chemical compound databases. BMC bioinformatics 16","volume":"18","author":"Shimizu Kana","year":"2015","unstructured":"Kana Shimizu , Koji Nuida , Hiromi Arai , Shigeo Mitsunari , Nuttapong Attra-padung, Michiaki Hamada , Koji Tsuda , Takatsugu Hirokawa , Jun Sakuma , Goichiro Hanaoka , 2015 . Privacy-preserving search for chemical compound databases. BMC bioinformatics 16 , Suppl 18 (2015), S6 . Kana Shimizu, Koji Nuida, Hiromi Arai, Shigeo Mitsunari, Nuttapong Attra-padung, Michiaki Hamada, Koji Tsuda, Takatsugu Hirokawa, Jun Sakuma, Goichiro Hanaoka, et al. 2015. Privacy-preserving search for chemical compound databases. BMC bioinformatics 16, Suppl 18 (2015), S6.","journal-title":"Suppl"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-012-9720-4"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.14778\/2535573.2488336"},{"key":"e_1_3_2_1_27_1","volume-title":"Scalable Multi-Database Privacy-Preserving Record Linkage using Counting Bloom Filters. arXiv preprint arXiv: 1701.01232","author":"Vatsalan Dinusha","year":"2017","unstructured":"Dinusha Vatsalan , Peter Christen , and Erhard Rahm . 2017. Scalable Multi-Database Privacy-Preserving Record Linkage using Counting Bloom Filters. arXiv preprint arXiv: 1701.01232 ( 2017 ). Dinusha Vatsalan, Peter Christen, and Erhard Rahm. 2017. Scalable Multi-Database Privacy-Preserving Record Linkage using Counting Bloom Filters. arXiv preprint arXiv: 1701.01232 (2017)."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2014.6848153"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213847"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559862"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2000824.2000825"}],"event":{"name":"iiWAS2017: The 19th International Conference on Information Integration and Web-based Applications & Services","acronym":"iiWAS2017","location":"Salzburg Austria"},"container-title":["Proceedings of the 19th International Conference on Information Integration and Web-based Applications & Services"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3151759.3151788","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3151759.3151788","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:11:05Z","timestamp":1750212665000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3151759.3151788"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12,4]]},"references-count":29,"alternative-id":["10.1145\/3151759.3151788","10.1145\/3151759"],"URL":"https:\/\/doi.org\/10.1145\/3151759.3151788","relation":{},"subject":[],"published":{"date-parts":[[2017,12,4]]},"assertion":[{"value":"2017-12-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}