{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,4]],"date-time":"2025-12-04T22:09:54Z","timestamp":1764886194174,"version":"3.46.0"},"publisher-location":"Cham","reference-count":48,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032122896","type":"print"},{"value":"9783032122902","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,12,5]],"date-time":"2025-12-05T00:00:00Z","timestamp":1764892800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,5]],"date-time":"2025-12-05T00:00:00Z","timestamp":1764892800000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-12290-2_19","type":"book-chapter","created":{"date-parts":[[2025,12,4]],"date-time":"2025-12-04T22:07:04Z","timestamp":1764886024000},"page":"582-610","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Scalable Multi-server Private Information Retrieval"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2436-0230","authenticated-orcid":false,"given":"Ashrujit","family":"Ghoshal","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0003-7408-9781","authenticated-orcid":false,"given":"Baitian","family":"Li","sequence":"additional","affiliation":[]},{"given":"Yaohua","family":"Ma","sequence":"additional","affiliation":[]},{"given":"Chenxin","family":"Dai","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5605-1048","authenticated-orcid":false,"given":"Elaine","family":"Shi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,12,5]]},"reference":[{"key":"19_CR1","unstructured":"https:\/\/haveibeenpwned.com\/"},{"key":"19_CR2","unstructured":"Oblivious DNS over https. https:\/\/tools.ietf.org\/html\/draft-pauly-dprive-oblivious-doh-04"},{"key":"19_CR3","unstructured":"Technology deep dive: building a faster ORAM layer for enclaves. https:\/\/signal.org\/blog\/building-faster-oram\/"},{"key":"19_CR4","unstructured":"Beigel, R., Fortnow, L., Gasarch, W.I.: A nearly tight bound for private information retrieval protocols. In: Electronic Colloquium on Computational Complexity (ECCC) (2003)"},{"key":"19_CR5","doi-asserted-by":"publisher","unstructured":"Beimel, A., Ishai, Y., Malkin, T.: Reducing the servers\u2019 computation in private information retrieval: PIR with preprocessing. J. Cryptol. 17(2), 125\u2013151 (2004). https:\/\/doi.org\/10.1007\/s00145-004-0134-y","DOI":"10.1007\/s00145-004-0134-y"},{"issue":"3","key":"19_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3652025","volume":"71","author":"V Bhargava","year":"2024","unstructured":"Bhargava, V., Ghosh, S., Guo, Z., Kumar, M., Umans, C.: Fast multivariate multipoint evaluation over all finite fields. J. ACM 71(3), 1\u201332 (2024)","journal-title":"J. ACM"},{"key":"19_CR7","doi-asserted-by":"publisher","unstructured":"Bhargava, V., Ghosh, S., Kumar, M., Mohapatra, C.K.: Fast, algebraic multivariate multipoint evaluation in small characteristic and applications. In: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2022, pp. 403\u2013415. Association for Computing Machinery, New York (2022). https:\/\/doi.org\/10.1145\/3519935.3519968","DOI":"10.1145\/3519935.3519968"},{"key":"19_CR8","unstructured":"Boyle, E., Jain, A., Prabhakaran, M., Yu, C.H.: The bottleneck complexity of secure multiparty computation. In: 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), pp. 24\u20131. Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik (2018)"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Cachin, C., Micali, S., Stadler, M.: Computationally private information retrieval with polylogarithmic communication. In: EUROCRYPT, pp. 402\u2013414 (1999)","DOI":"10.1007\/3-540-48910-X_28"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Chang, Y.C.: Single database private information retrieval with logarithmic communication. In: ACISP (2004)","DOI":"10.1007\/978-3-540-27800-9_5"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Chor, B., Gilboa, N.: Computationally private information retrieval. In: STOC (1997)","DOI":"10.1145\/258533.258609"},{"key":"19_CR12","unstructured":"Chor, B., Goldreich, O., Kushilevitz, E., Sudan, M.: Private information retrieval. In: FOCS (1995)"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"Corrigan-Gibbs, H., Henzinger, A., Kogan, D.: Single-server private information retrieval with sublinear amortized time. In: Eurocrypt (2022)","DOI":"10.1007\/978-3-031-07085-3_1"},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"Corrigan-Gibbs, H., Kogan, D.: Private information retrieval with sublinear online time. In: EUROCRYPT (2020)","DOI":"10.1007\/978-3-030-45721-1_3"},{"issue":"4","key":"19_CR15","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1515\/popets-2018-0037","volume":"2018","author":"D Demmler","year":"2018","unstructured":"Demmler, D., Rindal, P., Rosulek, M., Trieu, N.: PIR-PSI: scaling private contact discovery. Proc. Priv. Enhancing Technol. 2018(4), 159\u2013178 (2018)","journal-title":"Proc. Priv. Enhancing Technol."},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"Dvir, Z., Gopi, S.: 2-server PIR with subpolynomial communication. J. ACM 63(4) (2016)","DOI":"10.1145\/2968443"},{"key":"19_CR17","unstructured":"Feamster, N.: Oblivious DNS deployed by Cloudflare and Apple. https:\/\/medium.com\/noise-lab\/oblivious-dns-deployed-by-cloudflare-and-apple-1522ccf53cab"},{"key":"19_CR18","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":"19_CR19","doi-asserted-by":"crossref","unstructured":"Gentry, C., Ramzan, Z.: Single-database private information retrieval with constant communication rate. In: ICALP (2005)","DOI":"10.1007\/11523468_65"},{"key":"19_CR20","doi-asserted-by":"crossref","unstructured":"Ghoshal, A., Zhou, M., Shi, E.: Efficient pre-processing PIR without public-key cryptography. In: Eurocrypt (2024)","DOI":"10.1007\/978-3-031-58751-1_8"},{"key":"19_CR21","doi-asserted-by":"crossref","unstructured":"Hasse, H.: Theorie der h\u00f6heren differentiale in einem algebraischen funktionenk\u00f6rper mit vollkommenem konstantenk\u00f6rper bei beliebiger charakteristik. Journal f\u00fcr die reine und angewandte Mathematik 175, 50\u201354 (1936). http:\/\/eudml.org\/doc\/149955","DOI":"10.1515\/crll.1936.175.50"},{"key":"19_CR22","doi-asserted-by":"crossref","unstructured":"Henzinger, A., Dauterman, E., Corrigan-Gibbs, H., , Zeldovich, N.: Private web search with Tiptoe. In: 29th ACM Symposium on Operating Systems Principles (SOSP), Koblenz, Germany (2023)","DOI":"10.1145\/3600006.3613134"},{"key":"19_CR23","unstructured":"Henzinger, A., Hong, M.M., Corrigan-Gibbs, H., Meiklejohn, S., Vaikuntanathan, V.: One server for the price of two: simple and fast single-server private information retrieval. In: Usenix Security (2023)"},{"key":"19_CR24","doi-asserted-by":"crossref","unstructured":"Hoover, A., Patel, S., Persiano, G., Yeo, K.: Plinko: single-server PIR with efficient updates via invertible PRFs. IACR Cryptol. ePrint Arch. 318 (2024)","DOI":"10.1007\/978-3-031-91095-1_1"},{"key":"19_CR25","doi-asserted-by":"crossref","unstructured":"Kedlaya, K.S., Umans, C.: Fast modular composition in any characteristic. In: 49th Annual IEEE Symposium on Foundations of Computer Science, pp. 146\u2013155 (2008)","DOI":"10.1109\/FOCS.2008.13"},{"key":"19_CR26","doi-asserted-by":"crossref","unstructured":"Kedlaya, K.S., Umans, C.: Fast polynomial factorization and modular composition. SIAM J. Comput. (2011)","DOI":"10.1137\/08073408X"},{"issue":"155\u2013176","key":"19_CR27","first-page":"1","volume":"625","author":"S Kopparty","year":"2013","unstructured":"Kopparty, S.: Some remarks on multiplicity codes. Discret. Geom. Algebraic Comb. 625(155\u2013176), 1\u20131 (2013)","journal-title":"Discret. Geom. Algebraic Comb."},{"issue":"5","key":"19_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2629416","volume":"61","author":"S Kopparty","year":"2014","unstructured":"Kopparty, S., Saraf, S., Yekhanin, S.: High-rate codes with sublinear-time decoding. J. ACM (JACM) 61(5), 1\u201320 (2014)","journal-title":"J. ACM (JACM)"},{"key":"19_CR29","unstructured":"Kushilevitz, E., Ostrovsky, R.: Replication is not needed: single database, computationally-private information retrieval. In: FOCS (1997)"},{"key":"19_CR30","unstructured":"Lazzaretti, A., Liu, Z., Fisch, B., Papamanthou, C.: Multi-server doubly efficient PIR. Cryptology ePrint Archive, Paper 2024\/829 (2024). https:\/\/eprint.iacr.org\/2024\/829"},{"key":"19_CR31","unstructured":"Lazzaretti, A., Papamanthou, C.: Single server PIR with sublinear amortized time and polylogarithmic bandwidth. Cryptology ePrint Archive, Paper 2022\/830 (2022). https:\/\/eprint.iacr.org\/2022\/830"},{"key":"19_CR32","doi-asserted-by":"crossref","unstructured":"Lazzaretti, A., Papamanthou, C.: Treepir: sublinear-time and polylog-bandwidth private information retrieval from DDH. In: CRYPTO (2023)","DOI":"10.1007\/978-3-031-38545-2_10"},{"key":"19_CR33","doi-asserted-by":"publisher","unstructured":"Lin, W., Mook, E., Wichs, D.: Doubly efficient private information retrieval and fully homomorphic RAM computation from ring LWE. In: Saha, B., Servedio, R.A. (eds.) Proceedings of the 55th Annual ACM Symposium on Theory of Computing, STOC 2023, Orlando, FL, USA, 20\u201323 June 2023, pp. 595\u2013608. ACM (2023). https:\/\/doi.org\/10.1145\/3564246.3585175","DOI":"10.1145\/3564246.3585175"},{"key":"19_CR34","doi-asserted-by":"crossref","unstructured":"Lipmaa, H.: First CPIR protocol with data-dependent computation. In: ICISC (2009)","DOI":"10.1007\/978-3-642-14423-3_14"},{"key":"19_CR35","doi-asserted-by":"crossref","unstructured":"Melchor, C.A., Crespin, B., Gaborit, P., Jolivet, V., Rousseau, P.: High-speed private information retrieval computation on GPU. In: Proceedings of the 2008 Second International Conference on Emerging Security Information, Systems and Technologies, SECURWARE 2008, pp. 263\u2013272. IEEE Computer Society, Washington, DC, USA (2008)","DOI":"10.1109\/SECURWARE.2008.55"},{"key":"19_CR36","first-page":"446","volume":"2007","author":"CA Melchor","year":"2007","unstructured":"Melchor, C.A., Gaborit, P.: A lattice-based computationally-efficient private information retrieval protocol. IACR Cryptology ePrint Archive 2007, 446 (2007)","journal-title":"IACR Cryptology ePrint Archive"},{"key":"19_CR37","doi-asserted-by":"crossref","unstructured":"Menon, S.J., Wu, D.J.: Spiral: fast, high-rate single-server PIR via FHE composition. In: IEEE S &P (2022)","DOI":"10.1109\/SP46214.2022.9833700"},{"key":"19_CR38","unstructured":"Mughees, M.H., I, S., Ren, L.: Simple and practical amortized sublinear private information retrieval. Cryptology ePrint Archive, Paper 2023\/1072 (2023)"},{"key":"19_CR39","doi-asserted-by":"crossref","unstructured":"Olumofin, F.G., Goldberg, I.: Revisiting the computational practicality of private information retrieval. In: Financial Cryptography, pp. 158\u2013172 (2011)","DOI":"10.1007\/978-3-642-27576-0_13"},{"key":"19_CR40","doi-asserted-by":"crossref","unstructured":"Ostrovsky, R., Skeith, III., W.E.: A survey of single-database private information retrieval: techniques and applications. In: PKC, pp. 393\u2013411 (2007)","DOI":"10.1007\/978-3-540-71677-8_26"},{"key":"19_CR41","doi-asserted-by":"publisher","unstructured":"Razborov, A.A., Yekhanin, S.: An $$\\omega (n^{1\/3})$$ lower bound for bilinear group based private information retrieval. In: 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), pp. 739\u2013748 (2006). https:\/\/doi.org\/10.1109\/FOCS.2006.10","DOI":"10.1109\/FOCS.2006.10"},{"key":"19_CR42","doi-asserted-by":"crossref","unstructured":"Shi, E., Aqeel, W., Chandrasekaran, B., Maggs, B.: Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time. In: CRYPTO (2021)","DOI":"10.1007\/978-3-030-84259-8_22"},{"key":"19_CR43","doi-asserted-by":"crossref","unstructured":"Singanamalla, S., et al.: Oblivious DNS over https (ODOH): a practical privacy enhancement to DNS. In: PET Symposium (2021)","DOI":"10.2478\/popets-2021-0085"},{"key":"19_CR44","doi-asserted-by":"crossref","unstructured":"Singh, J., Wei, Y., Zikas, V.: Information-theoretic multi-server private information retrieval with client preprocessing. In: TCC (2024)","DOI":"10.1007\/978-3-031-78023-3_14"},{"key":"19_CR45","unstructured":"Sion, R., Carbunar, B.: On the computational practicality of private information retrieval. In: Network and Distributed Systems Security Symposium (NDSS) (2007)"},{"key":"19_CR46","doi-asserted-by":"crossref","unstructured":"Woodruff, D.P., Yekhanin, S.: A geometric approach to information-theoretic private information retrieval. In: 20th Annual IEEE Conference on Computational Complexity (CCC 2005), 11\u201315 June 2005, San Jose, CA, USA, pp. 275\u2013284. IEEE Computer Society (2005)","DOI":"10.1109\/CCC.2005.2"},{"key":"19_CR47","doi-asserted-by":"crossref","unstructured":"Yekhanin, S., et\u00a0al.: Locally decodable codes. Found. Trends\u00ae Theor. Comput. Sci. 6(3), 139\u2013255 (2012)","DOI":"10.1561\/0400000030"},{"key":"19_CR48","doi-asserted-by":"crossref","unstructured":"Zhou, M., Lin, W.K., Tselekounis, Y., Shi, E.: Optimal single-server private information retrieval. In: EUROCRYPT (2023)","DOI":"10.1007\/978-3-031-30545-0_14"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-12290-2_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,4]],"date-time":"2025-12-04T22:07:09Z","timestamp":1764886029000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-12290-2_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,5]]},"ISBN":["9783032122896","9783032122902"],"references-count":48,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-12290-2_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,5]]},"assertion":[{"value":"5 December 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TCC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Theory of Cryptography Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Aarhus","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Denmark","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 December 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}