{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T21:33:16Z","timestamp":1779399196538,"version":"3.53.1"},"publisher-location":"Cham","reference-count":52,"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_6","type":"book-chapter","created":{"date-parts":[[2024,8,15]],"date-time":"2024-08-15T23:02:37Z","timestamp":1723762957000},"page":"183-217","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Hintless Single-Server Private Information Retrieval"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1088-9328","authenticated-orcid":false,"given":"Baiyu","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3323-9985","authenticated-orcid":false,"given":"Daniele","family":"Micciancio","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mariana","family":"Raykova","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5761-9662","authenticated-orcid":false,"given":"Mark","family":"Schultz-Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,8,16]]},"reference":[{"key":"6_CR1","unstructured":"Ahmad, I., Yang, Y., Agrawal, D., Abbadi, A.E., Gupta, T.: Addra: metadata-private voice communication over fully untrusted infrastructure. In: Brown, A.D., Lorch, J.R. (eds.) 15th USENIX Symposium on Operating Systems Design and Implementation, OSDI 2021, 14\u201316 July 2021 (2021)"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Albrecht, M.R., Player, R., Scott, S.: On the concrete hardness of learning with errors. J. Math. Cryptol. 9(3), 169\u2013203 (2015). http:\/\/www.degruyter.com\/view\/j\/jmc.2015.9.issue-3\/jmc-2015-0016\/jmc-2015-0016.xml","DOI":"10.1515\/jmc-2015-0016"},{"key":"6_CR3","unstructured":"Ali, A., et al.: Communication-computation trade-offs in PIR. In: Bailey, M., Greenstadt, R. (eds.) USENIX Security 2021: 30th USENIX Security Symposium, pp. 1811\u20131828. USENIX Association,\u00a011\u201313 August 2021"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Angel, S., Chen, H., Laine, K., Setty, S.: PIR with compressed queries and amortized query processing. In: 2018 IEEE Symposium on Security and Privacy (SP) (2018)","DOI":"10.1109\/SP.2018.00062"},{"key":"6_CR5","unstructured":"Angel, S., Setty, S.: Unobservable communication over fully untrusted infrastructure. In: 12th USENIX Symposium on Operating Systems Design and Implementation (OSDI 2016) (2016)"},{"key":"6_CR6","unstructured":"Apple: icloud private relay overview (2021). https:\/\/www.apple.com\/icloud\/docs\/iCloud_Private_Relay_Overview_Dec2021.pdf"},{"key":"6_CR7","unstructured":"Artioli, S.: How practical is single-server private information retrieval? (2023). https:\/\/ethz.ch\/content\/dam\/ethz\/special-interest\/infk\/inst-infsec\/appliedcrypto\/education\/theses\/Howpracticalissingleserverprivateinformationretrievalcorrected.pdf"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Backes, M., Kate, A., Maffei, M., Pecina, K.: ObliviAd: provably secure and practical online behavioral advertising. In: 2012 IEEE Symposium on Security and Privacy (2012)","DOI":"10.1109\/SP.2012.25"},{"key":"6_CR9","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 - 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":"6_CR10","unstructured":"blyss SDK for accessing data privately using homomorphic encryption (2023). https:\/\/github.com\/blyssprivacy\/sdk"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Borisov, N., Danezis, G., Goldberg, I.: DP5: a private presence service. Proc. Priv. Enhancing Technol. (2015)","DOI":"10.1515\/popets-2015-0008"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Boyle, E., Gilboa, N., Ishai, Y.: Function secret sharing: improvements and extensions. In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, CCS 2016 (2016)","DOI":"10.1145\/2976749.2978429"},{"key":"6_CR13","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 - 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":"6_CR14","doi-asserted-by":"publisher","unstructured":"Chen, H., Chillotti, I., Ren, L.: Onion ring ORAM: efficient constant bandwidth oblivious RAM from (leveled) TFHE. In: Cavallaro, L., Kinder, J., Wang, X., Katz, J. (eds.) ACM CCS 2019: 26th Conference on Computer and Communications Security, London, UK,\u00a011\u201315 November 2019, pp. 345\u2013360. ACM Press (2019). https:\/\/doi.org\/10.1145\/3319535.3354226","DOI":"10.1145\/3319535.3354226"},{"key":"6_CR15","unstructured":"Chor, B., Goldreich, O., Kushilevitz, E., Sudan, M.: Private information retrieval. In: 36th Annual Symposium on Foundations of Computer Science, Milwaukee, Wisconsin, USA, 23\u201325 October 1995 (1995)"},{"key":"6_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-031-07085-3_1","volume-title":"Advances in Cryptology - EUROCRYPT 2022, Part II","author":"H Corrigan-Gibbs","year":"2022","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 (2022). https:\/\/doi.org\/10.1007\/978-3-031-07085-3_1"},{"key":"6_CR17","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 - EUROCRYPT 2020, Part I","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, Part I. LNCS, vol. 12105, pp. 44\u201375. Springer, Heidelberg (2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_3"},{"key":"6_CR18","doi-asserted-by":"publisher","unstructured":"Davidson, A., Pestana, G., Celi, S.: FrodoPIR: simple, scalable, single-server private information retrieval. Proc. Priv. Enhanc. Technol. 2023(1), 365\u2013383 (2023). https:\/\/doi.org\/10.56553\/popets-2023-0022","DOI":"10.56553\/popets-2023-0022"},{"key":"6_CR19","unstructured":"Davidson, A., Pestana, G., Celi, S.: FrodoPIR: simple, scalable, single-server private information retrieval. Cryptology ePrint Archive, Paper 2022\/981 (2022). https:\/\/eprint.iacr.org\/2022\/981"},{"key":"6_CR20","unstructured":"Devet, C., Goldberg, I., Heninger, N.: Optimally robust private information retrieval. In: Kohno, T. (ed.) Proceedings of the 21th USENIX Security Symposium, Bellevue, WA, USA, 8\u201310 August 2012. USENIX Association (2012)"},{"issue":"4","key":"6_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2968443","volume":"63","author":"Z Dvir","year":"2016","unstructured":"Dvir, Z., Gopi, S.: 2-server PIR with subpolynomial communication. J. ACM (JACM) 63(4), 1\u201315 (2016)","journal-title":"J. ACM (JACM)"},{"key":"6_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1007\/978-3-030-17656-3_23","volume-title":"Advances in Cryptology - EUROCRYPT 2019, Part II","author":"N Genise","year":"2019","unstructured":"Genise, N., Micciancio, D., Polyakov, Y.: Building an efficient lattice gadget toolkit: subgaussian sampling and more. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019, Part II. LNCS, vol. 11477, pp. 655\u2013684. Springer, Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-3-030-17656-3_23"},{"key":"6_CR23","doi-asserted-by":"crossref","unstructured":"Gentry, C., Halevi, S.: Compressible FHE with applications to PIR. In: Theory of Cryptography: 17th International Conference, TCC 2019 (2019)","DOI":"10.1007\/978-3-030-36033-7_17"},{"key":"6_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1007\/978-3-642-32009-5_49","volume-title":"Advances in Cryptology - CRYPTO 2012","author":"C Gentry","year":"2012","unstructured":"Gentry, C., Halevi, S., Smart, N.P.: Homomorphic evaluation of the AES circuit. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 850\u2013867. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_49"},{"key":"6_CR25","doi-asserted-by":"crossref","unstructured":"Gentry, C., Ramzan, Z.: Single-database private information retrieval with constant communication rate. In: Proceedings of the 32nd International Conference on Automata, Languages and Programming, ICALP 2005, pp. 803\u2013815 (2005)","DOI":"10.1007\/11523468_65"},{"key":"6_CR26","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 - CRYPTO 2013, Part I","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, Part I. LNCS, vol. 8042, pp. 75\u201392. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40041-4_5"},{"key":"6_CR27","unstructured":"Google: VPN by Google One. https:\/\/one.google.com\/about\/vpn"},{"key":"6_CR28","unstructured":"Google: Privacy sandbox IP protection proposal (2023). https:\/\/developer.chrome.com\/en\/docs\/privacy-sandbox\/ip-protection\/"},{"key":"6_CR29","doi-asserted-by":"crossref","unstructured":"Green, M., Ladd, W., Miers, I.: A protocol for privately reporting ad impressions at scale. In: CCS 2016 (2016)","DOI":"10.1145\/2976749.2978407"},{"key":"6_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1007\/978-3-662-44371-2_31","volume-title":"Advances in Cryptology - CRYPTO 2014, Part I","author":"S Halevi","year":"2014","unstructured":"Halevi, S., Shoup, V.: Algorithms in HElib. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014, Part I. LNCS, vol. 8616, pp. 554\u2013571. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44371-2_31"},{"issue":"4","key":"6_CR31","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. Proc. Priv. Enhancing Technol. 2016(4), 202\u2013218 (2016)","journal-title":"Proc. Priv. Enhancing Technol."},{"key":"6_CR32","doi-asserted-by":"crossref","unstructured":"Henzinger, A., Dauterman, E., Corrigan-Gibbs, H., Zeldovich, N.: Private web search with tiptoe. In: Proceedings of the the 29th ACM Symposium on Operating Systems Principles (2023)","DOI":"10.1145\/3600006.3613134"},{"key":"6_CR33","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: Calandrino, J.A., Troncoso, C. (eds.) 32nd USENIX Security Symposium, USENIX Security 2023, Anaheim, CA, USA, 9\u201311 August 2023 (2023)"},{"key":"6_CR34","unstructured":"Kogan, D., Corrigan-Gibbs, H.: Private blocklist lookups with checklist. In: 30th USENIX Security Symposium (USENIX Security 2021) (2021)"},{"key":"6_CR35","unstructured":"Kushilevitz, E., Ostrovsky, R.: Replication is NOT needed: SINGLE database, computationally-private information retrieval. In: 38th Annual Symposium on Foundations of Computer Science, FOCS 1997, Miami Beach, Florida, USA, 19\u201322 October 1997 (1997)"},{"key":"6_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/978-3-031-38545-2_10","volume-title":"CRYPTO 2023, Part II","author":"A Lazzaretti","year":"2023","unstructured":"Lazzaretti, A., Papamanthou, C.: TreePIR: sublinear-time and polylog-bandwidth private information retrieval from DDH. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023, Part II. LNCS, vol. 14082, pp. 284\u2013314. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38545-2_10"},{"key":"6_CR37","doi-asserted-by":"crossref","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","DOI":"10.1145\/3564246.3585175"},{"key":"6_CR38","unstructured":"Melchor, C.A., Barrier, J., Fousse, L., Killijian, M.: XPIR: private information retrieval for everyone. Proc. Priv. Enhanc. Technol. (2016)"},{"key":"6_CR39","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, San Francisco, CA, USA,\u00a022\u201326 May 2022, pp. 930\u2013947. IEEE Computer Society Press (2022). https:\/\/doi.org\/10.1109\/SP46214.2022.9833700","DOI":"10.1109\/SP46214.2022.9833700"},{"key":"6_CR40","unstructured":"Mittal, P., Olumofin, F., Troncoso, C., Borisov, N., Goldberg, I.: PIR-Tor: scalable anonymous communication using private information retrieval. In: 20th USENIX Security Symposium (USENIX Security 2011) (2011)"},{"key":"6_CR41","doi-asserted-by":"crossref","unstructured":"Mughees, M.H., Chen, H., Ren, L.: OnionPIR: response efficient single-server PIR. In: Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security, CCS 2021 (2021)","DOI":"10.1145\/3460120.3485381"},{"key":"6_CR42","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 2018 (2018)","DOI":"10.1145\/3243734.3243821"},{"key":"6_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1007\/978-3-540-85174-5_31","volume-title":"Advances in Cryptology - CRYPTO 2008","author":"C Peikert","year":"2008","unstructured":"Peikert, C., Vaikuntanathan, V., Waters, B.: A framework for efficient and composable oblivious transfer. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 554\u2013571. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85174-5_31"},{"key":"6_CR44","doi-asserted-by":"publisher","unstructured":"Peikert, C., Waters, B.: Lossy trapdoor functions and their applications. In: Ladner, R.E., Dwork, C. (eds.) 40th Annual ACM Symposium on Theory of Computing, Victoria, BC, Canada,\u00a017\u201320 May 2008, pp. 187\u2013196. ACM Press (2008). https:\/\/doi.org\/10.1145\/1374376.1374406","DOI":"10.1145\/1374376.1374406"},{"key":"6_CR45","doi-asserted-by":"publisher","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: Gabow, H.N., Fagin, R. (eds.) 37th Annual ACM Symposium on Theory of Computing, Baltimore, MA, USA,\u00a022\u201324 May 2005, pp. 84\u201393. ACM Press (2005). https:\/\/doi.org\/10.1145\/1060590.1060603","DOI":"10.1145\/1060590.1060603"},{"key":"6_CR46","unstructured":"The reference implementation of SimplePIR and DoublePIR (2023). https:\/\/github.com\/ahenzinger\/simplepir"},{"key":"6_CR47","unstructured":"Thomas, K., et al.: Protecting accounts from credential stuffing with password breach alerting. In: Heninger, N., Traynor, P. (eds.) 28th USENIX Security Symposium, USENIX Security 2019, Santa Clara, CA, USA, 14\u201316 August 2019 (2019)"},{"key":"6_CR48","unstructured":"Tiptoe\u2019s linearly homomorphic encryption scheme (2023). https:\/\/github.com\/ahenzinger\/underhood"},{"key":"6_CR49","unstructured":"Tor: The tor project. https:\/\/www.torproject.org\/"},{"key":"6_CR50","doi-asserted-by":"crossref","unstructured":"Vershynin, R.: High-Dimensional Probability: An Introduction with Applications in Data Science, vol.\u00a047. Cambridge University Press, Cambridge (2018)","DOI":"10.1017\/9781108231596"},{"key":"6_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1007\/978-3-031-30545-0_18","volume-title":"Advances in Cryptology - EUROCRYPT 2023, Part I","author":"K Yeo","year":"2023","unstructured":"Yeo, K.: Lower bounds for (batch) PIR with private preprocessing. In: Hazay, C., Stam, M. (eds.) EUROCRYPT 2023, Part I. LNCS, vol. 14004, pp. 518\u2013550. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-30545-0_18"},{"key":"6_CR52","doi-asserted-by":"publisher","unstructured":"Zhou, M., Park, A., Zheng, W., Shi, E.: Piano: extremely simple, single-server PIR with sublinear server computation. In: 2024 IEEE Symposium on Security and Privacy (SP), Los Alamitos, CA, USA, p. 55. IEEE Computer Society, May 2024. https:\/\/doi.org\/10.1109\/SP54263.2024.00055. https:\/\/doi.ieeecomputersociety.org\/10.1109\/SP54263.2024.00055","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_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,15]],"date-time":"2024-08-15T23:03:32Z","timestamp":1723763012000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-68400-5_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031683992","9783031684005"],"references-count":52,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-68400-5_6","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"}}]}}