{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,15]],"date-time":"2026-08-15T00:28:20Z","timestamp":1786753700470,"version":"build-2736575974"},"publisher-location":"Cham","reference-count":60,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031683992","type":"print"},{"value":"9783031684005","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-68400-5_5","type":"book-chapter","created":{"date-parts":[[2024,8,15]],"date-time":"2024-08-15T19:02:37Z","timestamp":1723748557000},"page":"148-182","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["PIR with\u00a0Client-Side Preprocessing: Information-Theoretic Constructions and\u00a0Lower Bounds"],"prefix":"10.1007","author":[{"given":"Yuval","family":"Ishai","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Elaine","family":"Shi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daniel","family":"Wichs","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,8,16]]},"reference":[{"key":"5_CR1","unstructured":"https:\/\/haveibeenpwned.com\/"},{"key":"5_CR2","unstructured":"Improving DNS privacy with oblivious DOH in 1.1.1.1. https:\/\/blog.cloudflare.com\/oblivious-dns\/"},{"key":"5_CR3","unstructured":"Technology deep dive: building a faster oram layer for enclaves. https:\/\/signal.org\/blog\/building-faster-oram\/"},{"key":"5_CR4","doi-asserted-by":"publisher","unstructured":"Ajtai, M.: Oblivious rams without cryptographic assumptions. In: Proceedings of the 42nd ACM Symposium on Theory of Computing (STOC 2010), pp. 181\u2013190. ACM, New York (2010). https:\/\/doi.org\/10.1145\/1806689.1806716","DOI":"10.1145\/1806689.1806716"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Angel, S., Chen, H., Laine, K., Setty, S.T.V.: PIR with compressed queries and amortized query processing. In: S &P (2018)","DOI":"10.1109\/SP.2018.00062"},{"key":"5_CR6","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":"5_CR7","doi-asserted-by":"publisher","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","DOI":"10.1007\/3-540-44598-6_4"},{"key":"5_CR8","doi-asserted-by":"publisher","unstructured":"Berman, I., Degwekar, A., Rothblum, R.D., Vasudevan, P.N.: From laconic zero-knowledge to public-key cryptography. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10993, pp. 674\u2013697. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96878-0_23","DOI":"10.1007\/978-3-319-96878-0_23"},{"key":"5_CR9","doi-asserted-by":"publisher","unstructured":"Bitansky, N., Degwekar, A.: On the complexity of collision resistant hash functions: new and old black-box separations. In: Hofheinz, D., Rosen, A. (eds.) TCC 2019. LNCS, vol. 11891, pp. 422\u2013450. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-36030-6_17","DOI":"10.1007\/978-3-030-36030-6_17"},{"key":"5_CR10","doi-asserted-by":"publisher","unstructured":"Bitansky, N., Degwekar, A., Vaikuntanathan, V.: Structure versus hardness through the obfuscation lens. SIAM J. Comput. 50(1), 98\u2013144 (2021). https:\/\/doi.org\/10.1137\/17M1136559","DOI":"10.1137\/17M1136559"},{"key":"5_CR11","doi-asserted-by":"publisher","unstructured":"Boyle, E., Gilboa, N., Ishai, Y., Kolobov, V.I.: Information-theoretic distributed point functions. In: Dachman-Soled, D. (ed.) 3rd Conference on Information-Theoretic Cryptography, ITC 2022, 5\u20137 July 2022, Cambridge. LIPIcs, vol.\u00a0230, pp. 17:1\u201317:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022).https:\/\/doi.org\/10.4230\/LIPICS.ITC.2022.17","DOI":"10.4230\/LIPICS.ITC.2022.17"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Boyle, E., Ishai, Y., Pass, R., Wootters, M.: Can we access a database both locally and privately? In: TCC (2017)","DOI":"10.1007\/978-3-319-70503-3_22"},{"key":"5_CR13","doi-asserted-by":"publisher","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","DOI":"10.1007\/3-540-48910-X_28"},{"key":"5_CR14","doi-asserted-by":"publisher","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","DOI":"10.1007\/978-3-319-70503-3_23"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Chor, B., Gilboa, N.: Computationally private information retrieval. In: STOC (1997)","DOI":"10.1145\/258533.258609"},{"key":"5_CR16","unstructured":"Chor, B., Goldreich, O., Kushilevitz, E., Sudan, M.: Private information retrieval. In: FOCS (1995)"},{"key":"5_CR17","doi-asserted-by":"publisher","unstructured":"Corrigan-Gibbs, H., Henzinger, A., Kogan, D.: Single-server private information retrieval with\u00a0sublinear amortized time. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT 2022, Part II, pp. 3\u201333. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-07085-3_1","DOI":"10.1007\/978-3-031-07085-3_1"},{"key":"5_CR18","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":"5_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/978-3-642-19571-6_10","volume-title":"Theory of Cryptography","author":"I Damg\u00e5rd","year":"2011","unstructured":"Damg\u00e5rd, I., Meldgaard, S., Nielsen, J.B.: Perfectly secure oblivious RAM without random oracles. In: Ishai, Y. (ed.) TCC 2011. LNCS, vol. 6597, pp. 144\u2013163. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19571-6_10"},{"key":"5_CR20","doi-asserted-by":"publisher","unstructured":"Davidson, A., Pestana, G., Celi, S.: Frodopir: simple, scalable, single-server private information retrieval. Proc. Priv. Enhancing Technol. 2023(1), 365\u2013383 (2023). https:\/\/doi.org\/10.56553\/POPETS-2023-0022","DOI":"10.56553\/POPETS-2023-0022"},{"key":"5_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/3-540-45539-6_10","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2000","author":"G Di Crescenzo","year":"2000","unstructured":"Di Crescenzo, G., Malkin, T., Ostrovsky, R.: Single database private information retrieval implies oblivious transfer. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 122\u2013138. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45539-6_10"},{"key":"5_CR22","doi-asserted-by":"crossref","unstructured":"Dvir, Z., Gopi, S.: 2-Server PIR with subpolynomial communication. J. ACM 63(4), 1\u201315 (2016)","DOI":"10.1145\/2968443"},{"key":"5_CR23","first-page":"72","volume":"82","author":"WI Gasarch","year":"2004","unstructured":"Gasarch, W.I.: A survey on private information retrieval. Bulletin EATCS 82, 72\u2013107 (2004)","journal-title":"Bulletin EATCS"},{"key":"5_CR24","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":"5_CR25","doi-asserted-by":"publisher","unstructured":"Ghoshal, A., Zhou, M., Shi, E.: Efficient pre-processing PIR without public-key cryptography. In: Joye, M., Leander, G. (eds.) EUROCRYPT 2024, Part VI, pp. 210\u2013240. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-58751-1_8","DOI":"10.1007\/978-3-031-58751-1_8"},{"key":"5_CR26","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":"5_CR27","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Ostrovsky, R.: Software protection and simulation on oblivious RAMs. J. ACM (1996)","DOI":"10.1145\/233551.233553"},{"key":"5_CR28","doi-asserted-by":"publisher","unstructured":"Goldreich, O., Vadhan, S.P.: Comparing entropies in statistical zero knowledge with applications to the structure of SZK. In: Proceedings of the 14th Annual IEEE Conference on Computational Complexity, Atlanta, 4\u20136 May 1999, p. 54. IEEE Computer Society (1999).https:\/\/doi.org\/10.1109\/CCC.1999.766262","DOI":"10.1109\/CCC.1999.766262"},{"key":"5_CR29","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 (2023)","DOI":"10.1145\/3600006.3613134"},{"key":"5_CR30","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":"5_CR31","doi-asserted-by":"publisher","unstructured":"Hub\u00e1cek, P., Wichs, D.: On the communication complexity of secure function evaluation with long output. In: Roughgarden, T. (ed.) Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, ITCS 2015, Rehovot, 11\u201313 January 2015, pp. 163\u2013172. ACM (2015). https:\/\/doi.org\/10.1145\/2688073.2688105","DOI":"10.1145\/2688073.2688105"},{"key":"5_CR32","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Luby, M.: One-way functions are essential for complexity based cryptography (extended abstract). In: 30th Annual Symposium on Foundations of Computer Science, pp. 230\u2013235. IEEE Computer Society (1989)","DOI":"10.1109\/SFCS.1989.63483"},{"key":"5_CR33","doi-asserted-by":"publisher","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R.: Sufficient conditions for collision-resistant hashing. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 445\u2013456. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-30576-7_24","DOI":"10.1007\/978-3-540-30576-7_24"},{"key":"5_CR34","doi-asserted-by":"publisher","unstructured":"Komargodski, I., Yogev, E.: On distributional collision resistant\u00a0hashing. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10992, pp. 303\u2013327. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96881-0_11","DOI":"10.1007\/978-3-319-96881-0_11"},{"key":"5_CR35","unstructured":"Kushilevitz, E., Ostrovsky, R.: Replication is not needed: single database, computationally-private information retrieval. In: FOCS (1997)"},{"key":"5_CR36","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":"5_CR37","unstructured":"Li, B., Micciancio, D., Raykova, M., Schultz, M.: Hintless single-server private information retrieval. IACR Cryptol. ePrint Arch. p.\u00a01733 (2023). https:\/\/eprint.iacr.org\/2023\/1733"},{"key":"5_CR38","doi-asserted-by":"crossref","unstructured":"Lin, W.K., Mook, E., Wichs, D.: Doubly efficient private information retrieval and fully homomorphic ram computation from ring IWE. In: STOC (2023)","DOI":"10.1145\/3564246.3585175"},{"key":"5_CR39","doi-asserted-by":"publisher","unstructured":"Lipmaa, H.: An oblivious transfer protocol with log-squared communication. In: Zhou, J., Lopez, J., Deng, R.H., Bao, F. (eds.) ISC 2005. LNCS, vol. 3650, pp. 314\u2013328. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11556992_23","DOI":"10.1007\/11556992_23"},{"key":"5_CR40","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":"5_CR41","doi-asserted-by":"publisher","unstructured":"Liu, T., Vaikuntanathan, V.: On basing private information retrieval on NP-hardness. In: Kushilevitz, E., Malkin, T. (eds.) TCC 2016. LNCS, vol. 9562, pp. 372\u2013386. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49096-9_16","DOI":"10.1007\/978-3-662-49096-9_16"},{"key":"5_CR42","doi-asserted-by":"publisher","unstructured":"Maurer, U.M.: Secret key agreement by public discussion from common information. IEEE Trans. Inf. Theory 39(3), 733\u2013742 (1993). https:\/\/doi.org\/10.1109\/18.256484","DOI":"10.1109\/18.256484"},{"key":"5_CR43","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 (2008)","DOI":"10.1109\/SECURWARE.2008.55"},{"key":"5_CR44","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 Cryptol. ePrint Archiv. 2007, 446 (2007)","journal-title":"IACR Cryptol. ePrint Archiv."},{"key":"5_CR45","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":"5_CR46","unstructured":"Mughees, M.H., I, S., Ren, L.: Simple and practical amortized sublinear private information retrieval. Cryptology ePrint Archive, Paper 2023\/1072 (2023)"},{"key":"5_CR47","doi-asserted-by":"publisher","unstructured":"Okamoto, T., Pietrzak, K., Waters, B., Wichs, D.: New realizations of somewhere statistically binding hashing and positional accumulators. In: Iwata, T., Cheon, J.H. (eds.) ASIACRYPT 2015. LNCS, vol. 9452, pp. 121\u2013145. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48797-6_6","DOI":"10.1007\/978-3-662-48797-6_6"},{"key":"5_CR48","doi-asserted-by":"publisher","unstructured":"Olumofin, F., Goldberg, I.: Revisiting the computational practicality of private information retrieval. In: Danezis, G. (ed.) FC 2011. LNCS, vol. 7035, pp. 158\u2013172. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-27576-0_13","DOI":"10.1007\/978-3-642-27576-0_13"},{"key":"5_CR49","doi-asserted-by":"publisher","unstructured":"Ong, S.J., Vadhan, S.: An equivalence between zero knowledge and commitments. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 482\u2013500. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78524-8_27","DOI":"10.1007\/978-3-540-78524-8_27"},{"key":"5_CR50","doi-asserted-by":"publisher","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","DOI":"10.1007\/978-3-540-71677-8_26"},{"key":"5_CR51","doi-asserted-by":"crossref","unstructured":"Patel, S., Persiano, G., Yeo, K.: Private stateful information retrieval. In: Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, CCS, pp. 1002\u20131019. ACM (2018)","DOI":"10.1145\/3243734.3243821"},{"key":"5_CR52","doi-asserted-by":"publisher","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","DOI":"10.1007\/978-3-030-84259-8_22"},{"key":"5_CR53","doi-asserted-by":"publisher","unstructured":"Shi, E., Chan, T.-H.H., Stefanov, E., Li, M.: Oblivious RAM with O((logN)3) worst-case cost. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol. 7073, pp. 197\u2013214. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25385-0_11","DOI":"10.1007\/978-3-642-25385-0_11"},{"key":"5_CR54","unstructured":"Sion, R., Carbunar, B.: On the computational practicality of private information retrieval. In: Network and Distributed Systems Security Symposium (NDSS) (2007)"},{"key":"5_CR55","doi-asserted-by":"crossref","unstructured":"Stefanov, E., et al.: Path ORAM\u2013an extremely simple oblivious ram protocol. In: CCS (2013)","DOI":"10.1145\/2508859.2516660"},{"key":"5_CR56","doi-asserted-by":"publisher","unstructured":"Vadhan, S.P.: An unconditional study of computational zero knowledge. SIAM J. Comput. 36(4), 1160\u20131214 (2006). https:\/\/doi.org\/10.1137\/S0097539705447207","DOI":"10.1137\/S0097539705447207"},{"key":"5_CR57","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, pp. 275\u2013284. IEEE Computer Society (2005)","DOI":"10.1109\/CCC.2005.2"},{"key":"5_CR58","doi-asserted-by":"crossref","unstructured":"Yeo, K.: Lower bounds for (batch) PIR with private preprocessing. In: Eurocrypt, pp. 518\u2013550. Springer-Verlag (2023)","DOI":"10.1007\/978-3-031-30545-0_18"},{"key":"5_CR59","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"},{"key":"5_CR60","doi-asserted-by":"crossref","unstructured":"Zhou, M., Park, A., Shi, E., Zheng, W.: Piano: extremely simple, single-server PIR with sublinear server computation. In: IEEE S & P (2024)","DOI":"10.1109\/SP54263.2024.00055"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-68400-5_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,15]],"date-time":"2026-08-15T00:01:36Z","timestamp":1786752096000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-68400-5_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031683992","9783031684005"],"references-count":60,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-68400-5_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"16 August 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"18 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"44","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}