{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,25]],"date-time":"2026-07-25T15:57:48Z","timestamp":1784995068414,"version":"3.55.0"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031182822","type":"print"},{"value":"9783031182839","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-18283-9_14","type":"book-chapter","created":{"date-parts":[[2022,10,21]],"date-time":"2022-10-21T20:23:03Z","timestamp":1666383783000},"page":"296-315","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":91,"title":["Jolteon and\u00a0Ditto: Network-Adaptive Efficient Consensus with\u00a0Asynchronous Fallback"],"prefix":"10.1007","author":[{"given":"Rati","family":"Gelashvili","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lefteris","family":"Kokoris-Kogias","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alberto","family":"Sonnino","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alexander","family":"Spiegelman","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhuolun","family":"Xiang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,10,22]]},"reference":[{"key":"14_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: 2020 IEEE Symposium on Security and Privacy (S &P), pp. 106\u2013118 (2020)","DOI":"10.1109\/SP40000.2020.00044"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Abraham, I., et al.: Communication complexity of byzantine agreement, revisited. In: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing (PODC), pp. 317\u2013326 (2019)","DOI":"10.1145\/3293611.3331629"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Abraham, I., Jovanovic, P., Maller, M., Meiklejohn, S., Stern, G., Tomescu, A.: Reaching consensus for asynchronous distributed key generation. In: Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing (PODC), pp. 363\u2013373 (2021)","DOI":"10.1145\/3465084.3467914"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Abraham, I., Malkhi, D., Spiegelman, A.: Asymptotically optimal validated asynchronous byzantine agreement. In: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing (PODC), pp. 337\u2013346 (2019)","DOI":"10.1145\/3293611.3331612"},{"key":"14_CR5","unstructured":"Blum, E., Katz, J., Loss, J.: Network-agnostic state machine replication. arXiv preprint arXiv:2002.03437 (2020)"},{"key":"14_CR6","unstructured":"Buchman, E., Kwon, J., Milosevic, Z.: The latest gossip on BFT consensus. arXiv preprint arXiv:1807.04938 (2018)"},{"key":"14_CR7","unstructured":"Buterin, V., Griffith, V.: Casper the friendly finality gadget. arXiv preprint arXiv:1710.09437 (2017)"},{"key":"14_CR8","unstructured":"Castro, M., Liskov, B.: Practical byzantine fault tolerance. In: Proceedings of the third symposium on Operating Systems Design and Implementation (NSDI), pp. 173\u2013186 (1999)"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Das, S., Xiang, Z., Ren, L.: Asynchronous data dissemination and its applications. In: Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security (CCS), pp. 2705\u20132721 (2021)","DOI":"10.1145\/3460120.3484808"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Das, S., Yurek, T., Xiang, Z., Miller, A., Kokoris-Kogias, L., Ren, L.: Practical asynchronous distributed key generation. Cryptology ePrint Archive, Report 2021\/1591 (2021)","DOI":"10.1109\/SP46214.2022.9833584"},{"issue":"2","key":"14_CR11","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1145\/42282.42283","volume":"35","author":"C Dwork","year":"1988","unstructured":"Dwork, C., Lynch, N., Stockmeyer, L.: Consensus in the presence of partial synchrony. J. ACM (JACM) 35(2), 288\u2013323 (1988)","journal-title":"J. ACM (JACM)"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of distributed consensus with one faulty process. J. ACM (JACM) 32(2), 374\u2013382 (1985)","DOI":"10.1145\/3149.214121"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"G\u0105gol, A., Le\u015bniak, D., Straszak, D., Aleph, M.: Efficient atomic broadcast in asynchronous networks with byzantine nodes. In: Proceedings of the 1st ACM Conference on Advances in Financial Technologies (AFT), pp. 214\u2013228 (2019)","DOI":"10.1145\/3318041.3355467"},{"key":"14_CR14","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. arXiv preprint arXiv:2106.10362 (2021)","DOI":"10.1007\/978-3-031-18283-9_14"},{"key":"14_CR15","unstructured":"Gueta, G.G., et al.: SBFT: a scalable and decentralized trust infrastructure. In: 2019 49th Annual IEEE\/IFIP International Conference on Dependable Systems and Networks (DSN), pp. 568\u2013580. IEEE (2019)"},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"Guo, B., Lu, Z., Tang, Q., Xu, J., Zhang, Z.: Dumbo: faster asynchronous BFT protocols. In: Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security (CCS), pp. 803\u2013818 (2020)","DOI":"10.1145\/3372297.3417262"},{"key":"14_CR17","unstructured":"Jalalzai, M.M., Niu, J., Feng, C., Gai, F.: Fast-HotStuff: a fast and resilient hotstuff protocol. arXiv preprint arXiv:2010.11454 (2020)"},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"Keidar, I., Kokoris-Kogias, E., Naor, O., Spiegelman, A.: All you need is DAG. In: Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing (PODC) (2021)","DOI":"10.1145\/3465084.3467905"},{"key":"14_CR19","unstructured":"Kogias, E.K., Jovanovic, P., Gailly, N., Khoffi, I., Gasser, L., Ford, B.: Enhancing bitcoin security and performance with strong consistency via collective signing. In 25th Usenix Security Symposium, pp. 279\u2013296 (2016)"},{"key":"14_CR20","unstructured":"Kogias, E.K., Malkhi, D., Spiegelman, A.: Asynchronous distributed key generation for computationally-secure randomness, consensus, and threshold signatures. In: Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security (CCS), pp. 1751\u20131767 (2020)"},{"key":"14_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1007\/11523468_17","volume-title":"Automata, Languages and Programming","author":"K Kursawe","year":"2005","unstructured":"Kursawe, K., Shoup, V.: Optimistic asynchronous atomic broadcast. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 204\u2013215. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11523468_17"},{"key":"14_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2016.02.031","volume":"645","author":"B Libert","year":"2016","unstructured":"Libert, B., Joye, M., Yung, M.: Born and raised distributively: fully distributed non-interactive adaptively-secure threshold signatures with short shares. Theoret. Comput. Sci. 645, 1\u201324 (2016)","journal-title":"Theoret. Comput. Sci."},{"key":"14_CR23","unstructured":"Loss, J., Moran, T.: Combining asynchronous and synchronous byzantine agreement: the best of both worlds. Cryptology ePrint Archive, Report 2018\/235 (2018)"},{"key":"14_CR24","doi-asserted-by":"crossref","unstructured":"Lu, Y., Lu, Z., Tang, Q.: Bolt-Dumbo transformer: asynchronous consensus as fast as pipelined BFT. arXiv preprint arXiv:2103.09425 (2021)","DOI":"10.1145\/3548606.3559346"},{"key":"14_CR25","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 (PODC), pp. 129\u2013138 (2020)","DOI":"10.1145\/3382734.3405707"},{"key":"14_CR26","doi-asserted-by":"crossref","unstructured":"Miller, A., Xia, Y., Croman, K., Shi, E., Song, D.: The honey badger of BFT protocols. In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security (CCS), pp. 31\u201342 (2016)","DOI":"10.1145\/2976749.2978399"},{"key":"14_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/11795490_9","volume-title":"Principles of Distributed Systems","author":"HGV Ramasamy","year":"2006","unstructured":"Ramasamy, H.G.V., Cachin, C.: Parsimonious asynchronous byzantine-fault-tolerant atomic broadcast. In: Anderson, J.H., Prencipe, G., Wattenhofer, R. (eds.) OPODIS 2005. LNCS, vol. 3974, pp. 88\u2013102. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11795490_9"},{"key":"14_CR28","unstructured":"Rambaud, M.: Malicious security comes for free in consensus with leaders. IACR Cryptology ePrint Archive, Report 2020\/1480 (2020)"},{"key":"14_CR29","unstructured":"Spiegelman, A.: In search for an optimal authenticated byzantine agreement. In: 35th International Symposium on Distributed Computing (DISC) (2021)"},{"key":"14_CR30","unstructured":"Spiegelman, A., Rinberg, A.: ACE: abstract consensus encapsulation for liveness boosting of state machine replication. In: 23rd International Conference on Principles of Distributed Systems (OPODIS) (2020)"},{"key":"14_CR31","unstructured":"The DiemBFT Team: State Machine Replication in the diem blockchain (2021). https:\/\/developers.diem.com\/docs\/technical-papers\/state-machine-replication-paper\/"},{"key":"14_CR32","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: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing (PODC), pp. 347\u2013356 (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_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,9]],"date-time":"2023-03-09T13:59:40Z","timestamp":1678370380000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-18283-9_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031182822","9783031182839"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-18283-9_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":"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)"}}]}}