{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T10:09:22Z","timestamp":1779358162782,"version":"3.51.4"},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T00:00:00Z","timestamp":1779321600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T00:00:00Z","timestamp":1779321600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Strategic Priority Research Program of Chinese Academy of Sciences","award":["XDB0690200"],"award-info":[{"award-number":["XDB0690200"]}]},{"name":"National Key Research and Development Program of China","award":["2023YFB4503203"],"award-info":[{"award-number":["2023YFB4503203"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62372447"],"award-info":[{"award-number":["62372447"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cybersecurity"],"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    Toward practical and client-friendly single-server private information retrieval, we introduce FlashPIR, a scheme achieving both low client overhead and high server throughput. Constructed based on fully homomorphic encryption, our protocol possesses two distinct advantages: First, a majority of the resource-intensive computations can be performed in an offline phase, prior to query reception, significantly reducing the online response time. Second, database updates operate independently of clients, with low client computational overhead remaining nearly constant regardless of the database scale. We conducted comprehensive experiments to evaluate the performance of FlashPIR. The results demonstrate that for database sizes of 256 MB, our scheme achieves a throughput\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$2.6\\times$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mrow>\n                            <mml:mn>2.6<\/mml:mn>\n                            <mml:mo>\u00d7<\/mml:mo>\n                          <\/mml:mrow>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    greater than KsPIR (Luo et al., CCS 2024) and\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$18.5\\times$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mrow>\n                            <mml:mn>18.5<\/mml:mn>\n                            <mml:mo>\u00d7<\/mml:mo>\n                          <\/mml:mrow>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    greater than Spiral (Menon and Wu, S&amp;P 2022).\n                  <\/jats:p>","DOI":"10.1186\/s42400-026-00601-7","type":"journal-article","created":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T09:33:58Z","timestamp":1779356038000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["FlashPIR: low-latency FHE-based single-server PIR with low client overhead"],"prefix":"10.1186","volume":"9","author":[{"given":"Yiran","family":"Dai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Binwu","family":"Xiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lang","family":"Qin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5948-0780","authenticated-orcid":false,"given":"Yi","family":"Deng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiang","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,5,21]]},"reference":[{"key":"601_CR1","unstructured":"Ahmad I, Yang Y, Agrawal D, Abbadi AE, Gupta T (2021) Addra: Metadata-private voice communication over fully untrusted infrastructure. In: Proc. 15th USENIX Symp. Oper. Syst. Des. Implement. (OSDI). USENIX Association, Berkeley, CA, USA. https:\/\/www.usenix.org\/conference\/osdi21\/presentation\/ahmad"},{"key":"601_CR2","unstructured":"Ali A, Lepoint T, Patel S, Raykova M, Schoppmann P, Seth K, Yeo K (2021) Communication-computation trade-offs in PIR. In: Proc. 30th USENIX Secur. Symp., pp. 1811\u20131828. USENIX Association, Berkeley, CA, USA. https:\/\/www.usenix.org\/conference\/usenixsecurity21\/presentation\/ali"},{"key":"601_CR3","doi-asserted-by":"publisher","unstructured":"Angel S, Chen H, Laine K, Setty (2018) STV.: PIR with compressed queries and amortized query processing. In: Proc. IEEE Symp. Secur. Priv. (SP), pp. 962\u2013979. IEEE Comput. Soc., Washington, DC, USA .https:\/\/doi.org\/10.1109\/SP.2018.00062","DOI":"10.1109\/SP.2018.00062"},{"key":"601_CR4","doi-asserted-by":"publisher","unstructured":"Bae Y, Cheon JH, Hanrot G, Park JH, Stehl\u00e9 D (2024) Plaintext-ciphertext matrix multiplication and FHE bootstrapping: Fast and fused. In: Adv. Cryptol. - CRYPTO 2024, Part III. Lect. Notes Comput. Sci., vol. 14922, pp. 387\u2013421. Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-031-68382-4_12","DOI":"10.1007\/978-3-031-68382-4_12"},{"key":"601_CR5","doi-asserted-by":"publisher","unstructured":"Boemer F, Kim S, Seifu G, Souza FDM, Gopal V (2021) Intel HEXL: accelerating homomorphic encryption with intel AVX512-IFMA52. In: Proc 9th Workshop Encrypt Comput Appl Homomorph Cryptogr (WAHC), pp. 57\u201362. ACM, New York, NY, USA.https:\/\/doi.org\/10.1145\/3474366.3486926","DOI":"10.1145\/3474366.3486926"},{"key":"601_CR6","doi-asserted-by":"publisher","unstructured":"Brakerski Z, Gentry C, Vaikuntanathan V (2012) (leveled) fully homomorphic encryption without bootstrapping. In: Proc. Innov. Theor. Comput. Sci. (ITCS), pp. 309\u2013325. ACM, New York, NY, USA. https:\/\/doi.org\/10.1145\/2090236.2090262","DOI":"10.1145\/2090236.2090262"},{"key":"601_CR7","doi-asserted-by":"publisher","unstructured":"Brakerski Z, Vaikuntanathan V (2011) Efficient fully homomorphic encryption from (standard) LWE. In: Proc 52nd Annu IEEE Symp Found Comput Sci (FOCS), pp. 97\u2013106. IEEE Comput. Soc., Washington, DC, USA.https:\/\/doi.org\/10.1109\/FOCS.2011.12","DOI":"10.1109\/FOCS.2011.12"},{"key":"601_CR8","doi-asserted-by":"publisher","unstructured":"Brakerski Z, Vaikuntanathan V (2014) Lattice-based FHE as secure as PKE. In: Naor, M. (ed.) Innovations in Theoretical Computer Science, ITCS\u201914, Princeton, NJ, USA, January 12-14, 2014, pp. 1\u201312. ACM, New York, NY, USA. https:\/\/doi.org\/10.1145\/2554797.2554799","DOI":"10.1145\/2554797.2554799"},{"key":"601_CR9","doi-asserted-by":"publisher","unstructured":"Burton A, Menon SJ, Wu DJ (2024) Respire: High-rate PIR for databases with small records. In: Luo, B., Liao, X., Xu, J., Kirda, E., Lie, D. (eds.) Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security, CCS 2024, Salt Lake City, UT, USA, October 14-18, 2024, pp. 1463\u20131477. ACM, New York, NY, USA.https:\/\/doi.org\/10.1145\/3658644.3690328","DOI":"10.1145\/3658644.3690328"},{"key":"601_CR10","doi-asserted-by":"publisher","unstructured":"Cachin C, Micali S, Stadler M (1999) Computationally private information retrieval with polylogarithmic communication. In: Adv. Cryptol. - EUROCRYPT 1999. Lect. Notes Comput. Sci., vol. 1592, pp. 402\u2013414. Springer, Berlin, Heidelberg . https:\/\/doi.org\/10.1007\/3-540-48910-X_28","DOI":"10.1007\/3-540-48910-X_28"},{"key":"601_CR11","unstructured":"Castro L, Lewi K, Suh E (2024) Whispir: Stateless private information retrieval with low communication. IACR Cryptol. ePrint Arch., 266"},{"key":"601_CR12","doi-asserted-by":"publisher","unstructured":"Chang Y-C (2004) Single database private information retrieval with logarithmic communication. In: Inf. Secur. Priv. - ACISP 2004. Lect. Notes Comput. Sci., vol. 3108, pp. 50\u201361. Springer, Berlin, Heidelberg .https:\/\/doi.org\/10.1007\/978-3-540-27800-9_5","DOI":"10.1007\/978-3-540-27800-9_5"},{"key":"601_CR13","doi-asserted-by":"publisher","unstructured":"Chen H, Chillotti I, Ren L (2019) Onion ring ORAM: efficient constant bandwidth oblivious RAM from (leveled) TFHE. In: Proc ACM SIGSAC Conf Comput Commun Secur. (CCS), pp. 345\u2013360. ACM, New York, NY, USA. https:\/\/doi.org\/10.1145\/3319535.3354226","DOI":"10.1145\/3319535.3354226"},{"key":"601_CR14","doi-asserted-by":"publisher","unstructured":"Chen H, Dai W, Kim M, Song Y (2021) Efficient homomorphic conversion between (ring) LWE ciphertexts. In: Appl. Cryptogr. Netw. Secur. - ACNS 2021, Part I. Lect. Notes Comput. Sci., vol. 12726, pp. 460\u2013479. Springer, Cham.https:\/\/doi.org\/10.1007\/978-3-030-78372-3_18","DOI":"10.1007\/978-3-030-78372-3_18"},{"key":"601_CR15","unstructured":"Chen Y, Ren L (2025) OnionPIRv2: Efficient Single-Server PIR. Cryptology ePrint Archive, Paper 2025\/1142 . https:\/\/eprint.iacr.org\/2025\/1142"},{"issue":"1","key":"601_CR16","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/s00145-019-09319-x","volume":"33","author":"I Chillotti","year":"2020","unstructured":"Chillotti I, Gama N, Georgieva M, Izabach\u00e8ne M (2020) TFHE: fast fully homomorphic encryption over the torus. J Cryptol 33(1):34\u201391. https:\/\/doi.org\/10.1007\/s00145-019-09319-x","journal-title":"J Cryptol"},{"key":"601_CR17","doi-asserted-by":"publisher","unstructured":"Chillotti I, Gama N, Georgieva M, Izabach\u00e8ne M (2016) Faster fully homomorphic encryption: Bootstrapping in less than 0.1 seconds. In: Adv. Cryptol. - ASIACRYPT 2016, Part I. Lect. Notes Comput. Sci., vol. 10031, pp. 3\u201333. https:\/\/doi.org\/10.1007\/978-3-662-53887-6_1","DOI":"10.1007\/978-3-662-53887-6_1"},{"key":"601_CR18","doi-asserted-by":"publisher","unstructured":"Chor B, Goldreich O, Kushilevitz E, Sudan M (1995) Private information retrieval. In: Proc. 36th Annu. IEEE Symp. Found. Comput. Sci. (FOCS), pp. 41\u201350. IEEE Comput. Soc., Washington, DC, USA. https:\/\/doi.org\/10.1109\/SFCS.1995.492461","DOI":"10.1109\/SFCS.1995.492461"},{"key":"601_CR19","doi-asserted-by":"publisher","unstructured":"Chor B, Goldreich O, Kushilevitz E, Sudan M (1995) Private information retrieval. In: Proc. 36th Annu. IEEE Symp. Found. Comput. Sci. (FOCS), pp. 41\u201350. IEEE Comput. Soc., Washington, DC, USA. https:\/\/doi.org\/10.1109\/SFCS.1995.492461","DOI":"10.1109\/SFCS.1995.492461"},{"key":"601_CR20","doi-asserted-by":"publisher","unstructured":"Corrigan-Gibbs H, Henzinger A, Kogan D (2022) Single-server private information retrieval with sublinear amortized time. In: Adv. Cryptol. - EUROCRYPT 2022, Part II. Lect. Notes Comput. Sci., vol. 13276, pp. 3\u201333. Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-031-07085-3_1","DOI":"10.1007\/978-3-031-07085-3_1"},{"key":"601_CR21","doi-asserted-by":"publisher","unstructured":"Corrigan-Gibbs H, Kogan D (2020) Private information retrieval with sublinear online time. In: Adv. Cryptol. - EUROCRYPT 2020, Part I. Lect. Notes Comput. Sci., vol. 12105, pp. 44\u201375. Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-030-45721-1_3","DOI":"10.1007\/978-3-030-45721-1_3"},{"key":"601_CR22","doi-asserted-by":"crossref","unstructured":"Davidson A, Pestana G, Celi S (2023) Frodopir: Simple, scalable, single-server private information retrieval. Proc Priv Enhancing Technol. 2023(1), 365\u2013383. https:\/\/doi.org\/10.56553\/popets-2023-0022","DOI":"10.56553\/popets-2023-0022"},{"issue":"4","key":"601_CR23","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1145\/2968443","volume":"63","author":"Z Dvir","year":"2016","unstructured":"Dvir Z, Gopi S (2016) 2-server PIR with subpolynomial communication. J ACM 63(4):39\u201313915. https:\/\/doi.org\/10.1145\/2968443","journal-title":"J ACM"},{"key":"601_CR24","doi-asserted-by":"publisher","unstructured":"Genise N, Micciancio D (2018) Faster gaussian sampling for trapdoor lattices with arbitrary modulus. In: Nielsen, J.B., Rijmen, V. (eds.) Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29 - May 3, 2018 Proceedings, Part I. Lecture Notes in Computer Science, pp. 174\u2013203. Springer, Cham . https:\/\/doi.org\/10.1007\/978-3-319-78381-9_7","DOI":"10.1007\/978-3-319-78381-9_7"},{"key":"601_CR25","doi-asserted-by":"crossref","unstructured":"Gentry C (2009) A fully homomorphic encryption scheme. PhD thesis, Stanford University https:\/\/searchworks.stanford.edu\/view\/8493082","DOI":"10.1145\/1536414.1536440"},{"key":"601_CR26","doi-asserted-by":"publisher","unstructured":"Gentry C, Halevi S (2019) Compressible FHE with applications to PIR. In: Theory Cryptogr. - TCC 2019, Part II. Lect. Notes Comput. Sci., vol. 11892, pp. 438\u2013464. Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-030-36033-7_17","DOI":"10.1007\/978-3-030-36033-7_17"},{"key":"601_CR27","doi-asserted-by":"publisher","unstructured":"Gentry C, Ramzan Z (2005) Single-database private information retrieval with constant communication rate. In: Autom. Lang. Program. - ICALP 2005. Lect. Notes Comput. Sci., vol. 3580, pp. 803\u2013815. Springer, Berlin, Heidelberg .https:\/\/doi.org\/10.1007\/11523468_65","DOI":"10.1007\/11523468_65"},{"key":"601_CR28","doi-asserted-by":"publisher","unstructured":"Halevi S, Shoup V (2014) Algorithms in HElib. In: Adv. Cryptol. - CRYPTO 2014, Part I. Lect. Notes Comput. Sci., vol. 8616, pp. 554\u2013571. Springer, Cham.https:\/\/doi.org\/10.1007\/978-3-662-44371-2_31","DOI":"10.1007\/978-3-662-44371-2_31"},{"key":"601_CR29","doi-asserted-by":"publisher","unstructured":"Halevi S, Shoup V (2015) Bootstrapping for HElib. In: Adv. Cryptol. - EUROCRYPT 2015, Part I. Lect. Notes Comput. Sci., vol. 9056, pp. 641\u2013670. Springer, Cham.https:\/\/doi.org\/10.1007\/978-3-662-46800-5_25","DOI":"10.1007\/978-3-662-46800-5_25"},{"key":"601_CR30","doi-asserted-by":"publisher","unstructured":"Halevi S, Shoup V (2018) Faster homomorphic linear transformations in HElib. In: Adv. Cryptol. - CRYPTO 2018, Part I. Lect. Notes Comput. Sci., vol. 10991, pp. 93\u2013120. Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-319-96884-1_4","DOI":"10.1007\/978-3-319-96884-1_4"},{"key":"601_CR31","unstructured":"Henzinger A, Hong MM, Corrigan-Gibbs H, Meiklejohn S, Vaikuntanathan V (2023) One server for the price of two: Simple and fast single-server private information retrieval. In: Proc. 32nd USENIX Secur. Symp., pp. 3889\u20133905. USENIX Association, Berkeley, CA, USA"},{"key":"601_CR32","unstructured":"Kang J, Schild L (2025) Pirouette: Query efficient single-server PIR. IACR Cryptol. ePrint Arch., 680"},{"key":"601_CR33","unstructured":"Kim A, Lee Y, Deryabin M, Eom J, Choi R (2023) LFHE: fully homomorphic encryption with bootstrapping key size less than a megabyte. IACR Cryptol. ePrint Arch., 767"},{"key":"601_CR34","unstructured":"Kogan D, Corrigan-Gibbs H (2021) Private blocklist lookups with checklist. In: Proc. 30th USENIX Secur. Symp., pp. 875\u2013892. USENIX Association, Berkeley, CA, USA . https:\/\/www.usenix.org\/conference\/usenixsecurity21\/presentation\/kogan"},{"key":"601_CR35","doi-asserted-by":"publisher","unstructured":"Kushilevitz E, Ostrovsky R (1997) Replication is NOT needed: SINGLE database, computationally-private information retrieval. In: Proc. 38th Annu. IEEE Symp. Found. Comput. Sci. (FOCS), pp. 364\u2013373. IEEE Comput. Soc., Washington, DC, USA .https:\/\/doi.org\/10.1109\/SFCS.1997.646125","DOI":"10.1109\/SFCS.1997.646125"},{"key":"601_CR36","doi-asserted-by":"publisher","unstructured":"Li B, Micciancio D, Raykova M, Schultz M (2024) Hintless single-server private information retrieval. In: Adv. Cryptol. - CRYPTO 2024, Part IX. Lect. Notes Comput. Sci., vol. 14928, pp. 183\u2013217. Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-031-68400-5_6","DOI":"10.1007\/978-3-031-68400-5_6"},{"key":"601_CR37","doi-asserted-by":"crossref","unstructured":"Lin Y, Tian H (2025) Efficient updatable private information retrieval from simulatable homomorphic ciphertexts. In: Proceedings of the 20th ACM Asia Conference on Computer and Communications Security, pp. 45\u201357","DOI":"10.1145\/3708821.3733871"},{"key":"601_CR38","doi-asserted-by":"publisher","unstructured":"Lu W-j, Huang Z, Hong C, Ma Y, Qu H (2021) PEGASUS: bridging polynomial and non-polynomial evaluations in homomorphic encryption. In: Proc. IEEE Symp. Secur. Priv. (SP), pp. 1057\u20131073. IEEE, Piscataway, NJ, USA.https:\/\/doi.org\/10.1109\/SP40001.2021.00043","DOI":"10.1109\/SP40001.2021.00043"},{"issue":"1","key":"601_CR39","doi-asserted-by":"publisher","first-page":"13","DOI":"10.3390\/cryptography9010013","volume":"9","author":"M Luo","year":"2025","unstructured":"Luo M, Wang M (2025) Faster spiral: Low-communication, high-rate private information retrieval. Cryptogr 9(1):13. https:\/\/doi.org\/10.3390\/cryptography9010013","journal-title":"Cryptogr"},{"key":"601_CR40","doi-asserted-by":"publisher","unstructured":"Luo M, Liu F-H, Wang H (2024) Faster fhe-based single-server private information retrieval. In: Proc. ACM SIGSAC Conf. Comput. Commun. Secur. (CCS), pp. 1405\u20131419. ACM, New York, NY, USA.https:\/\/doi.org\/10.1145\/3658644.3690233","DOI":"10.1145\/3658644.3690233"},{"key":"601_CR41","doi-asserted-by":"publisher","unstructured":"Lyubashevsky V, Peikert C, Regev O (2010) On ideal lattices and learning with errors over rings. In: Adv. Cryptol. - EUROCRYPT 2010. Lect. Notes Comput. Sci., vol. 6110, pp. 1\u201323. Springer, Berlin, Heidelberg . https:\/\/doi.org\/10.1007\/978-3-642-13190-5_1","DOI":"10.1007\/978-3-642-13190-5_1"},{"key":"601_CR42","unstructured":"Lyubashevsky V, Peikert C, Regev O (2012) On ideal lattices and learning with errors over rings. IACR Cryptol. ePrint Arch., 230"},{"issue":"2","key":"601_CR43","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1515\/popets-2016-0010","volume":"2016","author":"CA Melchor","year":"2016","unstructured":"Melchor CA, Barrier J, Fousse L, Killijian M-O (2016) XPIR:Private information retrieval for everyone. Proc Priv Enhancing Technol 2016(2):155\u2013174. https:\/\/doi.org\/10.1515\/popets-2016-0010","journal-title":"Proc Priv Enhancing Technol"},{"key":"601_CR44","doi-asserted-by":"publisher","unstructured":"Menon SJ, Wu DJ (2022) SPIRAL: fast, high-rate single-server PIR via FHE composition. In: Proc. IEEE Symp. Secur. Priv. (SP), pp. 930\u2013947. IEEE, Piscataway, NJ, USA. https:\/\/doi.org\/10.1109\/SP46214.2022.9833700","DOI":"10.1109\/SP46214.2022.9833700"},{"key":"601_CR45","unstructured":"Menon SJ, Wu DJ (2024) YPIR: high-throughput single-server PIR with silent preprocessing. In: Proc. 33rd USENIX Secur. Symp. USENIX Association, Berkeley, CA, USA"},{"key":"601_CR46","doi-asserted-by":"publisher","unstructured":"Micciancio D, Polyakov Y (2021) Bootstrapping in fhew-like cryptosystems. In: Proc 9th Workshop Encrypt Comput Appl Homomorph Cryptogr. (WAHC), pp. 17\u201328. ACM, New York, NY, USA. https:\/\/doi.org\/10.1145\/3474366.3486924","DOI":"10.1145\/3474366.3486924"},{"key":"601_CR47","doi-asserted-by":"publisher","unstructured":"Micciancio D, Sorrell J (2018) Ring packing and amortized FHEW bootstrapping. In: Proc Int Colloq Autom Lang Program (ICALP). LIPIcs, vol. 107, pp. 100\u2013110014. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany. https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2018.100","DOI":"10.4230\/LIPIcs.ICALP.2018.100"},{"key":"601_CR48","doi-asserted-by":"publisher","unstructured":"Mughees MH, Chen H, Ren L (2021) Onionpir: Response efficient single-server PIR. In: Proc. ACM SIGSAC Conf. Comput. Commun. Secur. (CCS), pp. 2292\u20132306. ACM, New York, NY, USA.https:\/\/doi.org\/10.1145\/3460120.3485381","DOI":"10.1145\/3460120.3485381"},{"key":"601_CR49","doi-asserted-by":"publisher","unstructured":"Peikert C, Vaikuntanathan V, Waters B (2008) A framework for efficient and composable oblivious transfer. In: Adv Cryptol - CRYPTO 2008. Lect. Notes Comput. Sci., vol. 5157, pp. 554\u2013571. Springer, Berlin, Heidelberg.https:\/\/doi.org\/10.1007\/978-3-540-85174-5_31","DOI":"10.1007\/978-3-540-85174-5_31"},{"key":"601_CR50","doi-asserted-by":"publisher","unstructured":"Regev O (2005) On lattices, learning with errors, random linear codes, and cryptography. In: Proc. 37th Annu. ACM Symp. Theory Comput. (STOC), pp. 84\u201393 .https:\/\/doi.org\/10.1145\/1060590.1060603","DOI":"10.1145\/1060590.1060603"},{"issue":"6","key":"601_CR51","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1145\/1568318.1568324","volume":"56","author":"O Regev","year":"2009","unstructured":"Regev O (2009) On lattices, learning with errors, random linear codes, and cryptography. J ACM 56(6):34\u201313440. https:\/\/doi.org\/10.1145\/1568318.1568324","journal-title":"J ACM"},{"key":"601_CR52","doi-asserted-by":"publisher","unstructured":"Ren L, Mughees MH, Sun I (2024) Simple and practical amortized sublinear private information retrieval using dummy subsets. In: Proc ACM SIGSAC Conf Comput Commun Secur. (CCS), pp. 1420\u20131433. ACM, New York, NY, USA. https:\/\/doi.org\/10.1145\/3658644.3690266","DOI":"10.1145\/3658644.3690266"},{"key":"601_CR53","doi-asserted-by":"publisher","unstructured":"Wang Z, Ren L (2025) Single-server client preprocessing PIR with tight space-time trade-off. In: Adv Cryptol - EUROCRYPT 2025, Part VI. Lect. Notes Comput Sci, vol. 15606, pp. 94\u2013122. Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-031-91095-1_4","DOI":"10.1007\/978-3-031-91095-1_4"},{"key":"601_CR54","unstructured":"Yang X, Wang R, Peng D, Liu K, Lu X, Tang X (2025) PIRCOR: communication-optimal hintless single-server PIR via homomorphic rotation. IACR Cryptol. ePrint Arch., 756"},{"key":"601_CR55","doi-asserted-by":"publisher","unstructured":"Zhou M, Park A, Zheng W, Shi E (2024) Piano: Extremely simple, single-server PIR with sublinear server computation. In: Proc IEEE Symp Secur Priv (SP), pp. 4296\u20134314. IEEE, Piscataway, NJ, USA. https:\/\/doi.org\/10.1109\/SP54263.2024.00055","DOI":"10.1109\/SP54263.2024.00055"}],"container-title":["Cybersecurity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s42400-026-00601-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s42400-026-00601-7","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s42400-026-00601-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T09:34:11Z","timestamp":1779356051000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1186\/s42400-026-00601-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5,21]]},"references-count":55,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2026,12]]}},"alternative-id":["601"],"URL":"https:\/\/doi.org\/10.1186\/s42400-026-00601-7","relation":{},"ISSN":["2523-3246"],"issn-type":[{"value":"2523-3246","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,5,21]]},"assertion":[{"value":"21 January 2026","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 May 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 May 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Data is available with the author; it will be made available to researchers as per demand.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Availability of data and materials"}},{"value":"None of the authors have any conflict of interest in the manuscript.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"171"}}