{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T01:25:51Z","timestamp":1777857951489,"version":"3.51.4"},"publisher-location":"Cham","reference-count":51,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031587337","type":"print"},{"value":"9783031587344","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-58734-4_3","type":"book-chapter","created":{"date-parts":[[2024,4,30]],"date-time":"2024-04-30T11:12:08Z","timestamp":1714475528000},"page":"64-95","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Asymptotically Optimal Message Dissemination with\u00a0Applications to\u00a0Blockchains"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0349-3838","authenticated-orcid":false,"given":"Chen-Da","family":"Liu-Zhang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5900-336X","authenticated-orcid":false,"given":"Christian","family":"Matt","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6931-4740","authenticated-orcid":false,"given":"S\u00f8ren Eller","family":"Thomsen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,5,1]]},"reference":[{"key":"3_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":"3_CR2","doi-asserted-by":"crossref","unstructured":"Apostolaki, M., Zohar, A., Vanbever, L.: Hijacking bitcoin: routing attacks on cryptocurrencies. In: IEEE Symposium on Security and Privacy, pp. 375\u2013392. IEEE (2017)","DOI":"10.1109\/SP.2017.29"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/3-540-69053-0_33","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 1997","author":"N Bari\u0107","year":"1997","unstructured":"Bari\u0107, N., Pfitzmann, B.: Collision-free accumulators and fail-stop signature schemes without trees. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 480\u2013494. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-69053-0_33"},{"key":"3_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/978-3-030-77883-5_15","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"C Baum","year":"2021","unstructured":"Baum, C., David, B., Dowsley, R., Nielsen, J.B., Oechsner, S.: TARDIS: a foundation of time-lock puzzles in UC. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12698, pp. 429\u2013459. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77883-5_15"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/3-540-48285-7_24","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 1993","author":"J Benaloh","year":"1994","unstructured":"Benaloh, J., de Mare, M.: One-way accumulators: a decentralized alternative to digital signatures. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol. 765, pp. 274\u2013285. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-48285-7_24"},{"key":"3_CR6","doi-asserted-by":"publisher","unstructured":"Bhangale, A., Liu-Zhang, CD., Loss, J., Nayak, K.: Efficient adaptively-secure byzantine agreement for long messages. In: Agrawal, S., Lin, D. (eds.) Advances in Cryptology. ASIACRYPT 2022. LNCS, vol. 13791, pp. 504\u2013525. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22963-3_17","DOI":"10.1007\/978-3-031-22963-3_17"},{"key":"3_CR7","doi-asserted-by":"publisher","unstructured":"Blum, E., Boyle, E., Cohen, R., Liu-Zhang, C.D.: Communication lower bounds for cryptographic broadcast protocols. In: Oshman, R. (ed.) 37th International Symposium on Distributed Computing (DISC 2023). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0281, pp. 10:1\u201310:19. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2023). https:\/\/doi.org\/10.4230\/LIPIcs.DISC.2023.10","DOI":"10.4230\/LIPIcs.DISC.2023.10"},{"key":"3_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1007\/978-3-642-36594-2_21","volume-title":"Theory of Cryptography","author":"E Boyle","year":"2013","unstructured":"Boyle, E., Goldwasser, S., Tessaro, S.: Communication locality in secure multi-party computation. In: Sahai, A. (ed.) TCC 2013. LNCS, vol. 7785, pp. 356\u2013376. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36594-2_21"},{"issue":"5","key":"3_CR9","doi-asserted-by":"publisher","first-page":"28:1","DOI":"10.1145\/3402457","volume":"67","author":"R Canetti","year":"2020","unstructured":"Canetti, R.: Universally composable security. J. ACM 67(5), 28:1-28:94 (2020)","journal-title":"J. ACM"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Chandran, N., Chongchitmate, W., Garay, J.A., Goldwasser, S., Ostrovsky, R., Zikas, V.: The hidden graph model: communication locality and optimal resiliency with adaptive faults. In: Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, pp. 153\u2013162 (2015)","DOI":"10.1145\/2688073.2688102"},{"key":"3_CR11","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/j.tcs.2019.02.001","volume":"777","author":"J Chen","year":"2019","unstructured":"Chen, J., Micali, S.: Algorand: a secure and efficient distributed ledger. Theor. Comput. Sci. 777, 155\u2013183 (2019)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Coretti, S., Kiayias, A., Moore, C., Russell, A.: The generals\u2019 scuttlebutt: Byzantine-resilient gossip protocols. In: CCS, pp. 595\u2013608. ACM (2022)","DOI":"10.1145\/3548606.3560638"},{"key":"3_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-030-32101-7_2","volume-title":"Financial Cryptography and Data Security","author":"P Daian","year":"2019","unstructured":"Daian, P., Pass, R., Shi, E.: Snow White: robustly reconfigurable consensus and applications to provably secure proof of stake. In: Goldberg, I., Moore, T. (eds.) FC 2019. LNCS, vol. 11598, pp. 23\u201341. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-32101-7_2"},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/978-3-319-78375-8_3","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"B David","year":"2018","unstructured":"David, B., Ga\u017ei, P., Kiayias, A., Russell, A.: Ouroboros Praos: an adaptively-secure, semi-synchronous proof-of-stake blockchain. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10821, pp. 66\u201398. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78375-8_3"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Demers, A., et al.: Epidemic algorithms for replicated database maintenance. In: Proceedings of the Sixth Annual ACM Symposium on Principles of Distributed Computing, pp. 1\u201312 (1987)","DOI":"10.1145\/41840.41841"},{"key":"3_CR16","unstructured":"Didier, F.: Efficient erasure decoding of Reed-Solomon codes. CoRR abs\/0901.1886 (2009)"},{"key":"3_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-642-22012-8_40","volume-title":"Automata, Languages and Programming","author":"B Doerr","year":"2011","unstructured":"Doerr, B., Fouz, M.: Asymptotically optimal randomized rumor spreading. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011. LNCS, vol. 6756, pp. 502\u2013513. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22012-8_40"},{"key":"3_CR18","doi-asserted-by":"publisher","unstructured":"Fadhil, M., Owenson, G., Adda, M.: A bitcoin model for evaluation of clustering to improve propagation delay in bitcoin network. In: 2016 IEEE International Conference on Computational Science and Engineering (CSE) and IEEE International Conference on Embedded and Ubiquitous Computing (EUC) and 15th International Symposium on Distributed Computing and Applications for Business Engineering (DCABES), pp. 468\u2013475 (2016). https:\/\/doi.org\/10.1109\/CSE-EUC-DCABES.2016.226","DOI":"10.1109\/CSE-EUC-DCABES.2016.226"},{"issue":"4","key":"3_CR19","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1002\/rsa.3240010406","volume":"1","author":"U Feige","year":"1990","unstructured":"Feige, U., Peleg, D., Raghavan, P., Upfal, E.: Randomized broadcast in networks. Random Struct. Algorithms 1(4), 447\u2013460 (1990)","journal-title":"Random Struct. Algorithms"},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"Fitzi, M., Hirt, M.: Optimally efficient multi-valued byzantine agreement. In: Proceedings of the Twenty-fifth Annual ACM Symposium on Principles of Distributed Computing, pp. 163\u2013168 (2006)","DOI":"10.1145\/1146381.1146407"},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"Ganesh, C., Patra, A.: Broadcast extensions with optimal communication and round complexity. In: Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, pp. 371\u2013380 (2016)","DOI":"10.1145\/2933057.2933082"},{"key":"3_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/978-3-662-46803-6_10","volume-title":"Advances in Cryptology - EUROCRYPT 2015","author":"J Garay","year":"2015","unstructured":"Garay, J., Kiayias, A., Leonardos, N.: The bitcoin backbone protocol: analysis and applications. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9057, pp. 281\u2013310. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46803-6_10"},{"key":"3_CR23","doi-asserted-by":"publisher","unstructured":"Gervais, A., Ritzdorf, H., Karame, G.O., Capkun, S.: Tampering with the delivery of blocks and transactions in bitcoin. In: Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, pp. 692-705. CCS 2015, Association for Computing Machinery, New York, NY, USA (2015). https:\/\/doi.org\/10.1145\/2810103.2813655","DOI":"10.1145\/2810103.2813655"},{"key":"3_CR24","doi-asserted-by":"crossref","unstructured":"Guo, B., Lu, Y., Lu, Z., Tang, Q., Xu, J., Zhang, Z.: Speeding dumbo: pushing asynchronous BFT closer to practice. Cryptology ePrint Archive (2022)","DOI":"10.14722\/ndss.2022.24385"},{"key":"3_CR25","unstructured":"Heilman, E., Kendler, A., Zohar, A., Goldberg, S.: Eclipse attacks on bitcoin\u2019s peer-to-peer network. In: USENIX Security Symposium, pp. 129\u2013144. USENIX Association (2015)"},{"key":"3_CR26","doi-asserted-by":"crossref","unstructured":"Kaklamanis, I., Yang, L., Alizadeh, M.: Poster: coded broadcast for scalable leader-based BFT consensus. In: CCS, pp. 3375\u20133377. ACM (2022)","DOI":"10.1145\/3548606.3563494"},{"key":"3_CR27","doi-asserted-by":"crossref","unstructured":"Karp, R., Schindelhauer, C., Shenker, S., Vocking, B.: Randomized rumor spreading. In: Proceedings 41st Annual Symposium on Foundations of Computer Science, pp. 565\u2013574. IEEE (2000)","DOI":"10.1109\/SFCS.2000.892324"},{"issue":"3","key":"3_CR28","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1109\/TPDS.2003.1189583","volume":"14","author":"A Kermarrec","year":"2003","unstructured":"Kermarrec, A., Massouli\u00e9, L., Ganesh, A.J.: Probabilistic reliable dissemination in large-scale systems. IEEE Trans. Parallel Distrib. Syst. 14(3), 248\u2013258 (2003)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"3_CR29","doi-asserted-by":"crossref","unstructured":"Liu-Zhang, C., Matt, C., Maurer, U., Rito, G., Thomsen, S.E.: Practical provably secure flooding for blockchains (2022)","DOI":"10.1007\/978-3-031-22963-3_26"},{"key":"3_CR30","unstructured":"Liu-Zhang, C.D., Matt, C., Thomsen, S.E.: Asymptotically optimal message dissemination with applications to blockchains. Cryptology ePrint Archive, Paper 2022\/1723 (2022). https:\/\/eprint.iacr.org\/2022\/1723"},{"key":"3_CR31","doi-asserted-by":"crossref","unstructured":"Lu, Y., Lu, Z., Tang, Q., Wang, G.: Dumbo-MVBA: optimal multi-valued validated asynchronous byzantine agreement, revisited. In: Proceedings of the 39th Symposium on Principles of Distributed Computing, pp. 129\u2013138 (2020)","DOI":"10.1145\/3382734.3405707"},{"key":"3_CR32","unstructured":"Marcus, Y., Heilman, E., Goldberg, S.: Low-resource eclipse attacks on Ethereum\u2019s peer-to-peer network (2018). https:\/\/eprint.iacr.org\/2018\/236"},{"key":"3_CR33","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1007\/978-3-031-15979-4_14","volume-title":"Advances in Cryptology - CRYPTO 2022","author":"C Matt","year":"2022","unstructured":"Matt, C., Nielsen, J.B., Thomsen, S.E.: Formalizing delayed adaptive corruptions and the security of flooding networks. In: Dodis, Y., Shrimpton, T. (eds.) Advances in Cryptology - CRYPTO 2022, pp. 400\u2013430. Springer Nature, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_14"},{"key":"3_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/978-3-540-74143-5_8","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"U Maurer","year":"2007","unstructured":"Maurer, U., Pietrzak, K., Renner, R.: Indistinguishability amplification. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 130\u2013149. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74143-5_8"},{"key":"3_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/0-387-34805-0_21","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 89 Proceedings","author":"RC Merkle","year":"1990","unstructured":"Merkle, R.C.: A certified digital signature. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 218\u2013238. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34805-0_21"},{"key":"3_CR36","unstructured":"Nakamoto, S.: Bitcoin: a peer-to-peer electronic cash system. Decent. Bus. Rev. 21260 (2008)"},{"key":"3_CR37","unstructured":"Nayak, K., Ren, L., Shi, E., Vaidya, N.H., Xiang, Z.: Improved extension protocols for byzantine broadcast and agreement. In: DISC (2020)"},{"key":"3_CR38","doi-asserted-by":"crossref","unstructured":"Nazirkhanova, K., Neu, J., Tse, D.: Information dispersal with provable retrievability for rollups. arXiv preprint arXiv:2111.12323 (2021)","DOI":"10.1145\/3558535.3559778"},{"key":"3_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/978-3-540-30574-3_19","volume-title":"Topics in Cryptology \u2013 CT-RSA 2005","author":"L Nguyen","year":"2005","unstructured":"Nguyen, L.: Accumulators from bilinear pairings and applications. In: Menezes, A. (ed.) CT-RSA 2005. LNCS, vol. 3376, pp. 275\u2013292. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-30574-3_19"},{"key":"3_CR40","doi-asserted-by":"crossref","unstructured":"\u00d6z\u00e7elik, I., Medury, S., Broaddus, J.T., Skjellum, A.: An overview of cryptographic accumulators. In: ICISSP, pp. 661\u2013669. SCITEPRESS (2021)","DOI":"10.5220\/0010337806610669"},{"key":"3_CR41","doi-asserted-by":"crossref","unstructured":"Pass, R., Shi, E.: Fruitchains: a fair blockchain. In: PODC, pp. 315\u2013324. ACM (2017)","DOI":"10.1145\/3087801.3087809"},{"key":"3_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-78375-8_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"R Pass","year":"2018","unstructured":"Pass, R., Shi, E.: Thunderella: blockchains with optimistic instant confirmation. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10821, pp. 3\u201333. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78375-8_1"},{"key":"3_CR43","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1137\/0108018","volume":"8","author":"IS Reed","year":"1960","unstructured":"Reed, I.S., Solomon, G.: Polynomial codes over certain finite fields. J. Soc. Ind. Appl. Math. 8, 300\u2013304 (1960)","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"3_CR44","doi-asserted-by":"crossref","unstructured":"Rohrer, E., Tschorsch, F.: Kadcast: a structured approach to broadcast in blockchain networks. In: AFT, pp. 199\u2013213. ACM (2019)","DOI":"10.1145\/3318041.3355469"},{"key":"3_CR45","doi-asserted-by":"crossref","unstructured":"Tran, M., Choi, I., Moon, G.J., Vu, A.V., Kang, M.S.: A stealthier partitioning attack against bitcoin peer-to-peer network. In: IEEE Symposium on Security and Privacy, pp. 894\u2013909. IEEE (2020)","DOI":"10.1109\/SP40000.2020.00027"},{"key":"3_CR46","doi-asserted-by":"publisher","unstructured":"Tsimos, G., Loss, J., Papamanthou, C.: Gossiping for communication-efficient broadcast. In: Dodis, Y., Shrimpton, T. (eds.) Advances in Cryptology. CRYPTO 2022. LNCS, vol. 13509, pp. 439\u2013469. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15982-4_15","DOI":"10.1007\/978-3-031-15982-4_15"},{"issue":"2","key":"3_CR47","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0020-0190(84)90027-9","volume":"18","author":"R Turpin","year":"1984","unstructured":"Turpin, R., Coan, B.A.: Extending binary byzantine agreement to multivalued byzantine agreement. Inf. Process. Lett. 18(2), 73\u201376 (1984)","journal-title":"Inf. Process. Lett."},{"key":"3_CR48","series-title":"Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-3-030-23943-5_3","volume-title":"Emerging Technologies in Computing","author":"H Vu","year":"2019","unstructured":"Vu, H., Tewari, H.: An efficient peer-to-peer bitcoin protocol with probabilistic flooding. In: Miraz, M.H., Excell, P.S., Ware, A., Soomro, S., Ali, M. (eds.) iCETiC 2019. LNICST, vol. 285, pp. 29\u201345. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-23943-5_3"},{"issue":"2014","key":"3_CR49","first-page":"1","volume":"151","author":"G Wood","year":"2014","unstructured":"Wood, G., et al.: Ethereum: a secure decentralised generalised transaction ledger. Ethereum Project Yellow Paper 151(2014), 1\u201332 (2014)","journal-title":"Ethereum Project Yellow Paper"},{"key":"3_CR50","unstructured":"Yang, L., Park, S.J., Alizadeh, M., Kannan, S., Tse, D.: DispersedLedger: High-Throughput byzantine consensus on variable bandwidth networks. In: 19th USENIX Symposium on Networked Systems Design and Implementation (NSDI 22), pp. 493\u2013512 (2022)"},{"key":"3_CR51","doi-asserted-by":"crossref","unstructured":"Yin, M., Malkhi, D., Reiter, M.K., Golan-Gueta, G., Abraham, I.: Hotstuff: BFT consensus with linearity and responsiveness. In: PODC, pp. 347\u2013356. ACM (2019)","DOI":"10.1145\/3293611.3331591"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-58734-4_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T00:04:21Z","timestamp":1777507461000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-58734-4_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031587337","9783031587344"],"references-count":51,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-58734-4_3","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":"1 May 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUROCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Zurich","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Switzerland","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":"26 May 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 May 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"43","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.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"}]}}