{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T17:57:14Z","timestamp":1770227834021,"version":"3.49.0"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031159787","type":"print"},{"value":"9783031159794","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-15979-4_14","type":"book-chapter","created":{"date-parts":[[2022,10,12]],"date-time":"2022-10-12T16:25:31Z","timestamp":1665591931000},"page":"400-430","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Formalizing\u00a0Delayed\u00a0Adaptive\u00a0Corruptions and\u00a0the\u00a0Security of\u00a0Flooding Networks"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5900-336X","authenticated-orcid":false,"given":"Christian","family":"Matt","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7074-0683","authenticated-orcid":false,"given":"Jesper Buus","family":"Nielsen","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":[[2022,10,13]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Abraham, I., et al.: Communication complexity of Byzantine agreement, revisited. In: PODC, pp. 317\u2013326. ACM (2019)","DOI":"10.1145\/3293611.3331629"},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-030-64381-2_1","volume-title":"Theory of Cryptography","author":"C Badertscher","year":"2020","unstructured":"Badertscher, C., Canetti, R., Hesse, J., Tackmann, B., Zikas, V.: Universal composition with global subroutines: capturing global setup within plain UC. In: Pass, R., Pietrzak, K. (eds.) TCC 2020. LNCS, vol. 12552, pp. 1\u201330. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64381-2_1"},{"key":"14_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/978-3-319-63688-7_11","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"C Badertscher","year":"2017","unstructured":"Badertscher, C., Maurer, U., Tschudi, D., Zikas, V.: Bitcoin as a transaction ledger: a composable treatment. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10401, pp. 324\u2013356. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63688-7_11"},{"key":"14_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"},{"issue":"2","key":"14_CR5","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1145\/312203.312207","volume":"17","author":"KP Birman","year":"1999","unstructured":"Birman, K.P., Hayden, M., \u00d6zkasap, \u00d6., Xiao, Z., Budiu, M., Minsky, Y.: Bimodal multicast. ACM Trans. Comput. Syst. 17(2), 41\u201388 (1999). https:\/\/doi.org\/10.1145\/312203.312207","journal-title":"ACM Trans. Comput. Syst."},{"key":"14_CR6","series-title":"Cambridge Studies in Advanced Mathematics","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814068","volume-title":"Random Graphs","author":"B Bollob\u00e1s","year":"2001","unstructured":"Bollob\u00e1s, B.: Random Graphs. Cambridge Studies in Advanced Mathematics, vol. 73, 2nd edn. Cambridge University Press, Cambridge (2001)","edition":"2"},{"key":"14_CR7","doi-asserted-by":"publisher","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: Proceedings of 42nd FOCS, Las Vegas, NV, USA, 14\u201317 October 2001, pp. 136\u2013145. IEEE Computer Society Press (2001). https:\/\/doi.org\/10.1109\/SFCS.2001.959888","DOI":"10.1109\/SFCS.2001.959888"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security. J. ACM 67(5), 28:1\u201328:94 (2020)","DOI":"10.1145\/3402457"},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-540-70936-7_4","volume-title":"Theory of Cryptography","author":"R Canetti","year":"2007","unstructured":"Canetti, R., Dodis, Y., Pass, R., Walfish, S.: Universally composable security with global setup. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol. 4392, pp. 61\u201385. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-70936-7_4"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Canetti, R., Hogan, K., Malhotra, A., Varia, M.: A universally composable treatment of network time. In: CSF, pp. 360\u2013375. IEEE Computer Society (2017)","DOI":"10.1109\/CSF.2017.38"},{"key":"14_CR11","doi-asserted-by":"publisher","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: Roughgarden, T. (ed.) ITCS 2015, Rehovot, Israel, 11\u201313 January 2015, pp. 153\u2013162. ACM (2015). https:\/\/doi.org\/10.1145\/2688073.2688102","DOI":"10.1145\/2688073.2688102"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Coretti, S., Kiayias, A., Moore, C., Russell, A.: The generals\u2019 scuttlebutt: Byzantine-resilient gossip protocols. Cryptology ePrint Archive, Report 2022\/541 (2022). https:\/\/ia.cr\/2022\/541","DOI":"10.1145\/3548606.3560638"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"Cris\u00f3stomo, S., Schilcher, U., Bettstetter, C., Barros, J.: Analysis of probabilistic flooding: how do we choose the right coin? In: ICC, pp. 1\u20136. IEEE (2009)","DOI":"10.1109\/ICC.2009.5198745"},{"key":"14_CR14","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":"14_CR15","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, Part II. LNCS, vol. 10821, pp. 66\u201398. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78375-8_3"},{"key":"14_CR16","doi-asserted-by":"publisher","unstructured":"Demers, A.J., et al.: Epidemic algorithms for replicated database maintenance. In: Schneider, F.B. (ed.) 6th ACM PODC, Vancouver, BC, Canada, 10\u201312 August 1987, pp. 1\u201312. ACM (1987). https:\/\/doi.org\/10.1145\/41840.41841","DOI":"10.1145\/41840.41841"},{"key":"14_CR17","unstructured":"Erd\u0151s, P., R\u00e9nyi, A.: On the evolution of random graphs. In: Publication of the Mathematical Institute of the Hungarian Academy of Sciences, pp. 17\u201361 (1960)"},{"key":"14_CR18","doi-asserted-by":"publisher","unstructured":"Garay, J.A., Katz, J., Kumaresan, R., Zhou, H.S.: Adaptively secure broadcast, revisited. In: Gavoille, C., Fraigniaud, P. (eds.) 30th ACM PODC, San Jose, CA, USA, 6\u20138 June 2011, pp. 179\u2013186. ACM (2011). https:\/\/doi.org\/10.1145\/1993806.1993832","DOI":"10.1145\/1993806.1993832"},{"key":"14_CR19","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, Part II. LNCS, vol. 9057, pp. 281\u2013310. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46803-6_10"},{"key":"14_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/978-3-319-63688-7_10","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"J Garay","year":"2017","unstructured":"Garay, J., Kiayias, A., Leonardos, N.: The bitcoin backbone protocol with chains of variable difficulty. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017, Part I. LNCS, vol. 10401, pp. 291\u2013323. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63688-7_10"},{"issue":"3","key":"14_CR21","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1145\/1143396.1143399","volume":"14","author":"ZJ Haas","year":"2006","unstructured":"Haas, Z.J., Halpern, J.Y., Li, L.: Gossip-based ad hoc routing. IEEE\/ACM Trans. Netw. 14(3), 479\u2013491 (2006). https:\/\/doi.org\/10.1145\/1143396.1143399","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"14_CR22","unstructured":"Heilman, E., Kendler, A., Zohar, A., Goldberg, S.: Eclipse attacks on bitcoin\u2019s peer-to-peer network. In: Jung, J., Holz, T. (eds.) USENIX Security 2015, Washington, DC, USA, 12\u201314 August 2015, pp. 129\u2013144. USENIX Association (2015)"},{"key":"14_CR23","doi-asserted-by":"crossref","unstructured":"Hu, R., Sopena, J., Arantes, L., Sens, P., Demeure, I.M.: Fair comparison of gossip algorithms over large-scale random topologies. In: SRDS, pp. 331\u2013340. IEEE Computer Society (2012)","DOI":"10.1109\/SRDS.2012.28"},{"key":"14_CR24","doi-asserted-by":"publisher","unstructured":"Karp, R.M., Schindelhauer, C., Shenker, S., V\u00f6cking, B.: Randomized rumor spreading. In: 41st FOCS, Redondo Beach, CA, USA, 12\u201314 November 2000, pp. 565\u2013574. IEEE Computer Society Press (2000). https:\/\/doi.org\/10.1109\/SFCS.2000.892324","DOI":"10.1109\/SFCS.2000.892324"},{"key":"14_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/978-3-642-36594-2_27","volume-title":"Theory of Cryptography","author":"J Katz","year":"2013","unstructured":"Katz, J., Maurer, U., Tackmann, B., Zikas, V.: Universally composable synchronous computation. In: Sahai, A. (ed.) TCC 2013. LNCS, vol. 7785, pp. 477\u2013498. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36594-2_27"},{"issue":"3","key":"14_CR26","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 Distributed Syst. 14(3), 248\u2013258 (2003)","journal-title":"IEEE Trans. Parallel Distributed Syst."},{"key":"14_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/978-3-319-63688-7_12","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"A Kiayias","year":"2017","unstructured":"Kiayias, A., Russell, A., David, B., Oliynykov, R.: Ouroboros: a provably secure proof-of-stake blockchain protocol. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017, Part I. LNCS, vol. 10401, pp. 357\u2013388. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63688-7_12"},{"key":"14_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1007\/978-3-662-49896-5_25","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"A Kiayias","year":"2016","unstructured":"Kiayias, A., Zhou, H.-S., Zikas, V.: Fair and robust multi-party computation using a global transaction ledger. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9666, pp. 705\u2013734. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_25"},{"key":"14_CR29","doi-asserted-by":"publisher","unstructured":"Kokoris-Kogias, E., Jovanovic, P., Gasser, L., Gailly, N., Syta, E., Ford, B.: OmniLedger: a secure, scale-out, decentralized ledger via sharding. In: 2018 IEEE Symposium on Security and Privacy, San Francisco, CA, USA, 21\u201323 May 2018, pp. 583\u2013598. IEEE Computer Society Press (2018). https:\/\/doi.org\/10.1109\/SP.2018.000-5","DOI":"10.1109\/SP.2018.000-5"},{"key":"14_CR30","unstructured":"Liu-Zhang, C.D., Matt, C., Maurer, U., Rito, G., Thomsen, S.E.: Practical provably secure flooding for blockchains. Cryptology ePrint Archive, Paper 2022\/608 (2022). https:\/\/eprint.iacr.org\/2022\/608"},{"key":"14_CR31","doi-asserted-by":"publisher","unstructured":"Luu, L., Narayanan, V., Zheng, C., Baweja, K., Gilbert, S., Saxena, P.: A secure sharding protocol for open blockchains. In: Weippl, E.R., Katzenbeisser, S., Kruegel, C., Myers, A.C., Halevi, S. (eds.) ACM CCS 2016, Vienna, Austria, 24\u201328 October 2016, pp. 17\u201330. ACM Press (2016). https:\/\/doi.org\/10.1145\/2976749.2978389","DOI":"10.1145\/2976749.2978389"},{"key":"14_CR32","unstructured":"Marcus, Y., Heilman, E., Goldberg, S.: Low-resource eclipse attacks on Ethereum\u2019s peer-to-peer network. Cryptology ePrint Archive, Report 2018\/236 (2018). https:\/\/eprint.iacr.org\/2018\/236"},{"key":"14_CR33","unstructured":"Matt, C., Nielsen, J.B., Thomsen, S.E.: Formalizing delayed adaptive corruptions and the security of flooding networks. Cryptology ePrint Archive, Paper 2022\/010 (2022). https:\/\/eprint.iacr.org\/2022\/010"},{"key":"14_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/3-540-45748-8_5","volume-title":"Peer-to-Peer Systems","author":"P Maymounkov","year":"2002","unstructured":"Maymounkov, P., Mazi\u00e8res, D.: Kademlia: a peer-to-peer information system based on the XOR metric. In: Druschel, P., Kaashoek, F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, pp. 53\u201365. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45748-8_5"},{"key":"14_CR35","unstructured":"Nakamoto, S.: Bitcoin: a peer-to-peer electronic cash system (2008)"},{"key":"14_CR36","unstructured":"Nielsen, J.B.: On protocol security in the cryptographic model. Ph.D. thesis, Aarhus University (2003)"},{"key":"14_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/978-3-319-56614-6_22","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"R Pass","year":"2017","unstructured":"Pass, R., Seeman, L., Shelat, A.: Analysis of the blockchain protocol in asynchronous networks. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017, Part II. LNCS, vol. 10211, pp. 643\u2013673. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56614-6_22"},{"key":"14_CR38","doi-asserted-by":"publisher","unstructured":"Pass, R., Shi, E.: Hybrid consensus: efficient consensus in the permissionless model. In: Richa, A.W. (ed.) 31st International Symposium on Distributed Computing, DISC 2017, Vienna, Austria, 16\u201320 October 2017. LIPIcs, vol. 91, pp. 39:1\u201339:16. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2017). https:\/\/doi.org\/10.4230\/LIPIcs.DISC.2017.39","DOI":"10.4230\/LIPIcs.DISC.2017.39"},{"key":"14_CR39","unstructured":"Ren, L.: Analysis of Nakamoto consensus. Cryptology ePrint Archive, Report 2019\/943 (2019). https:\/\/eprint.iacr.org\/2019\/943"},{"key":"14_CR40","doi-asserted-by":"publisher","unstructured":"Rohrer, E., Tschorsch, F.: Kadcast: a structured approach to broadcast in blockchain networks. In: Proceedings of the 1st ACM Conference on Advances in Financial Technologies, AFT 2019, Zurich, Switzerland, 21\u201323 October 2019, pp. 199\u2013213. ACM (2019). https:\/\/doi.org\/10.1145\/3318041.3355469","DOI":"10.1145\/3318041.3355469"},{"key":"14_CR41","doi-asserted-by":"publisher","unstructured":"Zamani, M., Movahedi, M., Raykova, M.: RapidChain: scaling blockchain via full sharding. In: Lie, D., Mannan, M., Backes, M., Wang, X. (eds.) ACM CCS 2018, Toronto, ON, Canada, 15\u201319 October 2018, pp. 931\u2013948. ACM Press (2018). https:\/\/doi.org\/10.1145\/3243734.3243853","DOI":"10.1145\/3243734.3243853"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2022"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-15979-4_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T22:03:32Z","timestamp":1760220212000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-15979-4_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031159787","9783031159794"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-15979-4_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"13 October 2022","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"42","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}