{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T04:28:58Z","timestamp":1778128138253,"version":"3.51.4"},"publisher-location":"Cham","reference-count":52,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031786785","type":"print"},{"value":"9783031786792","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-78679-2_14","type":"book-chapter","created":{"date-parts":[[2025,2,15]],"date-time":"2025-02-15T09:30:07Z","timestamp":1739611807000},"page":"264-282","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Towards Practical Doubly-Efficient Private Information Retrieval"],"prefix":"10.1007","author":[{"given":"Hiroki","family":"Okada","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rachel","family":"Player","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simon","family":"Pohmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Weinert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,2,16]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Angel, S., Chen, H., Laine, K., Setty, S.: PIR with compressed queries and amortized query processing. In: S &P. IEEE Computer Society, pp. 962\u2013979 (2018)","DOI":"10.1109\/SP.2018.00062"},{"key":"14_CR2","unstructured":"Angel, S., Setty, S.: Unobservable communication over fully untrusted infrastructure. In: OSDI. USENIX Association, pp. 551\u2013 569 (2016)"},{"key":"14_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/b98671","volume-title":"Querying Databases Privately","author":"D Asonov","year":"2004","unstructured":"Asonov, D.: Querying Databases Privately. LNCS, vol. 3128. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/b98671"},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/978-3-319-69453-5_23","volume-title":"Selected Areas in Cryptography \u2013 SAC 2016","author":"J-C Bajard","year":"2017","unstructured":"Bajard, J.-C., Eynard, J., Hasan, M.A., Zucca, V.: A full RNS variant of FV like somewhat homomorphic encryption schemes. In: Avanzi, R., Heys, H. (eds.) SAC 2016. LNCS, vol. 10532, pp. 423\u2013442. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-69453-5_23"},{"key":"14_CR5","doi-asserted-by":"publisher","unstructured":"Beigel, R., Fortnow, L., Gasarch, W.: A tight lower bound for restricted PIR protocols\u201d. Comput. Complex. 15(1), 82\u201391. https:\/\/doi.org\/10.1007\/s00037-006-0208-3","DOI":"10.1007\/s00037-006-0208-3"},{"key":"14_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"912","DOI":"10.1007\/3-540-48224-5_74","volume-title":"Automata, Languages and Programming","author":"A Beimel","year":"2001","unstructured":"Beimel, A., Ishai, Y.: Information-theoretic private information retrieval: a unified construction. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 912\u2013926. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-48224-5_74"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Beimel, A., Ishai, Y., Kushilevitz, E., Orlov, I.: Share conversion and private information retrieval. In: CCC. IEEE Computer Society, pp. 258\u2013 268 (2012)","DOI":"10.1109\/CCC.2012.23"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Beimel, A., Ishai, Y., Kushilevitz, E., Raymond, J.F.: Breaking the O(n1\/(2k- 1)) barrier for information-theoretic private information retrieval. In: FOCS. IEEE Computer Society, pp. 261\u2013270 (2002)","DOI":"10.1109\/SFCS.2002.1181949"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"A. Beimel, Y. Ishai, T. Malkin. \u201cReducing the Servers Computation in Private Information Retrieval: PIR with Preprocessing\u201d. In: CRYPTO. Springer, 2000, pp. 55\u201373","DOI":"10.1007\/3-540-44598-6_4"},{"key":"14_CR10","unstructured":"D. Boneh, D. Mazieres, R. A. Popa. \u201cRemote oblivious storage: Making oblivious RAM practical\u201d. In: (2011)"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"E. Boyle, Y. Ishai, R. Pass, M. Wootters. \u201cCan We Access a Database Both Locally and Privately?\u201d In: TCC. Springer, 2017, pp. 662\u2013693","DOI":"10.1007\/978-3-319-70503-3_22"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Z. Brakerski, C. Gentry, V. Vaikuntanathan. \u201cFully Homomorphic Encryption without Bootstrapping\u201d. In: IACR Cryptol. ePrint Arch. (2011), p. 277","DOI":"10.1145\/2090236.2090262"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"Z. Brakerski, V. Vaikuntanathan. \u201cFully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages\u201d. In: CRYPTO. Springer, 2011, pp. 505\u2013524","DOI":"10.1007\/978-3-642-22792-9_29"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"R. Canetti, J. Holmgren, S. Richelson. \u201cTowards Doubly Efficient Private Information Retrieval\u201d. In: TCC. Springer, 2017, pp. 694\u2013726","DOI":"10.1007\/978-3-319-70503-3_23"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"J. H. Cheon, A. Kim, M. Kim, Y. S. Song. \u201cHomomorphic Encryption for Arithmetic of Approximate Numbers\u201d. In: ASIACRYPT. Springer, 2017, pp. 409\u2013437","DOI":"10.1007\/978-3-319-70694-8_15"},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"H. Corrigan-Gibbs, A. Henzinger, D. Kogan. \u201cSingle-Server Private Information Retrieval with Sublinear Amortized Time\u201d. In: EUROCRYPT. Springer, 2022, pp. 3\u201333","DOI":"10.1007\/978-3-031-07085-3_1"},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"H. Corrigan-Gibbs, D. Kogan. \u201cPrivate Information Retrieval with Sublinear Online Time\u201d. In: EUROCRYPT. Springer, 2020, pp. 44\u201375","DOI":"10.1007\/978-3-030-45721-1_3"},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"I. Damg\u00e5rd, S. Meldgaard, J. B. Nielsen. \u201cPerfectly Secure Oblivious RAM without Random Oracles\u201d. In: TCC. Springer, 2011, pp. 144\u2013163","DOI":"10.1007\/978-3-642-19571-6_10"},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"A. Davidson, G. Pestana, S. Celi. \u201cFrodoPIR: Simple, Scalable, Single- Server Private Information Retrieval\u201d. In: PoPETS 2023.1 (2023), pp. 365\u2013 383","DOI":"10.56553\/popets-2023-0022"},{"key":"14_CR20","doi-asserted-by":"crossref","unstructured":"D. Demmler, P. Rindal, M. Rosulek, N. Trieu. \u201cPIR-PSI: Scaling Private Contact Discovery\u201d. In: PoPETS 2018.4 (2018), pp. 159\u2013178","DOI":"10.1515\/popets-2018-0037"},{"key":"14_CR21","doi-asserted-by":"crossref","unstructured":"Z. Dvir, S. Gopi. \u201c2-Server PIR with Subpolynomial Communication\u201d. In: J. ACM 63.4 (2016), 39:1-39:15","DOI":"10.1145\/2968443"},{"key":"14_CR22","doi-asserted-by":"crossref","unstructured":"K. Efremenko. \u201c3-query locally decodable codes of subexponential length\u201d. In: STOC. ACM, 2009, pp. 39\u201344","DOI":"10.1145\/1536414.1536422"},{"key":"14_CR23","unstructured":"J. Fan, F. Vercauteren. \u201cSomewhat Practical Fully Homomorphic Encryption\u201d. In: IACR Cryptol. ePrint Arch. (2012), p. 144"},{"key":"14_CR24","doi-asserted-by":"crossref","unstructured":"E. Fung, G. Kellaris, D. Papadias. \u201cCombining Differential Privacy and PIR for Efficient Strong Location Privacy\u201d. In: SSTD. Springer, 2015, pp. 295\u2013312","DOI":"10.1007\/978-3-319-22363-6_16"},{"key":"14_CR25","doi-asserted-by":"crossref","unstructured":"C. Gentry. \u201cA fully homomorphic encryption scheme\u201d. PhD thesis. Stanford University, USA, 2009","DOI":"10.1145\/1536414.1536440"},{"key":"14_CR26","doi-asserted-by":"crossref","unstructured":"C. Gentry, S. Halevi, N. P. Smart. \u201cHomomorphic Evaluation of the AES Circuit\u201d. In: CRYPTO. Springer, 2012, pp. 850\u2013867","DOI":"10.1007\/978-3-642-32009-5_49"},{"key":"14_CR27","doi-asserted-by":"crossref","unstructured":"C. Gentry, A. Sahai, B. Waters. \u201cHomomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute- Based\u201d. In: CRYPTO. Springer, 2013, pp. 75\u201392","DOI":"10.1007\/978-3-642-40041-4_5"},{"key":"14_CR28","doi-asserted-by":"crossref","unstructured":"N. Gilboa, Y. Ishai. \u201cDistributed Point Functions and Their Applications\u201d. In: EUROCRYPT. Springer, 2014, pp. 640\u2013658","DOI":"10.1007\/978-3-642-55220-5_35"},{"key":"14_CR29","doi-asserted-by":"crossref","unstructured":"O. Goldreich. \u201cTowards a Theory of Software Protection and Simulation by Oblivious RAMs\u201d. In: STOC. ACM, 1987, pp. 182\u2013194","DOI":"10.1145\/28395.28416"},{"key":"14_CR30","unstructured":"D. G\u00fcnther, M. Heymann, B. Pinkas, T. Schneider. \u201cGPU-accelerated PIR with Client-Independent Preprocessing for Large-Scale Applications\u201d. In: USENIX Security Symposium. USENIX Association, 2022, pp. 1759\u20131776"},{"key":"14_CR31","doi-asserted-by":"crossref","unstructured":"S. Halevi, Y. Polyakov, V. Shoup. \u201cAn Improved RNS Variant of the BFV Homomorphic Encryption Scheme\u201d. In: CT-RSA. Springer, 2019, pp. 83\u2013 105","DOI":"10.1007\/978-3-030-12612-4_5"},{"key":"14_CR32","unstructured":"A. Henzinger, M. M. Hong, H. Corrigan-Gibbs, S. Meiklejohn, V. Vaikuntanathan. \u201cOne Server for the Price of Two: Simple and Fast Single-Server Private Information Retrieval\u201d. In: USENIX Security Symposium. USENIX Association, 2023"},{"key":"14_CR33","doi-asserted-by":"crossref","unstructured":"L. Hetz, T. Schneider, C. Weinert. \u201cScaling Mobile Private Contact Discovery to Billions of Users\u201d. In: ESORICS. Springer, 2023","DOI":"10.1007\/978-3-031-50594-2_23"},{"key":"14_CR34","doi-asserted-by":"crossref","unstructured":"Y. Ishai, E. Kushilevitz, R. Ostrovsky, A. Sahai. \u201cBatch codes and their applications\u201d. In: STOC. ACM, 2004, pp. 262\u2013271","DOI":"10.1145\/1007352.1007396"},{"key":"14_CR35","unstructured":"D. Kales, C. Rechberger, T. Schneider, M. Senker, C. Weinert. \u201cMobile Private Contact Discovery at Scale\u201d. In: USENIX Security Symposium. USENIX Association, 2019, pp. 1447\u20131464"},{"key":"14_CR36","doi-asserted-by":"crossref","unstructured":"K. S. Kedlaya, C. Umans. \u201cFast Polynomial Factorization and Modular Composition\u201d. In: SIAM J. Comput. 40.6 (2011), pp. 1767\u20131802","DOI":"10.1137\/08073408X"},{"key":"14_CR37","doi-asserted-by":"crossref","unstructured":"A. Khoshgozaran, H. Shirani-Mehr, C. Shahabi. \u201cSPIRAL: A scalable private information retrieval approach to location privacy\u201d. In: MDMW. IEEE. 2008, pp. 55\u201362","DOI":"10.1109\/MDMW.2008.23"},{"key":"14_CR38","doi-asserted-by":"crossref","unstructured":"A. Lazzaretti, C. Papamanthou. \u201cNear-Optimal Private Information Retrieval with Preprocessing\u201d. In: IACR Cryptol. ePrint Arch. (2022), p. 830","DOI":"10.1007\/978-3-031-48618-0_14"},{"key":"14_CR39","doi-asserted-by":"crossref","unstructured":"W. Lin, E. Mook, D. Wichs. \u201cDoubly Efficient Private Information Retrieval and Fully Homomorphic RAM Computation from Ring LWE\u201d. In: STOC. ACM, 2023, pp. 595\u2013608","DOI":"10.1145\/3564246.3585175"},{"key":"14_CR40","doi-asserted-by":"crossref","unstructured":"V. Lyubashevsky, C. Peikert, O. Regev. \u201cOn Ideal Lattices and Learning with Errors over Rings\u201d. In: EUROCRYPT. Springer, 2010, pp. 1\u201323","DOI":"10.1007\/978-3-642-13190-5_1"},{"key":"14_CR41","doi-asserted-by":"crossref","unstructured":"C. A. Melchor, J. Barrier, L. Fousse, M. Killijian. \u201cXPIR : Private Information Retrieval for Everyone\u201d. In: PoPETS 2016.2 (2016), pp. 155\u2013174","DOI":"10.1515\/popets-2016-0010"},{"key":"14_CR42","unstructured":"Mittal, P., Olumofin, F., Troncoso, C., Borisov, N., Goldberg, I.: PIR-Tor: scalable anonymous communication using private information retrieval. In: USENIX Security Symposium. USENIX Association (2011)"},{"key":"14_CR43","doi-asserted-by":"crossref","unstructured":"Mughees, M.H., Chen, H., Ren, L.: OnionPIR: response efficient single- server PIR. In: CCS, pp. 2292\u20132306. ACM (2021)","DOI":"10.1145\/3460120.3485381"},{"key":"14_CR44","unstructured":"Okada, H., Player, R., Pohmann, S., Weinert, C.: Towards practical doubly- efficient private information retrieval. Cryptology ePrint Archive, Paper 2023\/1510 (2023). https:\/\/eprint.iacr.org\/2023\/1510"},{"key":"14_CR45","doi-asserted-by":"crossref","unstructured":"Patel, S., Persiano, G., Yeo, K.: Private stateful information retrieval. In: CCS, pp. 1002\u20131019. ACM (2018)","DOI":"10.1145\/3243734.3243821"},{"key":"14_CR46","doi-asserted-by":"crossref","unstructured":"Stefanov, E., et al.: Path ORAM: an extremely simple oblivious RAM protocol. J. ACM 65(4), 18:1\u201318:26 (2018)","DOI":"10.1145\/3177872"},{"key":"14_CR47","doi-asserted-by":"crossref","unstructured":"Stefanov, E., Shi, E.: ObliviStore: High Performance Oblivious Cloud Storage. In: S &P. IEEE Computer Society, pp. 253\u2013267 (2013)","DOI":"10.1109\/SP.2013.25"},{"key":"14_CR48","unstructured":"Stefanov, E., Shi, E., Song, D.X.: Towards practical oblivious RAM. In: NDSS. The Internet Society (2012)"},{"key":"14_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1007\/978-3-642-10366-7_36","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2009","author":"D Stehl\u00e9","year":"2009","unstructured":"Stehl\u00e9, D., Steinfeld, R., Tanaka, K., Xagawa, K.: Efficient public key encryption based on ideal lattices. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol. 5912, pp. 617\u2013635. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10366-7_36"},{"key":"14_CR50","doi-asserted-by":"crossref","unstructured":"Yekhanin, S.: Towards 3-query locally decodable codes of subexponential length.J. ACM 55(1), 1:1-1:16 (2008)","DOI":"10.1145\/1326554.1326555"},{"key":"14_CR51","doi-asserted-by":"publisher","unstructured":"Zhou, M., Lin, WK., Tselekounis, Y., Shi, E.: Optimal Single-Server Private Information Retrieval. In: Hazay, C., Stam, M. (eds.) EUROCRYPT, vol. 14004, pp. 395\u2013425. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30545-0_14","DOI":"10.1007\/978-3-031-30545-0_14"},{"key":"14_CR52","doi-asserted-by":"crossref","unstructured":"Zhou, M., Park, A., Shi, E., Zheng, W.: Piano: extremely simple, single- server PIR with sublinear server computation. In: S &P. IEEE Computer Society (2024)","DOI":"10.1109\/SP54263.2024.00055"}],"container-title":["Lecture Notes in Computer Science","Financial Cryptography and Data Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-78679-2_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,15]],"date-time":"2025-02-15T09:30:41Z","timestamp":1739611841000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-78679-2_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031786785","9783031786792"],"references-count":52,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-78679-2_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"16 February 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Financial Cryptography and Data Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Willemstad","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cura\u00e7ao","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 March 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 March 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fc2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/fc24.ifca.ai\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}