{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:51:02Z","timestamp":1773377462358,"version":"3.50.1"},"reference-count":22,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1109\/isit.2019.8849249","type":"proceedings-article","created":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T21:46:12Z","timestamp":1569534372000},"page":"2119-2123","source":"Crossref","is-referenced-by-count":1,"title":["Private Proximity Retrieval"],"prefix":"10.1109","author":[{"given":"Tuvi","family":"Etzion","sequence":"first","affiliation":[{"name":"Department of Computer Science, Technion — Israel Institute of Technology, Haifa, 3200009, Israel"}]},{"given":"Oliver W.","family":"Gnilke","sequence":"additional","affiliation":[{"name":"Department of Mathematical Sciences, Aalborg Universitet, Denmark"}]},{"given":"David","family":"Karpuk","sequence":"additional","affiliation":[{"name":"Departamento de Matemáticas, Universidad de los Andes, Bogotá, Colombia"}]},{"given":"Eitan","family":"Yaakobi","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Technion — Israel Institute of Technology, Haifa, 3200009, Israel"}]},{"given":"Yiwei","family":"Zhang","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Technion — Israel Institute of Technology, Haifa, 3200009, Israel"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2011.55"},{"key":"ref11","article-title":"Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphs","author":"malkov","year":"2016"},{"key":"ref12","article-title":"Private function retrieval","author":"mirmohseni","year":"2017"},{"key":"ref13","article-title":"Location privacy via private proximity testing","author":"narayanan","year":"2011","journal-title":"Proc Network and Distributed System Security Symp"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/PerComW.2012.6197514"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2018.8636039"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-24858-5_11"},{"key":"ref17","article-title":"Private polynomial computation from Lagrange encoding","author":"raviv","year":"2018"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2689028"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2815607"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437511"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"1647","DOI":"10.1109\/TPAMI.2007.70815","article-title":"Effective proximity retrieval by ordering permutations","volume":"30","author":"chavez","year":"2008","journal-title":"IEEE Trans on Pattern Analysis and Machine Intelligence"},{"key":"ref6","article-title":"2-server pir with sub-polynomial communication","author":"dvir","year":"2014"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/293347.293350"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437349"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/16M1102562"},{"key":"ref2","article-title":"Private information retrieval for coded storage","author":"chan","year":"2014"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2791994"},{"key":"ref9","article-title":"Achieving maximum distance separable private information retrieval capacity with linear codes","author":"kumar","year":"2018"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2017.8277997"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/1326554.1326555"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/CloudCom.2011.43"}],"event":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","location":"Paris, France","start":{"date-parts":[[2019,7,7]]},"end":{"date-parts":[[2019,7,12]]}},"container-title":["2019 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8827389\/8849208\/08849249.pdf?arnumber=8849249","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:33:51Z","timestamp":1773347631000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8849249\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/isit.2019.8849249","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}