{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,4]],"date-time":"2026-01-04T10:44:06Z","timestamp":1767523446649,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,10,30]],"date-time":"2017-10-30T00:00:00Z","timestamp":1509321600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1718475"],"award-info":[{"award-number":["1718475"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,10,30]]},"DOI":"10.1145\/3133956.3134008","type":"proceedings-article","created":{"date-parts":[[2017,10,27]],"date-time":"2017-10-27T12:48:18Z","timestamp":1509108498000},"page":"1361-1373","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Querying for Queries"],"prefix":"10.1145","author":[{"given":"Syed Mahbub","family":"Hafiz","sequence":"first","affiliation":[{"name":"Indiana University, Bloomington, IN, USA"}]},{"given":"Ryan","family":"Henry","sequence":"additional","affiliation":[{"name":"Indiana University, Bloomington, IN, USA"}]}],"member":"320","published-online":{"date-parts":[[2017,10,30]]},"reference":[{"key":"e_1_3_2_2_1_1","series-title":"LNCS","first-page":"311","volume-title":"Proceedings of CRYPTO,1986","author":"Barrett Paul","year":"1987","unstructured":"Paul Barrett. Implementing the Rivest Shamir and Adleman public key encryption algorithm on a standard digital signal processor. In Proceedings of CRYPTO,1986, volume 263 of LNCS, pages 311--323, Santa Barbara, CA, USA (August 1987)."},{"key":"e_1_3_2_2_2_1","volume-title":"PIR array codes with optimal PIR rate. arXiv:CoRR, abs\/1607.00235 (July","author":"Blackburn Simon","year":"2016","unstructured":"Simon Blackburn and Tuvi Etzion. PIR array codes with optimal PIR rate. arXiv:CoRR, abs\/1607.00235 (July 2016)."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46803-6_12"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53018-4_19"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978429"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282975"},{"key":"e_1_3_2_2_8_1","volume-title":"Proceedings of ANTS, X (2012","volume":"1","author":"Cohn Henry","year":"2012","unstructured":"Henry Cohn and Nadia Heninger. Approximate common divisors via lattices. In Proceedings of ANTS, X (2012), volume 1, number 1 of The Open Book Series, pages 271--293, San Diego, CA, USA (July 2012)."},{"key":"e_1_3_2_2_9_1","unstructured":"Nvidia Corporation. Tesla\u211c Kepler\u2122 GPU Accelerators. http:\/\/www.nvidia.com\/content\/tesla\/pdf\/Tesla-KSeries-Overview-LR.pdf. textit(Accessed: February 16 2017)."},{"key":"e_1_3_2_2_10_1","first-page":"269","volume-title":"Proceedings of USENIX Security, 2012","author":"Devet Casey","year":"2012","unstructured":"Casey Devet, Ian Goldberg, and Nadia Heninger. Optimally robust private information retrieval. In Proceedings of USENIX Security, 2012, pages 269--283, Bellevue, WA, USA (August 2012)."},{"key":"e_1_3_2_2_11_1","unstructured":"Torbj\u00f6rn Granlund et al. GNU multiple precision arithmetic library; version 6.1.2 [computer software]. Available from: https:\/\/gmplib.org\/ (December 2016)."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282977"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2007.23"},{"key":"e_1_3_2_2_14_1","volume-title":"Available from: git:\/\/git-crysp.uwaterloo.ca\/percy (October","author":"Goldberg Ian","year":"2014","unstructured":"Ian Goldberg, Casey Devet, Wouter Lueks, Ann Yang, Paul Hendry, and Ryan Henry. Percy \/ PIR in C++; version 1.0 [computer software]. Available from: git:\/\/git-crysp.uwaterloo.ca\/percy (October 2014)."},{"key":"e_1_3_2_2_15_1","volume-title":"https:\/\/scholar.google.com\/. (Accessed","author":"Scholar Google","year":"2017","unstructured":"Google Scholar. https:\/\/scholar.google.com\/. (Accessed: February 16, 2017)."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1515\/popets-2016-0036"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14527-8_7"},{"key":"e_1_3_2_2_18_1","volume-title":"Proceedings of NDSS, 2013","author":"Henry Ryan","year":"2013","unstructured":"Ryan Henry, Yizhou Huang, and Ian Goldberg. One (block) size fits all: PIR and SPIR with variable-length records via multi-block queries. In Proceedings of NDSS, 2013, San Diego, CA, USA (February 2013)."},{"key":"e_1_3_2_2_19_1","volume-title":"https:\/\/eprint.iacr.org\/. (Accessed","author":"Print Archive IACR","year":"2017","unstructured":"IACR Cryptology ePrint Archive. https:\/\/eprint.iacr.org\/. (Accessed: February 10, 2017)."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1743546.1743558"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14527-8_5"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/0108018"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1102199.1102201"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"e_1_3_2_2_26_1","unstructured":"Victor Shoup. NTL: A library for doing number theory; version 10.5.0 [computer software]. Available from: http:\/\/www.shoup.net\/ntl (July 2017)."},{"key":"e_1_3_2_2_27_1","first-page":"299","volume-title":"Proceedings of NSDI,2017","author":"Wang Frank","year":"2017","unstructured":"Frank Wang, Catherine Yun, Shafi Goldwasser, Vinod Vaikuntanathan, and Matei Zaharia. Splinter: Practical private queries on public data. In Proceedings of NSDI,2017, pages 299--313, Boston, MA, USA (March 2017)."}],"event":{"name":"CCS '17: 2017 ACM SIGSAC Conference on Computer and Communications Security","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Dallas Texas USA","acronym":"CCS '17"},"container-title":["Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3133956.3134008","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3133956.3134008","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3133956.3134008","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:13:26Z","timestamp":1750212806000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3133956.3134008"}},"subtitle":["Indexes of Queries for Efficient and Expressive IT-PIR"],"short-title":[],"issued":{"date-parts":[[2017,10,30]]},"references-count":25,"alternative-id":["10.1145\/3133956.3134008","10.1145\/3133956"],"URL":"https:\/\/doi.org\/10.1145\/3133956.3134008","relation":{},"subject":[],"published":{"date-parts":[[2017,10,30]]},"assertion":[{"value":"2017-10-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}