{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:05:38Z","timestamp":1726409138110},"publisher-location":"Cham","reference-count":40,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031182822"},{"type":"electronic","value":"9783031182839"}],"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-18283-9_27","type":"book-chapter","created":{"date-parts":[[2022,10,21]],"date-time":"2022-10-21T20:23:03Z","timestamp":1666383783000},"page":"541-559","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["The Availability-Accountability Dilemma and\u00a0Its Resolution\u00a0via\u00a0Accountability\u00a0Gadgets"],"prefix":"10.1007","author":[{"ORCID":"http:\/\/orcid.org\/0000-0002-9777-6168","authenticated-orcid":false,"given":"Joachim","family":"Neu","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0001-6061-9700","authenticated-orcid":false,"given":"Ertem Nusret","family":"Tas","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0003-1460-5900","authenticated-orcid":false,"given":"David","family":"Tse","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,10,22]]},"reference":[{"key":"27_CR1","unstructured":"Ethereum 2.0 networking specification (2021). https:\/\/github.com\/ethereum\/eth2.0-specs\/blob\/dev\/specs\/phase0\/p2p-interface.md"},{"key":"27_CR2","doi-asserted-by":"crossref","unstructured":"Badertscher, C., Ga\u017ei, P., Kiayias, A., Russell, A., Zikas, V.: Ouroboros genesis: composable proof-of-stake blockchains with dynamic availability. In: Conference on Computer and Communications Security, CCS 2018, pp. 913\u2013930. ACM (2018)","DOI":"10.1145\/3243734.3243848"},{"key":"27_CR3","unstructured":"Buchman, E., Kwon, J., Milosevic, Z.: The latest gossip on BFT consensus. arXiv:1807.04938 (2018)"},{"key":"27_CR4","unstructured":"Buterin, V., Griffith, V.: Casper the friendly finality gadget. arXiv:1710.09437 (2019)"},{"key":"27_CR5","unstructured":"Buterin, V., et al.: Combining GHOST and Casper. arXiv:2003.03052 (2020)"},{"key":"27_CR6","unstructured":"Castro, M., Liskov, B.: Practical byzantine fault tolerance. In: Symposium on Operating Systems Design and Implementation, OSDI 1999, pp. 173\u2013186. USENIX Association (1999)"},{"key":"27_CR7","doi-asserted-by":"crossref","unstructured":"Chan, B.Y., Shi, E.: Streamlet: textbook streamlined blockchains. In: Advances in Financial Technologies, AFT 2020, pp. 1\u201311. ACM (2020)","DOI":"10.1145\/3419614.3423256"},{"key":"27_CR8","unstructured":"Chen, J., Gorbunov, S., Micali, S., Vlachos, G.: ALGORAND AGREEMENT: Super fast and partition resilient Byzantine agreement. IACR Cryptology ePrint Archive, Report 2018\/377 (2018)"},{"key":"27_CR9","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. Theoret. Comput. Sci. 777, 155\u2013183 (2019)","journal-title":"Theoret. Comput. Sci."},{"key":"27_CR10","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":"27_CR11","unstructured":"Cohen, B., Pietrzak, K.: The Chia Network blockchain (2019). www.chia.net\/assets\/ChiaGreenPaper.pdf"},{"key":"27_CR12","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":"27_CR13","doi-asserted-by":"crossref","unstructured":"Dinsdale-Young, T., Magri, B., Matt, C., Nielsen, J., Tschudi, D.: Afgjort: a partially synchronous finality layer for blockchains. In: Conference on Security and Cryptography for Networks, SCN 2020, pp. 24\u201344. (2020)","DOI":"10.1007\/978-3-030-57990-6_2"},{"issue":"7","key":"27_CR14","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":"27_CR15","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":"27_CR16","doi-asserted-by":"crossref","unstructured":"Gelashvili, R., Kokoris-Kogias, L., Sonnino, A., Spiegelman, A., Xiang, Z.: Jolteon and Ditto: network-adaptive efficient consensus with asynchronous fallback. In: Financial Cryptography and Data Security. FC 2022 (2022)","DOI":"10.1007\/978-3-031-18283-9_14"},{"key":"27_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/978-3-030-26948-7_18","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"Y Guo","year":"2019","unstructured":"Guo, Y., Pass, R., Shi, E.: Synchronous, with a chance of partition tolerance. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11692, pp. 499\u2013529. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26948-7_18"},{"issue":"6","key":"27_CR18","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1145\/1323293.1294279","volume":"41","author":"A Haeberlen","year":"2007","unstructured":"Haeberlen, A., Kouznetsov, P., Druschel, P.: PeerReview: Practical accountability for distributed systems. SIGOPS Oper. Syst. Rev. 41(6), 175\u2013188 (2007)","journal-title":"SIGOPS Oper. Syst. Rev."},{"key":"27_CR19","doi-asserted-by":"crossref","unstructured":"Haeberlen, A., Kuznetsov, P.: The Fault Detection Problem. In: International Conference on Principles of Distributed Systems. OPODIS 2009 (2009)","DOI":"10.1007\/978-3-642-10877-8_10"},{"key":"27_CR20","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":"27_CR21","unstructured":"Lewis-Pye, A., Roughgarden, T.: Resource pools and the CAP theorem. arXiv:2006.10698 (2020)"},{"key":"27_CR22","doi-asserted-by":"crossref","unstructured":"Lewis-Pye, A., Roughgarden, T.: How does blockchain security dictate blockchain implementation? In: CCS, pp. 1006\u20131019. ACM (2021)","DOI":"10.1145\/3460120.3484752"},{"key":"27_CR23","unstructured":"Libra Association: Libra white paper (2020). https:\/\/www.libra.org\/en-US\/white-paper\/"},{"key":"27_CR24","unstructured":"Nakamoto, S.: Bitcoin: a peer-to-peer electronic cash system (2008). https:\/\/bitcoin.org\/bitcoin.pdf"},{"key":"27_CR25","unstructured":"Nakamura, R.: Analysis of bouncing attack on FFG (2019). http:\/\/ethresear.ch\/t\/analysis-of-bouncing-attack-on-ffg\/6113"},{"key":"27_CR26","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":"27_CR27","unstructured":"Neu, J., Tas, E.N., Tse, D.: Snap-and-chat protocols: system aspects. arXiv:2010.10447 (2020)"},{"key":"27_CR28","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":"27_CR29","doi-asserted-by":"crossref","unstructured":"Neu, J., Tas, E.N., Tse, D.: The availability-accountability dilemma and its resolution via accountability gadgets. arXiv:2105.06075 (2021)","DOI":"10.1007\/978-3-031-18283-9_27"},{"key":"27_CR30","doi-asserted-by":"crossref","unstructured":"Neu, J., Tas, E.N., Tse, D.: Ebb-and-flow protocols: a resolution of the availability-finality dilemma. In: IEEE Symposium on Security and Privacy, pp. 446\u2013465. IEEE (2021)","DOI":"10.1109\/SP40001.2021.00045"},{"key":"27_CR31","doi-asserted-by":"crossref","unstructured":"Neu, J., Tas, E.N., Tse, D.: Two attacks on proof-of-stake GHOST\/Ethereum. arXiv:2203.01315 (2022)","DOI":"10.1145\/3560829.3563560"},{"key":"27_CR32","doi-asserted-by":"crossref","unstructured":"Pass, R., Shi, E.: Rethinking large-scale consensus. In: Computer Security Foundations Symposium, CSF 2017, pp. 115\u2013129. IEEE (2017)","DOI":"10.1109\/CSF.2017.37"},{"key":"27_CR33","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":"27_CR34","unstructured":"Ranchal-Pedrosa, A., Gramoli, V.: Blockchain is dead, long live blockchain! accountable state machine replication for longlasting blockchain. arXiv:2007.10541 (2020)"},{"key":"27_CR35","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":"27_CR36","doi-asserted-by":"crossref","unstructured":"Schwarz-Schilling, C., Neu, J., Monnot, B., Asgaonkar, A., Tas, E.N., Tse, D.: Three attacks on proof-of-stake Ethereum. In: Financial Cryptography and Data Security. FC 2022 (2022)","DOI":"10.1007\/978-3-031-18283-9_28"},{"key":"27_CR37","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":"27_CR38","unstructured":"Stewart, A., Kokoris-Kogia, E.: GRANDPA: a Byzantine finality gadget. arXiv:2007.01560 (2020)"},{"key":"27_CR39","unstructured":"Vyzovitis, D., Napora, Y., McCormick, D., Dias, D., Psaras, Y.: GossipSub: attack-resilient message propagation in the Filecoin and ETH2.0 networks. arXiv:2007.02754 (2020)"},{"key":"27_CR40","doi-asserted-by":"crossref","unstructured":"Yin, M., Malkhi, D., Reiter, M.K., Gueta, G.G., Abraham, I.: HotStuff: BFT consensus with linearity and responsiveness. In: Symposium on Principles of Distributed Computing, PODC 2019, 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-18283-9_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,9]],"date-time":"2023-03-09T14:00:39Z","timestamp":1678370439000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-18283-9_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031182822","9783031182839"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-18283-9_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"22 October 2022","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":"Grenada","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Grenada","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":"2 May 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 May 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fc2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/fc22.ifca.ai\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Hotcrp","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"159","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"20% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}