{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:22:07Z","timestamp":1740169327368,"version":"3.37.3"},"reference-count":41,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100002553","name":"Seoul National University of Science and Technology","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002553","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2022]]},"DOI":"10.1109\/access.2022.3208962","type":"journal-article","created":{"date-parts":[[2022,9,22]],"date-time":"2022-09-22T23:01:19Z","timestamp":1663887679000},"page":"101957-101971","source":"Crossref","is-referenced-by-count":0,"title":["Asymptotically Optimal and Secure Multiwriter\/Multireader Similarity Search"],"prefix":"10.1109","volume":"10","author":[{"given":"Hyunsoo","family":"Kwon","sequence":"first","affiliation":[{"name":"Samsung Electronics, Hwaseong, South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4334-0411","authenticated-orcid":false,"given":"Changhee","family":"Hahn","sequence":"additional","affiliation":[{"name":"Department of Electrical and Information Engineering, Seoul National University of Science and Technology, Seoul, South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/MIC.2012.14"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2012.1"},{"key":"ref3","first-page":"518","article-title":"Similarity search in high dimensions via hashing","volume-title":"Proc. VLDB","author":"Gionis"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2636328"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242657"},{"key":"ref6","first-page":"12","article-title":"Access pattern disclosure on searchable encryption: Ramification, attack and mitigation","volume-title":"Proc. NDSS","volume":"20","author":"Islam"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813700"},{"key":"ref8","first-page":"707","article-title":"All your queries are belong to us: The power of file-injection attacks on searchable encryption","volume-title":"Proc. Usenix Secur.","author":"Zhang"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24676-3_30"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/SECPRI.2000.848445"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24852-1_3"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-73489-5_2"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-75248-6_8"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00306-6_11"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-89641-8_13"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-79104-1_6"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2014.2355202"},{"key":"ref18","first-page":"1","article-title":"Multi-key searchable encryption","author":"Popa","year":"2013","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-45744-4_9"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-45744-4_8"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2015.7218657"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2010.5462196"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2012.23"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2014.28"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2017.2721221"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-55415-5_5"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2016.7524346"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/s11277-018-5744-z"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17455-1"},{"volume-title":"INRIA Copydays","year":"2022","key":"ref30"},{"key":"ref31","first-page":"5","article-title":"Efficient near-duplicate detection and sub-image retrieval","volume-title":"Proc. ACM Multimedia","author":"Ke"},{"volume-title":"Python Software Foundation","year":"2022","key":"ref32"},{"volume-title":"VoCore2","year":"2017","key":"ref33"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36400-5_9"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/1455770.1455823"},{"key":"ref36","first-page":"1010","article-title":"TWORAM: Round-optimal oblivious RAM with applications to searchable encryption","volume":"2015","author":"Garg","year":"2015","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2014.23298"},{"key":"ref38","first-page":"1143","article-title":"\u03a3o\u03c6o\u03c2\u2014Forward secure searchable encryption","volume-title":"Proc. ACM CCS","volume":"16","author":"Bost"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3133980"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3133970"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85538-5_1"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/9668973\/09900309.pdf?arnumber=9900309","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,22]],"date-time":"2024-01-22T21:57:49Z","timestamp":1705960669000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9900309\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"references-count":41,"URL":"https:\/\/doi.org\/10.1109\/access.2022.3208962","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2022]]}}}