{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:19:37Z","timestamp":1740169177786,"version":"3.37.3"},"reference-count":45,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.2989433","type":"journal-article","created":{"date-parts":[[2020,4,29]],"date-time":"2020-04-29T20:54:28Z","timestamp":1588193668000},"page":"83754-83764","source":"Crossref","is-referenced-by-count":3,"title":["Secure and Efficient Nearest Neighbor Query for an Outsourced Database"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6280-896X","authenticated-orcid":false,"given":"Jingjing","family":"Guo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiacong","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45551-5_45"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/SP.1980.10006"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.3233\/JCS-2009-0315"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2015.2401036"},{"key":"ref31","first-page":"101","article-title":"Authentic third-party data publication","author":"devanbu","year":"2000","journal-title":"Proc IFIP Annu Work Conf Database Secur"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00065"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2002.803864"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2013.174"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213871"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1721654.1721672"},{"key":"ref40","first-page":"47","article-title":"R-trees: A dynamic index structure for spatial searching","author":"hadjieleftheriou","year":"1984","journal-title":"Proc ACM Int Conf Manage Data (SIGMOD)"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2014.2363765"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2015.2512870"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2015.23241"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2018.05.005"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-018-3233-7"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559862"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2016.7524389"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.4681"},{"key":"ref19","first-page":"733","article-title":"Secure nearest neighbor revisited","author":"yao","year":"2013","journal-title":"Proc IEEE 29th Int Conf Data Eng (ICDE)"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2013.38"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s12652-018-0757-8"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-01001-9_13"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2016.12.016"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2014.2366471"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.3390\/computers9010001"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/S0065-2458(01)80019-X"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2017.11.063"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2016.05.002"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2013.180"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536440"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2002.994695"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767862"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978345"},{"key":"ref22","first-page":"32","article-title":"Twin clouds: An architecture for secure cloud computing","author":"bugiel","year":"2011","journal-title":"Proc Workshop Cryptogr Secur Clouds (WCSC)"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2015.11.004"},{"key":"ref42","first-page":"218","article-title":"How to play any mental game, or a completeness theorem for protocols with honest majority","author":"goldreich","year":"1987","journal-title":"Proc Annu ACM Symp Theory Comput (STOC)"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2014.6816690"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-293-5"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48910-X_16"},{"key":"ref44","first-page":"218","article-title":"A certified digital signature","author":"merkle","year":"1989","journal-title":"Proc Int'l Cryptology Conf (CRYPTO)"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007632"},{"article-title":"Secure indexes","year":"2004","author":"goh","key":"ref43"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.3390\/electronics7110310"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/09082134.pdf?arnumber=9082134","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,17]],"date-time":"2021-12-17T19:51:34Z","timestamp":1639770694000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9082134\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":45,"URL":"https:\/\/doi.org\/10.1109\/access.2020.2989433","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2020]]}}}