{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:45:53Z","timestamp":1761896753581,"version":"3.37.3"},"reference-count":28,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61702403","61472298","61672408","61702404"],"award-info":[{"award-number":["61702403","61472298","61672408","61702404"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"crossref","award":["JB170308","BDZ011402"],"award-info":[{"award-number":["JB170308","BDZ011402"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"crossref"}]},{"name":"China 111 Project","award":["B16037"],"award-info":[{"award-number":["B16037"]}]},{"name":"Key Program of NSFC","award":["U1405255"],"award-info":[{"award-number":["U1405255"]}]},{"name":"Shaanxi Science & Technology Coordination & Innovation Project","award":["2016TZC-G-6-3"],"award-info":[{"award-number":["2016TZC-G-6-3"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2018]]},"DOI":"10.1109\/access.2018.2830355","type":"journal-article","created":{"date-parts":[[2018,4,26]],"date-time":"2018-04-26T19:12:08Z","timestamp":1524769928000},"page":"23137-23151","source":"Crossref","is-referenced-by-count":7,"title":["Towards Secure Approximate <inline-formula> \n                     <tex-math notation=\"LaTeX\">${k}$ <\/tex-math>\n                  <\/inline-formula>-Nearest Neighbor Query Over Encrypted High-Dimensional Data"],"prefix":"10.1109","volume":"6","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3210-0714","authenticated-orcid":false,"given":"Yanguo","family":"Peng","sequence":"first","affiliation":[]},{"given":"Hui","family":"Li","sequence":"additional","affiliation":[]},{"given":"Jiangtao","family":"Cui","sequence":"additional","affiliation":[]},{"given":"Jianfeng","family":"Ma","sequence":"additional","affiliation":[]},{"given":"Yingfan","family":"Liu","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213898"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276876"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2739807"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2013.2262273"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2016.07.069"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2015.11.004"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/WIFS.2013.6707797"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/2482513.2482539"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-73540-3_14"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/1497577.1497578"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2012.23"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.bspc.2010.01.002"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2014.2302434"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559862"},{"key":"ref6","first-page":"271","article-title":"Approximate nearest neighbor queries in fixed dimensions","author":"arya","year":"1993","journal-title":"Proc ACM-SIAM Symp Discrete Algorithms"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/602259.602266"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2781360"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(93)90222-U"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2014.6816690"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/997817.997857"},{"key":"ref1","first-page":"733","article-title":"Secure nearest neighbor revisited","author":"yao","year":"2013","journal-title":"Proc ICDE"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.57"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559905"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.14778\/2732939.2732947"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2012.23"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.3233\/JCS-2011-0426"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767862"},{"article-title":"How to exchange secrets with oblivious transfer","year":"1981","author":"rabin","key":"ref25"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8274985\/08350023.pdf?arnumber=8350023","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:15:32Z","timestamp":1642004132000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8350023\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"references-count":28,"URL":"https:\/\/doi.org\/10.1109\/access.2018.2830355","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2018]]}}}