{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,27]],"date-time":"2026-09-27T12:08:12Z","timestamp":1790510892047,"version":"4.1.0"},"publisher-location":"Cham","reference-count":56,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031305443","type":"print"},{"value":"9783031305450","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-30545-0_14","type":"book-chapter","created":{"date-parts":[[2023,4,15]],"date-time":"2023-04-15T10:02:10Z","timestamp":1681552930000},"page":"395-425","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":28,"title":["Optimal Single-Server Private Information Retrieval"],"prefix":"10.1007","author":[{"given":"Mingxun","family":"Zhou","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wei-Kai","family":"Lin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yiannis","family":"Tselekounis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Elaine","family":"Shi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,4,16]]},"reference":[{"key":"14_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/3-540-45022-X_39","volume-title":"Automata, Languages and Programming","author":"W Aiello","year":"2000","unstructured":"Aiello, W., Bhatt, S., Ostrovsky, R., Rajagopalan, S.R.: Fast verification of any remote procedure call: short witness-indistinguishable one-round proofs for NP. In: Montanari, U., Rolim, J.D.P., Welzl, E. (eds.) ICALP 2000. LNCS, vol. 1853, pp. 463\u2013474. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45022-X_39"},{"key":"14_CR2","doi-asserted-by":"publisher","unstructured":"Ajtai, M., Koml\u00f3s, J., Szemer\u00e9di, E.: An $$O(n \\text{log}\\, n)$$ sorting network. In: 15th ACM STOC, pp. 1\u20139. ACM Press, April 1983. https:\/\/doi.org\/10.1145\/800061.808726","DOI":"10.1145\/800061.808726"},{"key":"14_CR3","unstructured":"Albab, K.D., Issa, R., Varia, M., Graffi, K.: Batched differentially private information retrieval. In: Butler, K.R.B., Thomas, K. (eds.) USENIX Security 2022, pp. 3327\u20133344. USENIX Association, August 2022"},{"key":"14_CR4","doi-asserted-by":"publisher","unstructured":"Angel, S., Chen, H., Laine, K., Setty, S.T.V.: PIR with compressed queries and amortized query processing. In: 2018 IEEE Symposium on Security and Privacy, pp. 962\u2013979. IEEE Computer Society Press, May 2018. https:\/\/doi.org\/10.1109\/SP.2018.00062","DOI":"10.1109\/SP.2018.00062"},{"key":"14_CR5","unstructured":"Bartusek, J., Khurana, D.: Cryptography with certified deletion. Cryptology ePrint Archive, Report 2022\/1178 (2022). https:\/\/eprint.iacr.org\/2022\/1178"},{"key":"14_CR6","doi-asserted-by":"publisher","unstructured":"Batcher, K.E.: Sorting networks and their applications. In: AFIPS (1968). https:\/\/doi.org\/10.1145\/1468075.1468121","DOI":"10.1145\/1468075.1468121"},{"key":"14_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/3-540-44598-6_4","volume-title":"Advances in Cryptology \u2014 CRYPTO 2000","author":"A Beimel","year":"2000","unstructured":"Beimel, A., Ishai, Y., Malkin, T.: Reducing the servers computation in private information retrieval: PIR with preprocessing. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 55\u201373. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44598-6_4"},{"key":"14_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/BFb0057658","volume-title":"Mobile Agents","author":"I Biehl","year":"1998","unstructured":"Biehl, I., Meyer, B., Wetzel, S.: Ensuring the integrity of agent-based computations by short proofs. In: Rothermel, K., Hohl, F. (eds.) MA 1998. LNCS, vol. 1477, pp. 183\u2013194. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0057658"},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/978-3-319-56620-7_15","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"D Boneh","year":"2017","unstructured":"Boneh, D., Kim, S., Montgomery, H.: Private puncturable PRFs from standard lattice assumptions. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017. LNCS, vol. 10210, pp. 415\u2013445. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56620-7_15"},{"key":"14_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1007\/978-3-662-54388-7_17","volume-title":"Public-Key Cryptography \u2013 PKC 2017","author":"D Boneh","year":"2017","unstructured":"Boneh, D., Lewi, K., Wu, D.J.: Constraining pseudorandom functions privately. In: Fehr, S. (ed.) PKC 2017. LNCS, vol. 10175, pp. 494\u2013524. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54388-7_17"},{"key":"14_CR11","doi-asserted-by":"publisher","unstructured":"Boyle, E., Gilboa, N., Ishai, Y.: Function secret sharing: improvements and extensions. In: Weippl, E.R., Katzenbeisser, S., Kruegel, C., Myers, A.C., Halevi, S. (eds.) ACM CCS 2016, pp. 1292\u20131303. ACM Press, October 2016. https:\/\/doi.org\/10.1145\/2976749.2978429","DOI":"10.1145\/2976749.2978429"},{"key":"14_CR12","doi-asserted-by":"publisher","unstructured":"Boyle, E., Gilboa, N., Ishai, Y., Kolobov, V.I.: Programmable distributed point functions. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022, Part IV. LNCS, vol. 13510, pp. 121\u2013151. Springer, Heidelberg, August 2022. https:\/\/doi.org\/10.1007\/978-3-031-15985-5_5","DOI":"10.1007\/978-3-031-15985-5_5"},{"key":"14_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1007\/978-3-319-70503-3_22","volume-title":"Theory of Cryptography","author":"E Boyle","year":"2017","unstructured":"Boyle, E., Ishai, Y., Pass, R., Wootters, M.: Can we access a database both locally and privately? In: Kalai, Y., Reyzin, L. (eds.) TCC 2017. LNCS, vol. 10678, pp. 662\u2013693. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70503-3_22"},{"key":"14_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/978-3-319-70500-2_10","volume-title":"Theory of Cryptography","author":"Z Brakerski","year":"2017","unstructured":"Brakerski, Z., Tsabary, R., Vaikuntanathan, V., Wee, H.: Private constrained PRFs (and more) from LWE. In: Kalai, Y., Reyzin, L. (eds.) TCC 2017. LNCS, vol. 10677, pp. 264\u2013302. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70500-2_10"},{"key":"14_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1007\/3-540-48910-X_28","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201999","author":"C Cachin","year":"1999","unstructured":"Cachin, C., Micali, S., Stadler, M.: Computationally private information retrieval with polylogarithmic communication. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 402\u2013414. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48910-X_28"},{"key":"14_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1007\/978-3-319-56620-7_16","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"R Canetti","year":"2017","unstructured":"Canetti, R., Chen, Y.: Constraint-hiding constrained PRFs for NC$$^1$$ from LWE. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017. LNCS, vol. 10210, pp. 446\u2013476. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56620-7_16"},{"key":"14_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"694","DOI":"10.1007\/978-3-319-70503-3_23","volume-title":"Theory of Cryptography","author":"R Canetti","year":"2017","unstructured":"Canetti, R., Holmgren, J., Richelson, S.: Towards doubly efficient private information retrieval. In: Kalai, Y., Reyzin, L. (eds.) TCC 2017. LNCS, vol. 10678, pp. 694\u2013726. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70503-3_23"},{"key":"14_CR18","doi-asserted-by":"publisher","unstructured":"de Castro, L., Polychroniadou, A.: Lightweight, maliciously secure verifiable function secret sharing. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT 2022, Part I. LNCS, vol. 13275, pp. 150\u2013179. Springer, Heidelberg, May\/June 2022. https:\/\/doi.org\/10.1007\/978-3-031-06944-4_6","DOI":"10.1007\/978-3-031-06944-4_6"},{"key":"14_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/978-3-540-27800-9_5","volume-title":"Information Security and Privacy","author":"Y-C Chang","year":"2004","unstructured":"Chang, Y.-C.: Single database private information retrieval with logarithmic communication. In: Wang, H., Pieprzyk, J., Varadharajan, V. (eds.) ACISP 2004. LNCS, vol. 3108, pp. 50\u201361. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-27800-9_5"},{"key":"14_CR20","doi-asserted-by":"publisher","unstructured":"Chor, B., Gilboa, N.: Computationally private information retrieval (extended abstract). In: 29th ACM STOC, pp. 304\u2013313. ACM Press, May 1997. https:\/\/doi.org\/10.1145\/258533.258609","DOI":"10.1145\/258533.258609"},{"key":"14_CR21","doi-asserted-by":"publisher","unstructured":"Chor, B., Goldreich, O., Kushilevitz, E., Sudan, M.: Private information retrieval. In: 36th FOCS, pp. 41\u201350. IEEE Computer Society Press, October 1995. https:\/\/doi.org\/10.1109\/SFCS.1995.492461","DOI":"10.1109\/SFCS.1995.492461"},{"issue":"6","key":"14_CR22","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1145\/293347.293350","volume":"45","author":"B Chor","year":"1998","unstructured":"Chor, B., Kushilevitz, E., Goldreich, O., Sudan, M.: Private information retrieval. J. ACM 45(6), 965\u2013981 (1998). https:\/\/doi.org\/10.1145\/293347.293350","journal-title":"J. ACM"},{"key":"14_CR23","doi-asserted-by":"publisher","unstructured":"Corrigan-Gibbs, H., Henzinger, A., Kogan, D.: Single-server private information retrieval with sublinear amortized time. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT 2022, Part II. LNCS, vol. 13276, pp. 3\u201333. Springer, Heidelberg, May\/June 2022. https:\/\/doi.org\/10.1007\/978-3-031-07085-3_1","DOI":"10.1007\/978-3-031-07085-3_1"},{"key":"14_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/978-3-030-45721-1_3","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"H Corrigan-Gibbs","year":"2020","unstructured":"Corrigan-Gibbs, H., Kogan, D.: Private information retrieval with sublinear online time. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12105, pp. 44\u201375. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_3"},{"key":"14_CR25","doi-asserted-by":"publisher","unstructured":"Demmler, D., Herzberg, A., Schneider, T.: Raid-pir: practical multi-server pir. In: CCSW (2014). https:\/\/doi.org\/10.1145\/2664168.2664181","DOI":"10.1145\/2664168.2664181"},{"key":"14_CR26","doi-asserted-by":"publisher","unstructured":"Di Crescenzo, G., Ishai, Y., Ostrovsky, R.: Universal service-providers for database private information retrieval (extended abstract). In: Coan, B.A., Afek, Y. (eds.) 17th ACM PODC, pp. 91\u2013100. ACM, June\/July 1998. https:\/\/doi.org\/10.1145\/277697.277713","DOI":"10.1145\/277697.277713"},{"key":"14_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-662-53015-3_4","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"Y Dodis","year":"2016","unstructured":"Dodis, Y., Halevi, S., Rothblum, R.D., Wichs, D.: Spooky encryption and its applications. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9816, pp. 93\u2013122. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53015-3_4"},{"key":"14_CR28","doi-asserted-by":"publisher","unstructured":"Dvir, Z., Gopi, S.: 2-server pir with subpolynomial communication. J. ACM 63(4) (2016). https:\/\/doi.org\/10.1145\/2968443","DOI":"10.1145\/2968443"},{"key":"14_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-662-53015-3_5","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"C Dwork","year":"2016","unstructured":"Dwork, C., Naor, M., Rothblum, G.N.: Spooky interaction and its discontents: compilers for succinct two-message argument systems. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9816, pp. 123\u2013145. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53015-3_5"},{"key":"14_CR30","first-page":"72","volume":"82","author":"WI Gasarch","year":"2004","unstructured":"Gasarch, W.I.: A survey on private information retrieval. Bull. EATCS 82, 72\u2013107 (2004)","journal-title":"Bull. EATCS"},{"key":"14_CR31","doi-asserted-by":"publisher","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Mitzenmacher, M. (ed.) 41st ACM STOC, pp. 169\u2013178. ACM Press, May\/June 2009. https:\/\/doi.org\/10.1145\/1536414.1536440","DOI":"10.1145\/1536414.1536440"},{"key":"14_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1007\/11523468_65","volume-title":"Automata, Languages and Programming","author":"C Gentry","year":"2005","unstructured":"Gentry, C., Ramzan, Z.: Single-database private information retrieval with constant communication rate. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 803\u2013815. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11523468_65"},{"key":"14_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/978-3-642-40041-4_5","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"C Gentry","year":"2013","unstructured":"Gentry, C., Sahai, A., Waters, B.: Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8042, pp. 75\u201392. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40041-4_5"},{"key":"14_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1007\/978-3-642-55220-5_35","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2014","author":"N Gilboa","year":"2014","unstructured":"Gilboa, N., Ishai, Y.: Distributed point functions and their applications. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 640\u2013658. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-55220-5_35"},{"key":"14_CR35","doi-asserted-by":"publisher","unstructured":"Hafiz, S.M., Henry, R.: Querying for queries: indexes of queries for efficient and expressive IT-PIR. In: Thuraisingham, B.M., Evans, D., Malkin, T., Xu, D. (eds.) ACM CCS 2017, pp. 1361\u20131373. ACM Press, October\/November 2017. https:\/\/doi.org\/10.1145\/3133956.3134008","DOI":"10.1145\/3133956.3134008"},{"key":"14_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/978-3-030-17656-3_9","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"A Hamlin","year":"2019","unstructured":"Hamlin, A., Ostrovsky, R., Weiss, M., Wichs, D.: Private anonymous data access. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11477, pp. 244\u2013273. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17656-3_9"},{"issue":"4","key":"14_CR37","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1515\/popets-2016-0036","volume":"2016","author":"R Henry","year":"2016","unstructured":"Henry, R.: Polynomial batch codes for efficient IT-PIR. PoPETs 2016(4), 202\u2013218 (2016). https:\/\/doi.org\/10.1515\/popets-2016-0036","journal-title":"PoPETs"},{"key":"14_CR38","doi-asserted-by":"publisher","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Batch codes and their applications. In: Babai, L. (ed.) 36th ACM STOC, pp. 262\u2013271. ACM Press, June 2004. https:\/\/doi.org\/10.1145\/1007352.1007396","DOI":"10.1145\/1007352.1007396"},{"key":"14_CR39","doi-asserted-by":"publisher","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Cryptography from anonymity. In: 47th FOCS, pp. 239\u2013248. IEEE Computer Society Press, October 2006. https:\/\/doi.org\/10.1109\/FOCS.2006.25","DOI":"10.1109\/FOCS.2006.25"},{"key":"14_CR40","doi-asserted-by":"publisher","unstructured":"Kalai, Y.T., Raz, R., Rothblum, R.D.: Delegation for bounded space. In: Boneh, D., Roughgarden, T., Feigenbaum, J. (eds.) 45th ACM STOC, pp. 565\u2013574. ACM Press, June 2013. https:\/\/doi.org\/10.1145\/2488608.2488679","DOI":"10.1145\/2488608.2488679"},{"issue":"3","key":"14_CR41","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00145-021-09391-2","volume":"34","author":"S Kim","year":"2021","unstructured":"Kim, S., Wu, D.J.: Watermarking cryptographic functionalities from standard lattice assumptions. J. Cryptol. 34(3), 1\u201376 (2021). https:\/\/doi.org\/10.1007\/s00145-021-09391-2","journal-title":"J. Cryptol."},{"key":"14_CR42","unstructured":"Kogan, D., Corrigan-Gibbs, H.: Private blocklist lookups with checklist. In: Bailey, M., Greenstadt, R. (eds.) USENIX Security 2021, pp. 875\u2013892. USENIX Association, August 2021"},{"key":"14_CR43","doi-asserted-by":"publisher","unstructured":"Kushilevitz, E., Ostrovsky, R.: Replication is NOT needed: SINGLE database, computationally-private information retrieval. In: 38th FOCS, pp. 364\u2013373. IEEE Computer Society Press, October 1997. https:\/\/doi.org\/10.1109\/SFCS.1997.646125","DOI":"10.1109\/SFCS.1997.646125"},{"key":"14_CR44","unstructured":"Lazzaretti, A., Papamanthou, C.: Single server PIR with sublinear amortized time and polylogarithmic bandwidth. Cryptology ePrint Archive, Report 2022\/830 (2022). https:\/\/eprint.iacr.org\/2022\/830"},{"key":"14_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/978-3-642-14423-3_14","volume-title":"Information, Security and Cryptology \u2013 ICISC 2009","author":"H Lipmaa","year":"2010","unstructured":"Lipmaa, H.: First CPIR protocol with data-dependent computation. In: Lee, D., Hong, S. (eds.) ICISC 2009. LNCS, vol. 5984, pp. 193\u2013210. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14423-3_14"},{"key":"14_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/978-3-662-47854-7_10","volume-title":"Financial Cryptography and Data Security","author":"W Lueks","year":"2015","unstructured":"Lueks, W., Goldberg, I.: Sublinear scaling for multi-client private information retrieval. In: B\u00f6hme, R., Okamoto, T. (eds.) FC 2015. LNCS, vol. 8975, pp. 168\u2013186. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47854-7_10"},{"key":"14_CR47","doi-asserted-by":"publisher","unstructured":"Menon, S.J., Wu, D.J.: SPIRAL: fast, high-rate single-server PIR via FHE composition. In: 2022 IEEE Symposium on Security and Privacy, pp. 930\u2013947. IEEE Computer Society Press, May 2022. https:\/\/doi.org\/10.1109\/SP46214.2022.9833700","DOI":"10.1109\/SP46214.2022.9833700"},{"key":"14_CR48","doi-asserted-by":"publisher","unstructured":"Mughees, M.H., Chen, H., Ren, L.: OnionPIR: response efficient single-server PIR. In: Vigna, G., Shi, E. (eds.) ACM CCS 2021, pp. 2292\u20132306. ACM Press, November 2021. https:\/\/doi.org\/10.1145\/3460120.3485381","DOI":"10.1145\/3460120.3485381"},{"key":"14_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/978-3-540-71677-8_26","volume-title":"Public Key Cryptography \u2013 PKC 2007","author":"R Ostrovsky","year":"2007","unstructured":"Ostrovsky, R., Skeith, W.E.: A survey of single-database private information retrieval: techniques and applications. In: Okamoto, T., Wang, X. (eds.) PKC 2007. LNCS, vol. 4450, pp. 393\u2013411. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-71677-8_26"},{"key":"14_CR50","doi-asserted-by":"publisher","unstructured":"Patel, S., Persiano, G., Yeo, K.: Private stateful information retrieval. In: Lie, D., Mannan, M., Backes, M., Wang, X. (eds.) ACM CCS 2018, pp. 1002\u20131019. ACM Press, October 2018. https:\/\/doi.org\/10.1145\/3243734.3243821","DOI":"10.1145\/3243734.3243821"},{"key":"14_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1007\/978-3-319-76581-5_23","volume-title":"Public-Key Cryptography \u2013 PKC 2018","author":"C Peikert","year":"2018","unstructured":"Peikert, C., Shiehian, S.: Privately constraining and programming PRFs, the LWE way. In: Abdalla, M., Dahab, R. (eds.) PKC 2018. LNCS, vol. 10770, pp. 675\u2013701. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-76581-5_23"},{"key":"14_CR52","doi-asserted-by":"publisher","unstructured":"Persiano, G., Yeo, K.: Limits of preprocessing for single-server PIR. In: SODA, pp. 2522\u20132548. SIAM (2022). https:\/\/doi.org\/10.1137\/1.9781611977073.99","DOI":"10.1137\/1.9781611977073.99"},{"key":"14_CR53","doi-asserted-by":"publisher","unstructured":"Pudl\u00e1k, P., R\u00f6dl, V.: Modified ranks of tensors and the size of circuits. In: 25th ACM STOC, pp. 523\u2013531. ACM Press, May 1993. https:\/\/doi.org\/10.1145\/167088.167228","DOI":"10.1145\/167088.167228"},{"key":"14_CR54","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1007\/978-3-030-84259-8_22","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"E Shi","year":"2021","unstructured":"Shi, E., Aqeel, W., Chandrasekaran, B., Maggs, B.: Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12828, pp. 641\u2013669. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84259-8_22"},{"key":"14_CR55","doi-asserted-by":"publisher","DOI":"10.1515\/popets-2016-0035","author":"RR Toledo","year":"2016","unstructured":"Toledo, R.R., Danezis, G., Goldberg, I.: Lower-cost $$\\epsilon $$-private information retrieval. PETS (2016). https:\/\/doi.org\/10.1515\/popets-2016-0035","journal-title":"PETS"},{"key":"14_CR56","unstructured":"Zhou, M., Lin, W.K., Tselekounis, Y., Shi, E.: Optimal single-server private information retrieval. Cryptology ePrint Archive, Paper 2022\/609 (2022). https:\/\/eprint.iacr.org\/2022\/609"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-30545-0_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,15]],"date-time":"2025-04-15T22:03:53Z","timestamp":1744754633000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-30545-0_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031305443","9783031305450"],"references-count":56,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-30545-0_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"16 April 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUROCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lyon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 April 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 April 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"42","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"415","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"109","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"16","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}