{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T19:50:07Z","timestamp":1768679407564,"version":"3.49.0"},"reference-count":35,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2016,6,1]],"date-time":"2016-06-01T00:00:00Z","timestamp":1464739200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2016,6,1]]},"DOI":"10.1109\/tkde.2016.2520473","type":"journal-article","created":{"date-parts":[[2016,1,21]],"date-time":"2016-01-21T19:57:38Z","timestamp":1453406258000},"page":"1546-1559","source":"Crossref","is-referenced-by-count":90,"title":["Practical Approximate k Nearest Neighbor Queries with Location and Query Privacy"],"prefix":"10.1109","volume":"28","author":[{"given":"Xun","family":"Yi","sequence":"first","affiliation":[]},{"given":"Russell","family":"Paulet","sequence":"additional","affiliation":[]},{"given":"Elisa","family":"Bertino","sequence":"additional","affiliation":[]},{"given":"Vijay","family":"Varadharajan","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2014.6816688"},{"key":"ref32","first-page":"733","article-title":"Secure nearest neighbor revisited","author":"yao","year":"0","journal-title":"Proc IEEE Int Conf Data Eng"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559862"},{"key":"ref30","author":"williams","year":"2008","journal-title":"Proc NDSS"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/1071246.1071257"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497445"},{"key":"ref10","first-page":"321","article-title":"An efficient privacy-reserving system for monitoring mobile users: Making searchable encryption practical","author":"ghinita","year":"0","journal-title":"Proc ACM Conf Data Appl Security Privacy"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767862"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-73540-3_14"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/PERSER.2005.1506394"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1997.646125"},{"key":"ref15","first-page":"763","article-title":"The new casper: Query processing for location services without compromising privacy","author":"mokbel","year":"0","journal-title":"Proc 32nd Int Conf Very Large Data Bases"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/MPRV.2003.1186726"},{"key":"ref17","first-page":"791","article-title":"Oblivious transfer with adaptive queries","author":"naor","year":"0","journal-title":"Proc Annu Int Cryptol Conf Adv Cryptol"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71677-8_26"},{"key":"ref19","first-page":"223","article-title":"Public key cryptosystems based on composite degree residue classes","author":"paillier","year":"0","journal-title":"Proc Int Conf Theory Appl Cryptographic Techn"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1142\/S0218488502001648"},{"key":"ref4","first-page":"171","article-title":"A peer-to-peer spatial cloaking algorithm for anonymous location-based services","author":"chow","year":"0","journal-title":"14th Annu ACM Int Symp Adv Geographic Inf Syst"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/1620545.1620550"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/MPRV.2003.1186725"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2014.6816690"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/11863908_4"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057074"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376631"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/11523468_65"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1367497.1367531"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1007\/s10707-010-0121-4","article-title":"Approximate and exact hybrid algorithms for private nearest-neighbor queries with database protection","volume":"15","author":"ghinita","year":"2010","journal-title":"GeoInformatica"},{"key":"ref1","first-page":"92","article-title":"Optimal asymmetric encryption - how to encrypt with RSA","author":"bellare","year":"0","journal-title":"Proc EUROCRYPT"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767898"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2012.95"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920920"},{"key":"ref24","article-title":"Digitalized signatures and public-key functions as intractable as factorization","author":"michael","year":"1979"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2013.87"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2015.2388488"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/359340.359342"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/7463089\/07389401.pdf?arnumber=7389401","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:11:26Z","timestamp":1642003886000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7389401\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,1]]},"references-count":35,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2016.2520473","relation":{},"ISSN":["1041-4347"],"issn-type":[{"value":"1041-4347","type":"print"}],"subject":[],"published":{"date-parts":[[2016,6,1]]}}}