{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T10:50:09Z","timestamp":1743072609604,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031786754"},{"type":"electronic","value":"9783031786761"}],"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_3","type":"book-chapter","created":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T06:50:42Z","timestamp":1740120642000},"page":"41-50","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Short Paper: Accountable Safety Implies Finality"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9777-6168","authenticated-orcid":false,"given":"Joachim","family":"Neu","sequence":"first","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":"3_CR1","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":"3_CR2","doi-asserted-by":"crossref","unstructured":"Buchman, E., Guerraoui, R., Komatovic, J., Milosevic, Z., Seredinschi, D., Widder, J.: Revisiting Tendermint: design tradeoffs, accountability, and practical use. In: DSN (Supplements), pp. 11\u201314. IEEE (2022)","DOI":"10.1109\/DSN-S54099.2022.00014"},{"key":"3_CR3","unstructured":"Buterin, V., Griffith, V.: Casper the friendly finality gadget. arXiv:1710.09437v4 [cs.CR] (2017). http:\/\/arxiv.org\/abs\/1710.09437v4"},{"key":"3_CR4","unstructured":"Buterin, V., et al.: Combining GHOST and Casper. arXiv:2003.03052v3 [cs.CR] (2020). http:\/\/arxiv.org\/abs\/2003.03052v3"},{"key":"3_CR5","unstructured":"Castro, M., Liskov, B.: Practical Byzantine fault tolerance. In: OSDI, pp. 173\u2013186. USENIX Association (1999)"},{"key":"3_CR6","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":"3_CR7","doi-asserted-by":"crossref","unstructured":"Civit, P., Gilbert, S., Gramoli, V.: Polygraph: accountable Byzantine agreement. In: ICDCS, pp. 403\u2013413. IEEE (2021)","DOI":"10.1109\/ICDCS51616.2021.00046"},{"key":"3_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/978-3-030-57990-6_2","volume-title":"Security and Cryptography for Networks","author":"T Dinsdale-Young","year":"2020","unstructured":"Dinsdale-Young, T., Magri, B., Matt, C., Nielsen, J.B., Tschudi, D.: Afgjort: a partially synchronous finality layer for blockchains. In: Galdi, C., Kolesnikov, V. (eds.) SCN 2020. LNCS, vol. 12238, pp. 24\u201344. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-57990-6_2"},{"issue":"4","key":"3_CR9","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1137\/0212045","volume":"12","author":"D Dolev","year":"1983","unstructured":"Dolev, D., Strong, H.R.: Authenticated algorithms for Byzantine agreement. SIAM J. Comput. 12(4), 656\u2013666 (1983)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"3_CR10","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1145\/42282.42283","volume":"35","author":"C Dwork","year":"1988","unstructured":"Dwork, C., Lynch, N.A., Stockmeyer, L.J.: Consensus in the presence of partial synchrony. J. ACM 35(2), 288\u2013323 (1988)","journal-title":"J. ACM"},{"issue":"2","key":"3_CR11","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"MJ Fischer","year":"1985","unstructured":"Fischer, M.J., Lynch, N.A., Paterson, M.: Impossibility of distributed consensus with one faulty process. J. ACM 32(2), 374\u2013382 (1985)","journal-title":"J. ACM"},{"issue":"2","key":"3_CR12","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":"3_CR13","doi-asserted-by":"crossref","unstructured":"Haeberlen, A., Kouznetsov, P., Druschel, P.: PeerReview: practical accountability for distributed systems. In: SOSP, pp. 175\u2013188. ACM (2007)","DOI":"10.1145\/1323293.1294279"},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-3-642-10877-8_10","volume-title":"Principles of Distributed Systems","author":"A Haeberlen","year":"2009","unstructured":"Haeberlen, A., Kuznetsov, P.: The fault detection problem. In: Abdelzaher, T., Raynal, M., Santoro, N. (eds.) OPODIS 2009. LNCS, vol. 5923, pp. 99\u2013114. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10877-8_10"},{"key":"3_CR15","unstructured":"Hirt, M., Kastrati, A., Liu-Zhang, C.: Multi-threshold asynchronous reliable broadcast and consensus. In: OPODIS. LIPIcs, vol.\u00a0184, pp. 6:1\u20136:16. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020)"},{"key":"3_CR16","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-031-47754-6_2","volume-title":"FC 2023","author":"A Lewis-Pye","year":"2023","unstructured":"Lewis-Pye, A., Roughgarden, T.: Byzantine generals in the permissionless setting. In: Baldimtsi, F., Cachin, C. (eds.) FC 2023. LNCS, vol. 13950, pp. 21\u201337. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-47754-6_2"},{"key":"3_CR17","volume-title":"Distributed Algorithms","author":"NA Lynch","year":"1996","unstructured":"Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann, San Francisco (1996)"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Momose, A., Ren, L.: Multi-threshold Byzantine fault tolerance. In: CCS, pp. 1686\u20131699. ACM (2021)","DOI":"10.1145\/3460120.3484554"},{"key":"3_CR19","unstructured":"Nakamura, R.: Hierarchical finality gadget (2020). https:\/\/ethresear.ch\/t\/hierarchical-finality-gadget\/6829"},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"Neu, J., Sridhar, S., Yang, L., Tse, D.: Optimal flexible consensus and its application to Ethereum. In: SP. IEEE (2024). https:\/\/eprint.iacr.org\/2023\/1211","DOI":"10.1109\/SP54263.2024.00135"},{"key":"3_CR21","unstructured":"Neu, J., Tas, E.N., Tse, D.: Snap-and-chat protocols: system aspects. arXiv:2010.10447v1 [cs.CR] (2020). http:\/\/arxiv.org\/abs\/2010.10447v1"},{"key":"3_CR22","unstructured":"Neu, J., Tas, E.N., Tse, D.: The availability-accountability dilemma and its resolution via accountability gadgets. arXiv:2105.06075v3 [cs.CR] (2021). http:\/\/arxiv.org\/abs\/2105.06075v3"},{"key":"3_CR23","unstructured":"Neu, J., Tas, E.N., Tse, D.: The availability-accountability dilemma and its resolution via accountability gadgets. arXiv:2105.06075v1 [cs.CR] (2021). http:\/\/arxiv.org\/abs\/2105.06075v1"},{"key":"3_CR24","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":"3_CR25","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/978-3-031-18283-9_27","volume-title":"FC 2022","author":"J Neu","year":"2022","unstructured":"Neu, J., Tas, E.N., Tse, D.: The availability-accountability dilemma and its resolution via accountability gadgets. In: Eyal, I., Garay, J. (eds.) FC 2022. LNCS, vol. 13411, pp. 541\u2013559. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-18283-9_27"},{"key":"3_CR26","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":"3_CR27","unstructured":"Ranchal-Pedrosa, A., Gramoli, V.: Blockchain is dead, long live blockchain! Accountable state machine replication for longlasting blockchain. arXiv:2007.10541v2 [cs.DC] (2020). http:\/\/arxiv.org\/abs\/2007.10541v2"},{"key":"3_CR28","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":"3_CR29","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":"3_CR30","unstructured":"Skidanov, A.: Fast finality and resilience to long range attacks with proof of space-time and Casper-like finality gadget (2019). https:\/\/docs.near.org\/vi\/assets\/files\/PoST-dadcf9287d98201817066853315db91f.pdf"},{"key":"3_CR31","unstructured":"Stewart, A., Kokoris-Kogias, E.: GRANDPA: a Byzantine finality gadget. arXiv:2007.01560v1 [cs.DC] (2020). http:\/\/arxiv.org\/abs\/2007.01560v1"},{"key":"3_CR32","unstructured":"The Babylon Team: Bitcoin staking: Unlocking 21M Bitcoins to secure the proof-of-stake economy (2023). https:\/\/docs.babylonchain.io\/papers\/btc_staking_litepaper.pdf"}],"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_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T06:52:18Z","timestamp":1740120738000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-78676-1_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031786754","9783031786761"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-78676-1_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"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"}}]}}