{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,31]],"date-time":"2026-07-31T05:01:15Z","timestamp":1785474075127,"version":"3.56.0"},"reference-count":51,"publisher":"IEEE","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"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":[[2026,7]]},"DOI":"10.1109\/eurosp68448.2026.00021","type":"proceedings-article","created":{"date-parts":[[2026,7,30]],"date-time":"2026-07-30T19:08:01Z","timestamp":1785438481000},"page":"160-172","source":"Crossref","is-referenced-by-count":0,"title":["BiSON: Billion-Scale Oblivious Nearest-Neighbor Search in Milliseconds"],"prefix":"10.1109","author":[{"given":"Sankha","family":"Das","sequence":"first","affiliation":[{"name":"Georgia Institute of Technology","place":["Atlanta, USA"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rohan","family":"Ravi","sequence":"additional","affiliation":[{"name":"IIT Kanpur","place":["Kanpur, India"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nishanth","family":"Chandran","sequence":"additional","affiliation":[{"name":"Microsoft Research India","place":["Bangalore, India"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Divya","family":"Gupta","sequence":"additional","affiliation":[{"name":"Microsoft Research India","place":["Bangalore, India"]}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","article-title":"Azure customer stories"},{"key":"ref2","article-title":"Aws customers"},{"key":"ref3","article-title":"Google cloud customers"},{"key":"ref4","article-title":"Onedrive"},{"key":"ref5","article-title":"icloud"},{"key":"ref6","article-title":"Google drive"},{"key":"ref7","first-page":"9459","article-title":"Retrieval-augmented generation for knowledge-intensive nlp tasks","volume":"33","author":"Lewis","year":"2020","journal-title":"Advances in neural information processing systems"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14527-8_5"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1180405.1180417"},{"key":"ref10","article-title":"Seal: attack mitigation for encrypted databases via adjustable leakage","volume-title":"Proceedings of the 29th USENIX Conference on Security Symposium","author":"Demertzis"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s10619-013-7123-9"},{"key":"ref12","first-page":"1101","article-title":"{DORY}: An encrypted search system with distributed trust","volume-title":"14th USENIX Symposium on Operating Systems Design and Implementation (OSDI 20)","author":"Dauterman"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3178876.3186084"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2014.23264"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2636328"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/SECPRI.2000.848445"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3064057"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-96884-1_13"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/3366030.3366081"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/SP46214.2022.9833702"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3600006.3613134"},{"key":"ref22","article-title":"Pacmann: Efficient private approximate nearest neighbor search","author":"Zhou","year":"2024","journal-title":"Cryptology ePrint Archive"},{"key":"ref23","first-page":"2111","article-title":"{SANNS}: Scaling up secure approximate {k-Nearest} neighbors search","volume-title":"29th USENIX Security Symposium (USENIX Security 20)","author":"Chen"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2018.2889473"},{"key":"ref25","article-title":"Diskann: Fast accurate billion-point nearest neighbor search on a single node","volume":"32","author":"Jayaram Subramanya","year":"2019","journal-title":"Advances in neural information processing Systems"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.14778\/3303753.3303754"},{"key":"ref27","article-title":"Spann: highly-efficient billion-scale approximate nearest neighbor search","volume-title":"Proceedings of the 35th International Conference on Neural Information Processing Systems","author":"Chen"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/n19\u20131423"},{"key":"ref29","article-title":"Bing search"},{"key":"ref30","article-title":"Elasticsearch"},{"key":"ref31","first-page":"915","article-title":"Compass: Encrypted semantic search with high accuracy","volume-title":"19th USENIX Symposium on Operating Systems Design and Implementation (OSDI 25)","author":"Zhu"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/233551.233553"},{"key":"ref33","first-page":"415","article-title":"Constants count: Practical improvements to oblivious RAM","volume-title":"24th USENIX Security Symposium (USENIX Security 15)","author":"Ren"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45721-1_3"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/SP54263.2024.00055"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/3719027.3765190"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2011.5946540"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327494"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374452"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2014.2321376"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/361002.361007"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/SEQUEN.1997.666900"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/100216.100289"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/3177872"},{"key":"ref45","article-title":"Sift bigann dataset"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.57"},{"key":"ref47","article-title":"liburing library for io uring","author":"Axboe","year":"2022"},{"key":"ref49","article-title":"Compass repository"},{"key":"ref50","article-title":"Laion-400m: Open dataset of clip-filtered 400 million image-text pairs","author":"Schuhmann","year":"2021"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3463242"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3462804"}],"event":{"name":"2026 IEEE 11th European Symposium on Security and Privacy (EuroS&P)","location":"Lisbon, Portugal","start":{"date-parts":[[2026,7,6]]},"end":{"date-parts":[[2026,7,10]]}},"container-title":["2026 IEEE 11th European Symposium on Security and Privacy (EuroS&amp;P)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11624144\/11623655\/11624340.pdf?arnumber=11624340","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,31]],"date-time":"2026-07-31T04:53:45Z","timestamp":1785473625000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11624340\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":51,"URL":"https:\/\/doi.org\/10.1109\/eurosp68448.2026.00021","relation":{},"subject":[],"published":{"date-parts":[[2026,7]]}}}