{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,28]],"date-time":"2026-05-28T02:37:55Z","timestamp":1779935875262,"version":"3.53.1"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031683909","type":"print"},{"value":"9783031683916","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-68391-6_9","type":"book-chapter","created":{"date-parts":[[2024,8,16]],"date-time":"2024-08-16T19:02:14Z","timestamp":1723834934000},"page":"289-324","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["FRIDA: Data Availability Sampling from\u00a0FRI"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0195-6659","authenticated-orcid":false,"given":"Mathias","family":"Hall-Andersen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7325-5261","authenticated-orcid":false,"given":"Mark","family":"Simkin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4620-7264","authenticated-orcid":false,"given":"Benedikt","family":"Wagner","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,8,17]]},"reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-3-662-64331-0_15","volume-title":"Financial Cryptography and Data Security","author":"M Al-Bassam","year":"2021","unstructured":"Al-Bassam, M., Sonnino, A., Buterin, V., Khoffi, I.: Fraud and data availability proofs: detecting invalid blocks in light clients. In: Borisov, N., Diaz, C. (eds.) FC 2021. LNCS, vol. 12675, pp. 279\u2013298. Springer, Heidelberg (2021). https:\/\/doi.org\/10.1007\/978-3-662-64331-0_15"},{"key":"9_CR2","doi-asserted-by":"publisher","unstructured":"Ateniese, G., et al.: Provable data possession at untrusted stores. In: Ning, P., De Capitani di Vimercati, S., Syverson, P.F. (eds.) ACM CCS 2007, pp. 598\u2013609. ACM Press (Oct 2007). https:\/\/doi.org\/10.1145\/1315245.1315318","DOI":"10.1145\/1315245.1315318"},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/978-3-031-48621-0_13","volume-title":"Theory of Cryptography: 21st International Conference, TCC 2023, Taipei, Taiwan, November 29\u2013December 2, 2023, Proceedings, Part III","author":"D Balb\u00e1s","year":"2023","unstructured":"Balb\u00e1s, D., Catalano, D., Fiore, D., Lai, R.W.F.: Chainable functional commitments for\u00a0unbounded-depth circuits. In: Rothblum, G., Wee, H. (eds.) Theory of Cryptography: 21st International Conference, TCC 2023, Taipei, Taiwan, November 29\u2013December 2, 2023, Proceedings, Part III, pp. 363\u2013393. Springer Nature Switzerland, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-48621-0_13"},{"key":"9_CR4","doi-asserted-by":"publisher","unstructured":"Ben-Sasson, E., Bentov, I., Horesh, Y., Riabzev, M.: Fast reed-solomon interactive oracle proofs of proximity. In: Chatzigiannakis, I., Kaklamanis, C., Marx, D., Sannella, D. (eds.) ICALP 2018. LIPIcs, vol.\u00a0107, pp. 14:1\u201314:17. Schloss Dagstuhl (Jul 2018). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2018.14","DOI":"10.4230\/LIPIcs.ICALP.2018.14"},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1007\/978-3-030-26954-8_23","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019: 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18\u201322, 2019, Proceedings, Part III","author":"E Ben-Sasson","year":"2019","unstructured":"Ben-Sasson, E., Bentov, I., Horesh, Y., Riabzev, M.: Scalable zero knowledge with no trusted setup. In: Boldyreva, A., Micciancio, D. (eds.) Advances in Cryptology \u2013 CRYPTO 2019: 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18\u201322, 2019, Proceedings, Part III, pp. 701\u2013732. Springer International Publishing, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_23"},{"key":"9_CR6","doi-asserted-by":"publisher","unstructured":"Ben-Sasson, E., Carmon, D., Ishai, Y., Kopparty, S., Saraf, S.: Proximity gaps for reed-solomon codes. In: 61st FOCS, pp. 900\u2013909. IEEE Computer Society Press (Nov 2020). https:\/\/doi.org\/10.1109\/FOCS46700.2020.00088","DOI":"10.1109\/FOCS46700.2020.00088"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Ben-Sasson, E., Carmon, D., Ishai, Y., Kopparty, S., Saraf, S.: Proximity gaps for reed-solomon codes. Cryptology ePrint Archive, Report 2020\/654 (2020). https:\/\/eprint.iacr.org\/2020\/654","DOI":"10.1109\/FOCS46700.2020.00088"},{"key":"9_CR8","unstructured":"Ben-Sasson, E., Chiesa, A., Gabizon, A., Riabzev, M., Spooner, N.: Short interactive oracle proofs with constant query complexity, via composition and sumcheck. Cryptology ePrint Archive, Report 2016\/324 (2016). https:\/\/eprint.iacr.org\/2016\/324"},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1007\/978-3-030-36033-7_19","volume-title":"Theory of Cryptography: 17th International Conference, TCC 2019, Nuremberg, Germany, December 1\u20135, 2019, Proceedings, Part II","author":"E Ben-Sasson","year":"2019","unstructured":"Ben-Sasson, E., Chiesa, A., Goldberg, L., Gur, T., Riabzev, M., Spooner, N.: Linear-size constant-query iops for delegating computation. In: Hofheinz, D., Rosen, A. (eds.) Theory of Cryptography: 17th International Conference, TCC 2019, Nuremberg, Germany, December 1\u20135, 2019, Proceedings, Part II, pp. 494\u2013521. Springer International Publishing, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-36033-7_19"},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-3-030-17653-2_4","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019: 38th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Darmstadt, Germany, May 19\u201323, 2019, Proceedings, Part I","author":"E Ben-Sasson","year":"2019","unstructured":"Ben-Sasson, E., Chiesa, A., Riabzev, M., Spooner, N., Virza, M., Ward, N.P.: Aurora: transparent succinct arguments for R1CS. In: Ishai, Y., Rijmen, V. (eds.) Advances in Cryptology \u2013 EUROCRYPT 2019: 38th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Darmstadt, Germany, May 19\u201323, 2019, Proceedings, Part I, pp. 103\u2013128. Springer International Publishing, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17653-2_4"},{"key":"9_CR11","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-662-53644-5_2","volume-title":"Theory of Cryptography: 14th International Conference, TCC 2016-B, Beijing, China, October 31-November 3, 2016, Proceedings, Part II","author":"E Ben-Sasson","year":"2016","unstructured":"Ben-Sasson, E., Chiesa, A., Spooner, N.: Interactive oracle proofs. In: Hirt, M., Smith, A. (eds.) Theory of Cryptography: 14th International Conference, TCC 2016-B, Beijing, China, October 31-November 3, 2016, Proceedings, Part II, pp. 31\u201360. Springer Berlin Heidelberg, Berlin, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53644-5_2"},{"key":"9_CR12","doi-asserted-by":"publisher","unstructured":"Ben-Sasson, E., Goldberg, L., Kopparty, S., Saraf, S.: DEEP-FRI: sampling outside the box improves soundness. In: Vidick, T. (ed.) ITCS 2020, vol.\u00a0151, pp. 5:1\u20135:32. LIPIcs (Jan 2020). https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2020.5","DOI":"10.4230\/LIPIcs.ITCS.2020.5"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Block, A.R., Garreta, A., Katz, J., Thaler, J., Tiwari, P.R., Zaj\u0105c, M.: Fiat-shamir security of fri and related snarks. Cryptology ePrint Archive, Paper 2023\/1071 (2023). https:\/\/eprint.iacr.org\/2023\/1071","DOI":"10.1007\/978-981-99-8724-5_1"},{"key":"9_CR14","unstructured":"Boneh, D., Nguyen, W., Ozdemir, A.: Efficient functional commitments: How to commit to private functions. Cryptology ePrint Archive, Report 2021\/1342 (2021). https:\/\/eprint.iacr.org\/2021\/1342"},{"key":"9_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/11561927_42","volume-title":"Distributed Computing","author":"C Cachin","year":"2005","unstructured":"Cachin, C., Tessaro, S.: Asynchronous verifiable information dispersal. In: Fraigniaud, P. (ed.) DISC 2005. LNCS, vol. 3724, pp. 503\u2013504. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11561927_42"},{"key":"9_CR16","doi-asserted-by":"publisher","unstructured":"Canetti, R., et al.: Fiat-Shamir: from practice to theory. In: Charikar, M., Cohen, E. (eds.) 51st ACM STOC, pp. 1082\u20131090. ACM Press (Jun 2019). https:\/\/doi.org\/10.1145\/3313276.3316380","DOI":"10.1145\/3313276.3316380"},{"key":"9_CR17","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-3-642-38348-9_17","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"D Cash","year":"2013","unstructured":"Cash, D., K\u00fcp\u00e7\u00fc, A., Wichs, D.: Dynamic proofs of retrievability via oblivious RAM. In: Johansson, T., Nguyen, P.Q. (eds.) Advances in Cryptology \u2013 EUROCRYPT 2013, pp. 279\u2013295. Springer Berlin Heidelberg, Berlin, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_17"},{"key":"9_CR18","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-031-30620-4_10","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2023: 42nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Lyon, France, April 23-27, 2023, Proceedings, Part III","author":"L de Castro","year":"2023","unstructured":"de Castro, L., Peikert, C.: Functional commitments for\u00a0all functions, with\u00a0transparent setup and\u00a0from SIS. In: Hazay, C., Stam, M. (eds.) Advances in Cryptology \u2013 EUROCRYPT 2023: 42nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Lyon, France, April 23-27, 2023, Proceedings, Part III, pp. 287\u2013320. Springer Nature Switzerland, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30620-4_10"},{"key":"9_CR19","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-3-031-22972-5_6","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2022: 28th International Conference on the Theory and Application of Cryptology and Information Security, Taipei, Taiwan, December 5\u20139, 2022, Proceedings, Part IV","author":"D Catalano","year":"2022","unstructured":"Catalano, D., Fiore, D., Tucker, I.: Additive-homomorphic functional commitments and\u00a0applications to\u00a0homomorphic signatures. In: Agrawal, S., Lin, D. (eds.) Advances in Cryptology \u2013 ASIACRYPT 2022: 28th International Conference on the Theory and Application of Cryptology and Information Security, Taipei, Taiwan, December 5\u20139, 2022, Proceedings, Part IV, pp. 159\u2013188. Springer Nature Switzerland, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22972-5_6"},{"key":"9_CR20","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1007\/978-3-030-45721-1_27","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020: 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zagreb, Croatia, May 10\u201314, 2020, Proceedings, Part I","author":"A Chiesa","year":"2020","unstructured":"Chiesa, A., Ojha, D., Spooner, N.: Fractal: post-quantum and transparent recursive proofs from holography. In: Canteaut, A., Ishai, Y. (eds.) Advances in Cryptology \u2013 EUROCRYPT 2020: 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zagreb, Croatia, May 10\u201314, 2020, Proceedings, Part I, pp. 769\u2013793. Springer International Publishing, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_27"},{"key":"9_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-642-00457-5_8","volume-title":"Theory of Cryptography","author":"Y Dodis","year":"2009","unstructured":"Dodis, Y., Vadhan, S., Wichs, D.: Proofs of retrievability via hardness amplification. In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 109\u2013127. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00457-5_8"},{"key":"9_CR22","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-319-96881-0_2","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018: 38th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19\u201323, 2018, Proceedings, Part II","author":"G Fuchsbauer","year":"2018","unstructured":"Fuchsbauer, G., Kiltz, E., Loss, J.: The algebraic group model and its applications. In: Shacham, H., Boldyreva, A. (eds.) Advances in Cryptology \u2013 CRYPTO 2018: 38th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19\u201323, 2018, Proceedings, Part II, pp. 33\u201362. Springer International Publishing, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96881-0_2"},{"key":"9_CR23","doi-asserted-by":"publisher","unstructured":"Gentry, C., Wichs, D.: Separating succinct non-interactive arguments from all falsifiable assumptions. In: Fortnow, L., Vadhan, S.P. (eds.) 43rd ACM STOC, pp. 99\u2013108. ACM Press (Jun 2011). https:\/\/doi.org\/10.1145\/1993636.1993651","DOI":"10.1145\/1993636.1993651"},{"key":"9_CR24","unstructured":"Hab\u00f6ck, U.: A summary on the FRI low degree test. Cryptology ePrint Archive, Report 2022\/1216 (2022). https:\/\/eprint.iacr.org\/2022\/1216"},{"key":"9_CR25","unstructured":"Hall-Andersen, M., Simkin, M., Wagner, B.: Foundations of data availability sampling. Cryptology ePrint Archive, Paper 2023\/1079 (2023). https:\/\/eprint.iacr.org\/2023\/1079"},{"key":"9_CR26","doi-asserted-by":"crossref","unstructured":"Hall-Andersen, M., Simkin, M., Wagner, B.: FRIDA: Data availability sampling from fri. Cryptology ePrint Archive, Paper 2024\/248 (2024). https:\/\/eprint.iacr.org\/2024\/248","DOI":"10.1007\/978-3-031-68391-6_9"},{"key":"9_CR27","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1007\/978-3-030-56880-1_18","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020: 40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17\u201321, 2020, Proceedings, Part II","author":"E Hauck","year":"2020","unstructured":"Hauck, E., Kiltz, E., Loss, J., Nguyen, N.K.: Lattice-based blind signatures, revisited. In: Micciancio, D., Ristenpart, T. (eds.) Advances in Cryptology \u2013 CRYPTO 2020: 40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17\u201321, 2020, Proceedings, Part II, pp. 500\u2013529. Springer International Publishing, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_18"},{"key":"9_CR28","doi-asserted-by":"publisher","unstructured":"Juels, A., Kaliski Jr., B.S.: Pors: proofs of retrievability for large files. In: Ning, P., De Capitani di Vimercati, S., Syverson, P.F. (eds.) ACM CCS 2007, pp. 584\u2013597. ACM Press (Oct 2007). https:\/\/doi.org\/10.1145\/1315245.1315317","DOI":"10.1145\/1315245.1315317"},{"key":"9_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-642-17373-8_11","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"A Kate","year":"2010","unstructured":"Kate, A., Zaverucha, G.M., Goldberg, I.: Constant-size commitments to polynomials and their applications. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol. 6477, pp. 177\u2013194. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17373-8_11"},{"key":"9_CR30","doi-asserted-by":"publisher","unstructured":"Libert, B., Ramanna, S.C., Yung, M.: Functional commitment schemes: from polynomial commitments to pairing-based accumulators from simple assumptions. In: Chatzigiannakis, I., Mitzenmacher, M., Rabani, Y., Sangiorgi, D. (eds.) ICALP 2016. LIPIcs, vol.\u00a055, pp. 30:1\u201330:14. Schloss Dagstuhl (Jul 2016). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2016.30","DOI":"10.4230\/LIPIcs.ICALP.2016.30"},{"key":"9_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/3-540-48184-2_32","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201987","author":"RC Merkle","year":"1988","unstructured":"Merkle, R.C.: A digital signature based on a conventional encryption function. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol. 293, pp. 369\u2013378. Springer, Heidelberg (1988). https:\/\/doi.org\/10.1007\/3-540-48184-2_32"},{"key":"9_CR32","unstructured":"Nazirkhanova, K., Neu, J., Tse, D.: Information dispersal with provable retrievability for rollups. Cryptology ePrint Archive, Report 2021\/1544 (2021). https:\/\/eprint.iacr.org\/2021\/1544"},{"key":"9_CR33","doi-asserted-by":"publisher","unstructured":"Rabin, M.O.: Efficient dispersal of information for security, load balancing, and fault tolerance. J. ACM 36(2), 335\u2013348 (1989). https:\/\/doi.org\/10.1145\/62044.62050","DOI":"10.1145\/62044.62050"},{"key":"9_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/978-3-540-89255-7_7","volume-title":"Advances in Cryptology - ASIACRYPT 2008","author":"H Shacham","year":"2008","unstructured":"Shacham, H., Waters, B.: Compact proofs of retrievability. In: Pieprzyk, J. (ed.) ASIACRYPT 2008. LNCS, vol. 5350, pp. 90\u2013107. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-89255-7_7"},{"key":"9_CR35","doi-asserted-by":"publisher","unstructured":"Shi, E., Stefanov, E., Papamanthou, C.: Practical dynamic proofs of retrievability. In: Sadeghi, A.R., Gligor, V.D., Yung, M. (eds.) ACM CCS 2013, pp. 325\u2013336. ACM Press (Nov 2013). https:\/\/doi.org\/10.1145\/2508859.2516669","DOI":"10.1145\/2508859.2516669"},{"key":"9_CR36","unstructured":"StarkWare: ethSTARK documentation. Cryptology ePrint Archive, Report 2021\/582 (2021). https:\/\/eprint.iacr.org\/2021\/582"},{"key":"9_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-78524-8_1","volume-title":"Theory of Cryptography","author":"P Valiant","year":"2008","unstructured":"Valiant, P.: Incrementally verifiable computation or proofs of knowledge imply time\/space efficiency. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 1\u201318. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78524-8_1"},{"key":"9_CR38","unstructured":"Vlasov, A., Panarin, K.: Transparent polynomial commitment scheme with polylogarithmic communication complexity. Cryptology ePrint Archive, Report 2019\/1020 (2019). https:\/\/eprint.iacr.org\/2019\/1020"},{"key":"9_CR39","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/978-3-031-30620-4_13","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2023: 42nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Lyon, France, April 23-27, 2023, Proceedings, Part III","author":"H Wee","year":"2023","unstructured":"Wee, H., Wu, D.J.: Succinct vector, polynomial, and\u00a0functional commitments from\u00a0lattices. In: Hazay, C., Stam, M. (eds.) Advances in Cryptology \u2013 EUROCRYPT 2023: 42nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Lyon, France, April 23-27, 2023, Proceedings, Part III, pp. 385\u2013416. Springer Nature Switzerland, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30620-4_13"}],"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-68391-6_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T15:03:56Z","timestamp":1730214236000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-68391-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031683909","9783031683916"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-68391-6_9","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":"17 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"}}]}}