{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T10:59:27Z","timestamp":1778065167207,"version":"3.51.4"},"publisher-location":"Cham","reference-count":74,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031786754","type":"print"},{"value":"9783031786761","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-78676-1_1","type":"book-chapter","created":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T06:49:19Z","timestamp":1740120559000},"page":"3-23","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Goldfish: No More Attacks on\u00a0Ethereum?!"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8190-8664","authenticated-orcid":false,"given":"Francesco","family":"D\u2019Amato","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9777-6168","authenticated-orcid":false,"given":"Joachim","family":"Neu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6061-9700","authenticated-orcid":false,"given":"Ertem Nusret","family":"Tas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1460-5900","authenticated-orcid":false,"given":"David","family":"Tse","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,2,22]]},"reference":[{"key":"1_CR1","unstructured":"Maximal extractable value (MEV) (2023). https:\/\/ethereum.org\/en\/developers\/docs\/mev\/"},{"key":"1_CR2","unstructured":"Abraham, I., Gueta, G., Malkhi, D., Alvisi, L., Kotla, R., Martin, J.P.: Revisiting fast practical Byzantine fault tolerance. arXiv:1712.01367v1 [cs.DC] (2017). http:\/\/arxiv.org\/abs\/1712.01367v1"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Abraham, I., Malkhi, D., Nayak, K., Ren, L., Yin, M.: Sync HotStuff: simple and practical synchronous state machine replication. In: SP, pp. 106\u2013118. IEEE (2020)","DOI":"10.1109\/SP40000.2020.00044"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Badertscher, C., Gazi, P., Kiayias, A., Russell, A., Zikas, V.: Ouroboros Genesis: Composable proof-of-stake blockchains with dynamic availability. In: CCS, pp. 913\u2013930. ACM (2018)","DOI":"10.1145\/3243734.3243848"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Bagaria, V.K., Kannan, S., Tse, D., Fanti, G., Viswanath, P.: Prism: Deconstructing the blockchain to approach physical limits. In: CCS, pp. 585\u2013602. ACM (2019)","DOI":"10.1145\/3319535.3363213"},{"key":"1_CR6","unstructured":"Beekhuizen, C., Schwarz-Schilling, C., D\u2019Amato, F.: Change fork choice rule to mitigate balancing and reorging attacks (2021). https:\/\/ethresear.ch\/t\/change-fork-choice-rule-to-mitigate-balancing-and-reorging-attacks\/11127"},{"key":"1_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/3-540-48405-1_28","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 99","author":"M Bellare","year":"1999","unstructured":"Bellare, M., Miner, S.K.: A forward-secure digital signature scheme. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 431\u2013448. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48405-1_28"},{"issue":"4","key":"1_CR8","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s00145-004-0314-9","volume":"17","author":"D Boneh","year":"2004","unstructured":"Boneh, D., Lynn, B., Shacham, H.: Short signatures from the Weil pairing. J. Cryptol. 17(4), 297\u2013319 (2004)","journal-title":"J. Cryptol."},{"key":"1_CR9","unstructured":"Boneh, D., Shoup, V.: A graduate course in applied cryptography (2015). http:\/\/cryptobook.us\/, version 0.6, posted Jan. 14, 2023"},{"key":"1_CR10","unstructured":"Bowe, S.: BLS12-381: New zk-SNARK elliptic curve construction (2017). https:\/\/electriccoin.co\/blog\/new-snark-curve\/"},{"key":"1_CR11","unstructured":"Buchman, E., Kwon, J., Milosevic, Z.: The latest gossip on BFT consensus. arXiv:1807.04938v3 (2018). http:\/\/arxiv.org\/abs\/1807.04938v3"},{"key":"1_CR12","unstructured":"Buterin, V.: A CBC Casper tutorial (2018). https:\/\/vitalik.eth.limo\/general\/2018\/12\/05\/cbc_casper.html"},{"key":"1_CR13","unstructured":"Buterin, V.: Proposal for mitigation against balancing attacks to LMD GHOST (2020). https:\/\/notes.ethereum.org\/@vbuterin\/lmd_ghost_mitigation"},{"key":"1_CR14","unstructured":"Buterin, V., Griffith, V.: Casper the friendly finality gadget. arXiv:1710.09437v4 (2017). http:\/\/arxiv.org\/abs\/1710.09437v4"},{"key":"1_CR15","unstructured":"Buterin, V., et al.: Combining GHOST and Casper. arXiv:2003.03052v3 [cs.CR] (2020). http:\/\/arxiv.org\/abs\/2003.03052v3"},{"key":"1_CR16","unstructured":"Buterin, V., Stewart, A.: Beacon chain Casper mini-spec (comments #17, #19) (2018). https:\/\/ethresear.ch\/t\/beacon-chain-casper-mini-spec\/2760\/17"},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Carlsten, M., Kalodner, H.A., Weinberg, S.M., Narayanan, A.: On the instability of Bitcoin without the block reward. In: CCS, pp. 154\u2013167. ACM (2016)","DOI":"10.1145\/2976749.2978408"},{"key":"1_CR18","unstructured":"Castro, M., Liskov, B.: Practical Byzantine fault tolerance. In: OSDI, pp. 173\u2013186. USENIX Association (1999)"},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"Chan, B.Y., Shi, E.: Streamlet: Textbook streamlined blockchains. In: AFT, pp. 1\u201311. ACM (2020)","DOI":"10.1145\/3419614.3423256"},{"key":"1_CR20","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":"1_CR21","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":"1_CR22","doi-asserted-by":"crossref","unstructured":"Daian, P., et al.: Flash Boys 2.0: frontrunning in decentralized exchanges, miner extractable value, and consensus instability. In: SP, pp. 910\u2013927. IEEE (2020)","DOI":"10.1109\/SP40000.2020.00040"},{"key":"1_CR23","unstructured":"D\u2019Amato, F., Neu, J., Tas, E.N., Tse, D.: Goldfish: no more attacks on Ethereum?! Cryptology ePrint Archive, Paper 2022\/1171 (2022). https:\/\/eprint.iacr.org\/2022\/1171"},{"key":"1_CR24","unstructured":"D\u2019Amato, F., Zanolini, L.: Recent latest message driven GHOST: balancing dynamic availability with asynchrony resilience. Cryptology ePrint Archive, Paper 2023\/279 (2023). https:\/\/eprint.iacr.org\/2023\/279"},{"key":"1_CR25","unstructured":"D\u2019Amato, F., Zanolini, L.: A simple single slot finality protocol for Ethereum. Cryptology ePrint Archive, Paper 2023\/280 (2023). https:\/\/eprint.iacr.org\/2023\/280"},{"key":"1_CR26","unstructured":"Das, N., Tsao, T., Loon, P.V., Potuz, Kirkham, K., He, J.: Post-mortem report: Ethereum mainnet finality (05\/11\/2023) (2023). https:\/\/offchain.medium.com\/post-mortem-report-ethereum-mainnet-finality-05-11-2023-95e271dfd8b2"},{"key":"1_CR27","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":"1_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/978-3-540-30580-4_28","volume-title":"Public Key Cryptography - PKC 2005","author":"Y Dodis","year":"2005","unstructured":"Dodis, Y., Yampolskiy, A.: A verifiable random function with short proofs and keys. In: Vaudenay, S. (ed.) PKC 2005. LNCS, vol. 3386, pp. 416\u2013431. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-30580-4_28"},{"key":"1_CR29","doi-asserted-by":"crossref","unstructured":"Duan, S., Zhang, H.: Foundations of dynamic BFT. In: SP, pp. 1317\u20131334. IEEE (2022)","DOI":"10.1109\/SP46214.2022.9833787"},{"issue":"7","key":"1_CR30","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1145\/3212998","volume":"61","author":"I Eyal","year":"2018","unstructured":"Eyal, I., Sirer, E.G.: Majority is not enough: Bitcoin mining is vulnerable. Commun. ACM 61(7), 95\u2013102 (2018)","journal-title":"Commun. ACM"},{"key":"1_CR31","unstructured":"Fitzi, M., Ga\u017ei, P., Kiayias, A., Russell, A.: Parallel chains: improving throughput and latency of blockchain protocols via parallel composition. Cryptology ePrint Archive, Paper 2018\/1119 (2018). https:\/\/eprint.iacr.org\/2018\/1119"},{"key":"1_CR32","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":"1_CR33","doi-asserted-by":"crossref","unstructured":"Gilad, Y., Hemo, R., Micali, S., Vlachos, G., Zeldovich, N.: Algorand: scaling byzantine agreements for cryptocurrencies. In: SOSP, pp. 51\u201368. ACM (2017)","DOI":"10.1145\/3132747.3132757"},{"issue":"2","key":"1_CR34","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1145\/564585.564601","volume":"33","author":"S Gilbert","year":"2002","unstructured":"Gilbert, S., Lynch, N.A.: Brewer\u2019s conjecture and the feasibility of consistent, available, partition-tolerant web services. SIGACT News 33(2), 51\u201359 (2002)","journal-title":"SIGACT News"},{"key":"1_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-662-64331-0_4","volume-title":"Financial Cryptography and Data Security","author":"V Goyal","year":"2021","unstructured":"Goyal, V., Li, H., Raizes, J.: Instant block confirmation in the sleepy model. In: Borisov, N., Diaz, C. (eds.) FC 2021. LNCS, vol. 12675, pp. 65\u201383. Springer, Heidelberg (2021). https:\/\/doi.org\/10.1007\/978-3-662-64331-0_4"},{"key":"1_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/3-540-44647-8_20","volume-title":"Advances in Cryptology \u2014 CRYPTO 2001","author":"G Itkis","year":"2001","unstructured":"Itkis, G., Reyzin, L.: Forward-secure signatures with optimal signing and verifying. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 332\u2013354. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44647-8_20"},{"key":"1_CR37","unstructured":"Kane, D., Fackler, A., G\u0105gol, A., Straszak, D.: Highway: efficient consensus with flexible finality. arXiv:2101.02159v2 (2021). http:\/\/arxiv.org\/abs\/2101.02159v2"},{"key":"1_CR38","doi-asserted-by":"crossref","unstructured":"Katz, J., Lindell, Y.: Introduction to Modern Cryptography, 2nd edn. CRC Press (2014)","DOI":"10.1201\/b17668"},{"key":"1_CR39","doi-asserted-by":"crossref","unstructured":"Khanchandani, P., Wattenhofer, R.: Brief announcement: Byzantine agreement with unknown participants and failures. In: PODC, pp. 178\u2013180. ACM (2020)","DOI":"10.1145\/3382734.3405740"},{"key":"1_CR40","doi-asserted-by":"crossref","unstructured":"Khanchandani, P., Wattenhofer, R.: Byzantine agreement with unknown participants and failures. In: IPDPS, pp. 952\u2013961. IEEE (2021)","DOI":"10.1109\/IPDPS49936.2021.00104"},{"key":"1_CR41","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. LNCS, vol. 10401, pp. 357\u2013388. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63688-7_12"},{"key":"1_CR42","unstructured":"Kiffer, L., Neu, J., Sridhar, S., Zohar, A., Tse, D.: Security\u2013throughput tradeoff of Nakamoto consensus under bandwidth constraints. In: CCS. ACM (2024). https:\/\/eprint.iacr.org\/2023\/381"},{"key":"1_CR43","doi-asserted-by":"crossref","unstructured":"Kotla, R., Alvisi, L., Dahlin, M., Clement, A., Wong, E.L.: Zyzzyva: speculative Byzantine fault tolerance. ACM Trans. Comput. Syst. 27(4), 7:1\u20137:39 (2009)","DOI":"10.1145\/1658357.1658358"},{"key":"1_CR44","doi-asserted-by":"publisher","unstructured":"Lewis-Pye, A., Roughgarden, T.: Byzantine generals in the permissionless setting. In: Baldimtsi, F., Cachin, C. (eds.) FC (1). LNCS, vol. 13950, pp. 21\u201337. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-47754-6_2","DOI":"10.1007\/978-3-031-47754-6_2"},{"key":"1_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/978-3-319-70278-0_17","volume-title":"Financial Cryptography and Data Security","author":"K Liao","year":"2017","unstructured":"Liao, K., Katz, J.: Incentivizing blockchain forks via whale transactions. In: Brenner, M., et al. (eds.) FC 2017. LNCS, vol. 10323, pp. 264\u2013279. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70278-0_17"},{"key":"1_CR46","unstructured":"Losa, G., Gafni, E.: Consensus in the unknown-participation message-adversary model. arXiv:2301.04817v2 (2023). http:\/\/arxiv.org\/abs\/2301.04817v2"},{"key":"1_CR47","unstructured":"Malkhi, D., Momose, A., Ren, L.: Byzantine consensus under fully fluctuating participation. Cryptology ePrint Archive, Paper 2022\/1448, Version 20221024:011919 (2022). https:\/\/eprint.iacr.org\/archive\/2022\/1448\/20221024:011919"},{"key":"1_CR48","unstructured":"Malkhi, D., Momose, A., Ren, L.: Instant finality in Byzantine generals with unknown and dynamic participation (2022). https:\/\/blog.chain.link\/instant-finality-in-byzantine-generals-with-unknown-and-dynamic-participation\/"},{"key":"1_CR49","doi-asserted-by":"crossref","unstructured":"Malkhi, D., Momose, A., Ren, L.: Towards practical sleepy BFT. In: CCS, pp. 490\u2013503. ACM (2023)","DOI":"10.1145\/3576915.3623073"},{"key":"1_CR50","doi-asserted-by":"crossref","unstructured":"Micali, S., Rabin, M.O., Vadhan, S.P.: Verifiable random functions. In: FOCS, pp. 120\u2013130. IEEE Computer Society (1999)","DOI":"10.1109\/SFFCS.1999.814584"},{"key":"1_CR51","doi-asserted-by":"crossref","unstructured":"Momose, A., Ren, L.: Constant latency in sleepy consensus. In: CCS, pp. 2295\u20132308. ACM (2022)","DOI":"10.1145\/3548606.3559347"},{"key":"1_CR52","unstructured":"Nakamoto, S.: Bitcoin: A Peer-to-Peer Electronic Cash System (2008). https:\/\/bitcoin.org\/bitcoin.pdf"},{"key":"1_CR53","unstructured":"Nakamura, R.: Analysis of bouncing attack on FFG (2019). https:\/\/ethresear.ch\/t\/analysis-of-bouncing-attack-on-ffg\/6113"},{"key":"1_CR54","unstructured":"Nakamura, R.: Prevention of bouncing attack on FFG (2019). https:\/\/ethresear.ch\/t\/prevention-of-bouncing-attack-on-ffg\/6114"},{"key":"1_CR55","doi-asserted-by":"crossref","unstructured":"Neu, J., Sridhar, S., Yang, L., Tse, D., Alizadeh, M.: Longest chain consensus under bandwidth constraint. In: AFT, pp. 126\u2013147. ACM (2022)","DOI":"10.1145\/3558535.3559777"},{"key":"1_CR56","unstructured":"Neu, J., Tas, E.N., Tse, D.: Short paper: accountable safety implies finality. Financial Cryptography and Data Security 2024 (2024). https:\/\/eprint.iacr.org\/2023\/1301"},{"key":"1_CR57","unstructured":"Neu, J., Tas, E.N., Tse, D.: A balancing attack on Gasper, the current candidate for Eth2\u2019s beacon chain (2020). https:\/\/ethresear.ch\/t\/a-balancing-attack-on-gasper-the-current-candidate-for-eth2s-beacon-chain\/8079"},{"key":"1_CR58","unstructured":"Neu, J., Tas, E.N., Tse, D.: Snap-and-Chat protocols: System aspects. arXiv:2010.10447v1 (2020). http:\/\/arxiv.org\/abs\/2010.10447v1"},{"key":"1_CR59","unstructured":"Neu, J., Tas, E.N., Tse, D.: Attacking Gasper without adversarial network delay (2021). https:\/\/ethresear.ch\/t\/attacking-gasper-without-adversarial-network-delay\/10187"},{"key":"1_CR60","doi-asserted-by":"crossref","unstructured":"Neu, J., Tas, E.N., Tse, D.: Ebb-and-Flow protocols: a resolution of the availability-finality dilemma. In: SP, pp. 446\u2013465. IEEE (2021)","DOI":"10.1109\/SP40001.2021.00045"},{"key":"1_CR61","doi-asserted-by":"publisher","unstructured":"Neu, J., Tas, E.N., Tse, D.: The availability-accountability dilemma and its resolution via accountability gadgets. In: Eyal, I., Garay, J. (eds.) Financial Cryptography. LNCS, vol. 13411, pp. 541\u2013559. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-18283-9_27","DOI":"10.1007\/978-3-031-18283-9_27"},{"key":"1_CR62","doi-asserted-by":"publisher","unstructured":"Neu, J., Tas, E.N., Tse, D.: Two more attacks on proof-of-stake GHOST\/Ethereum. In: Proceedings of the 2022 ACM Workshop on Developments in Consensus. ConsensusDay 2022, ACM (2022). https:\/\/doi.org\/10.1145\/3560829.3563560","DOI":"10.1145\/3560829.3563560"},{"key":"1_CR63","unstructured":"Nijkerk, M.: Ethereum briefly stopped finalizing transactions. What happened? (2023). https:\/\/www.coindesk.com\/tech\/2023\/05\/17\/ethereums-loss-of-finality-what-happened\/"},{"key":"1_CR64","unstructured":"O\u2019Connor, J., Aumasson, J.P., Neves, S., Wilcox-O\u2019Hearn, Z.: BLAKE3 (2020). https:\/\/github.com\/BLAKE3-team\/BLAKE3-specs\/blob\/ea51a3ac997288bf690ee82ac9cfc8b3e0e60f2a\/blake3.pdf"},{"key":"1_CR65","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1007\/978-3-319-70697-9_14","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"R Pass","year":"2017","unstructured":"Pass, R., Shi, E.: The sleepy model of consensus. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10625, pp. 380\u2013409. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70697-9_14"},{"key":"1_CR66","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":"1_CR67","unstructured":"Pu, Y., Alvisi, L., Eyal, I.: Safe permissionless consensus. In: DISC. LIPIcs, vol.\u00a0246, pp. 33:1\u201333:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022)"},{"key":"1_CR68","unstructured":"Pu, Y., Farahbakhsh, A., Alvisi, L., Eyal, I.: Gorilla: Safe permissionless Byzantine consensus. In: DISC. LIPIcs, vol.\u00a0281, pp. 31:1\u201331:16. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2023)"},{"key":"1_CR69","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-662-64331-0_5","volume-title":"Financial Cryptography and Data Security","author":"S Sankagiri","year":"2021","unstructured":"Sankagiri, S., Wang, X., Kannan, S., Viswanath, P.: Blockchain CAP theorem allows user-dependent adaptivity and finality. In: Borisov, N., Diaz, C. (eds.) FC 2021. LNCS, vol. 12675, pp. 84\u2013103. Springer, Heidelberg (2021). https:\/\/doi.org\/10.1007\/978-3-662-64331-0_5"},{"key":"1_CR70","doi-asserted-by":"publisher","unstructured":"Schwarz-Schilling, C., Neu, J., Monnot, B., Asgaonkar, A., Tas, E.N., Tse, D.: Three attacks on proof-of-stake Ethereum. In: Eyal, I., Garay, J. (eds.) Financial Cryptography and Data Security. LNCS, vol. 13411, pp. 560\u2013576. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-18283-9_28","DOI":"10.1007\/978-3-031-18283-9_28"},{"key":"1_CR71","doi-asserted-by":"crossref","unstructured":"Sheng, P., Wang, G., Nayak, K., Kannan, S., Viswanath, P.: BFT protocol forensics. In: CCS, pp. 1722\u20131743. ACM (2021)","DOI":"10.1145\/3460120.3484566"},{"key":"1_CR72","doi-asserted-by":"publisher","unstructured":"Sheng, P., Wang, G., Nayak, K., Kannan, S., Viswanath, P.: Player-replaceability and forensic support are two sides of the same (crypto) coin. In: FC (1). LNCS, vol. 13950, pp. 56\u201374. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-47754-6_4","DOI":"10.1007\/978-3-031-47754-6_4"},{"key":"1_CR73","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/978-3-662-47854-7_32","volume-title":"Financial Cryptography and Data Security","author":"Y Sompolinsky","year":"2015","unstructured":"Sompolinsky, Y., Zohar, A.: Secure high-rate transaction processing in Bitcoin. In: B\u00f6hme, R., Okamoto, T. (eds.) FC 2015. LNCS, vol. 8975, pp. 507\u2013527. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47854-7_32"},{"key":"1_CR74","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","Financial Cryptography and Data Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-78676-1_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T06:49:46Z","timestamp":1740120586000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-78676-1_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031786754","9783031786761"],"references-count":74,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-78676-1_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"22 February 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Financial Cryptography and Data Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Willemstad","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cura\u00e7ao","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":"5 March 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 March 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fc2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/fc24.ifca.ai\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}