{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,22]],"date-time":"2026-07-22T16:03:00Z","timestamp":1784736180410,"version":"3.55.0"},"publisher-location":"Cham","reference-count":43,"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_4","type":"book-chapter","created":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T06:49:56Z","timestamp":1740120596000},"page":"51-73","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["BBCA-Chain: Low Latency, High Throughput BFT Consensus on\u00a0a\u00a0DAG"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7038-7250","authenticated-orcid":false,"given":"Dahlia","family":"Malkhi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3958-9735","authenticated-orcid":false,"given":"Chrysoula","family":"Stathakopoulou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-2717-8150","authenticated-orcid":false,"given":"Maofan","family":"Yin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,2,22]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Abspoel, M.,\u00a0Attema, T.,\u00a0Rambaud, M.: Malicious security comes for free in consensus with leaders. Cryptology ePrint Archive (2020)","DOI":"10.1145\/3465084.3467953"},{"key":"4_CR2","unstructured":"Baird, L.: The swirlds hashgraph consensus algorithm: fair, fast, Byzantine fault tolerance. Swirlds Tech Reports SWIRLDS-TR-2016-01, Technical report, 34:9\u201311 (2016)"},{"issue":"4","key":"4_CR3","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1145\/4221.214134","volume":"32","author":"G Bracha","year":"1985","unstructured":"Bracha, G., Toueg, S.: Asynchronous consensus and broadcast protocols. J. ACM 32(4), 824\u2013840 (1985)","journal-title":"J. ACM"},{"key":"4_CR4","unstructured":"Buchman, E.: Tendermint: byzantine fault tolerance in the age of blockchains. Ph.D. thesis, University of Guelph (2016)"},{"key":"4_CR5","unstructured":"Buterin, V.,\u00a0Griffith, V.: Casper the friendly finality gadget. arXiv preprint arXiv:1710.09437 (2017)"},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1007\/3-540-44647-8_31","volume-title":"Advances in Cryptology \u2014 CRYPTO 2001","author":"C Cachin","year":"2001","unstructured":"Cachin, C., Kursawe, K., Petzold, F., Shoup, V.: Secure and efficient asynchronous broadcast protocols. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 524\u2013541. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44647-8_31"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Cachin, C.,\u00a0Kursawe, K.,\u00a0Shoup, V.: Random oracles in constantipole: practical asynchronous byzantine agreement using cryptography. In: Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing, pp. 123\u2013132 (2000)","DOI":"10.1145\/343477.343531"},{"key":"4_CR8","unstructured":"Castro, M.,\u00a0Liskov, B.: Practical Byzantine fault tolerance. In: Seltzer, M.I., Leach, P.J. (eds.) Proceedings of the Third USENIX Symposium on Operating Systems Design and Implementation (OSDI), New Orleans, Louisiana, USA, 22\u201325 February 1999, pp. 173\u2013186. USENIX Association (1999)"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Civit, P., et al.: Byzantine consensus is $$\\theta $$(n2): the Dolev-Reischuk bound is tight even in partial synchrony! In: International Symposium on Distributed Computing (2022)","DOI":"10.21203\/rs.3.rs-2526543\/v1"},{"key":"4_CR10","unstructured":"Clement, A.,\u00a0Wong, E.,\u00a0Alvisi, L.,\u00a0Dahlin, M.,\u00a0Marchetti, M.: Making Byzantine fault tolerant systems tolerate Byzantine faults. In: Proceedings of the 6th USENIX Symposium on Networked Systems Design and Implementation, NSDI 2009, pp. 153\u2013168. USENIX Association (2009)"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Crain, T.,\u00a0Natoli, C.,\u00a0Gramoli, V.: Red belly: a secure, fair and scalable open blockchain. In: 2021 IEEE Symposium on Security and Privacy (SP), pp. 466\u2013483. IEEE (2021)","DOI":"10.1109\/SP40001.2021.00087"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Dai, X.,\u00a0Zhang, Z.,\u00a0Xiao, J.,\u00a0Yue, J.,\u00a0Xie, X.,\u00a0Jin, H.: GradedDAG: an asynchronous DAG-based BFT consensus with lower latency. In: 42nd International Symposium on Reliable Distributed Systems, SRDS 2023, Marrakech, Morocco, 27\u201329 September 2023. IEEE (2023)","DOI":"10.1109\/SRDS60354.2023.00020"},{"key":"4_CR13","unstructured":"Danezis, G.,\u00a0Hrycyszyn, D.: Blockmania: from block DAGs to consensus. arXiv preprint arXiv:1809.01620 (2018)"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Danezis, G.,\u00a0Kokoris-Kogias, L.,\u00a0Sonnino, A.,\u00a0Spiegelman, A.: Narwhal and tusk: a DAG-based mempool and efficient BFT consensus. In:\u00a0Bromberg, Y.,\u00a0Kermarrec, A.,\u00a0Kozyrakis, C. (eds.) EuroSys 2022: Seventeenth European Conference on Computer Systems, Rennes, France, 5\u20138 April 2022, pp. 34\u201350. ACM (2022)","DOI":"10.1145\/3492321.3519594"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Dolev, D.,\u00a0Kramer, S.,\u00a0Malki, D.: Early delivery totally ordered multicast in asynchronous environments. In: FTCS-23 The Twenty-Third International Symposium on Fault-Tolerant Computing, pp. 544\u2013553. IEEE (1993)","DOI":"10.1109\/FTCS.1993.627357"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Duan, S., Reiter, M.K.,\u00a0Zhang, H.: Secure causal atomic broadcast, revisited. In: 2017 47th Annual IEEE\/IFIP International Conference on Dependable Systems and Networks (DSN), pp. 61\u201372. IEEE (2017)","DOI":"10.1109\/DSN.2017.64"},{"issue":"2","key":"4_CR17","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"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Gafni, E.: Round-by-round fault detectors (extended abstract) unifying synchrony and asynchrony. In: Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, pp. 143\u2013152 (1998)","DOI":"10.1145\/277697.277724"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Gagol, A.,\u00a0Lesniak, D.,\u00a0Straszak, D.,\u00a0Swietek, M.: Aleph: efficient atomic broadcast in asynchronous networks with byzantine nodes. In: Proceedings of the 1st ACM Conference on Advances in Financial Technologies, AFT 2019, Zurich, Switzerland, 21\u201323 October 2019, pp. 214\u2013228. ACM (2019)","DOI":"10.1145\/3318041.3355467"},{"key":"4_CR20","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/978-3-031-18283-9_14","volume-title":"FC 2022","author":"R Gelashvili","year":"2022","unstructured":"Gelashvili, R., Kokoris-Kogias, L., Sonnino, A., Spiegelman, A., Xiang, Z.: Jolteon and Ditto: network-adaptive efficient consensus with asynchronous fallback. In: Eyal, I., Garay, J. (eds.) FC 2022. LNCS, vol. 13411, pp. 296\u2013315. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-18283-9_14"},{"key":"4_CR21","unstructured":"Giridharan, N.,\u00a0Howard, H.,\u00a0Abraham, I.,\u00a0Crooks, N.,\u00a0Tomescu, A.: No-commit proofs: defeating livelock in BFT. Cryptology ePrint Archive (2021)"},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"Golan Gueta, G., et al.: SBFT: a scalable and decentralized trust infrastructure. In: Proceedings - 49th Annual IEEE\/IFIP International Conference on Dependable Systems and Networks, DSN 2019, pp. 568\u2013580 (2019)","DOI":"10.1109\/DSN.2019.00063"},{"key":"4_CR23","doi-asserted-by":"crossref","unstructured":"Gupta, S.,\u00a0Hellings, J.,\u00a0Sadoghi, M.: RCC: resilient concurrent consensus for high-throughput secure transaction processing. In: 37th IEEE International Conference on Data Engineering, ICDE 2021, Chania, Greece, 19\u201322 April 2021, pp. 1392\u20131403. IEEE (2021)","DOI":"10.1109\/ICDE51399.2021.00124"},{"key":"4_CR24","unstructured":"Jalalzai, M.M.,\u00a0Niu, J.,\u00a0Feng, C.,\u00a0Gai, F.: Fast-HotStuff: a fast and resilient HotStuff protocol. arXiv preprint arXiv:2010.11454 (2020)"},{"key":"4_CR25","doi-asserted-by":"crossref","unstructured":"Keidar, I.,\u00a0Kokoris-Kogias, E.,\u00a0Naor, O.,\u00a0Spiegelman, A.: All you need is DAG. In:\u00a0Miller, A.,\u00a0Censor-Hillel, K., Korhonen, J.H. (eds.) PODC 2021: ACM Symposium on Principles of Distributed Computing, Virtual Event, Italy, 26\u201330 July 2021, pp. 165\u2013175. ACM (2021)","DOI":"10.1145\/3465084.3467905"},{"key":"4_CR26","doi-asserted-by":"crossref","unstructured":"Kotla, R.,\u00a0Alvisi, L.,\u00a0Dahlin, M.,\u00a0Clement, A., Wong, E.: Zyzzyva: speculative Byzantine fault tolerance. In: Proceedings of Twenty-First ACM SIGOPS Symposium on Operating Systems Principles, SOSP 2007, pp. 45\u201358. Association for Computing Machinery (2007)","DOI":"10.1145\/1323293.1294267"},{"key":"4_CR27","unstructured":"Lev-Ari, K.,\u00a0Spiegelman, A.,\u00a0Keidar, I.,\u00a0Malkhi, D.: FairLedger: a fair blockchain protocol for financial institutions. In: International Conference on Principles of Distributed Systems (2019)"},{"key":"4_CR28","unstructured":"Lewis-Pye, A.: Quadratic worst-case message complexity for state machine replication in the partial synchrony model. ArXiv, abs\/2201.01107 (2022)"},{"key":"4_CR29","unstructured":"Malkhi, D.,\u00a0Nayak, K.: Hotstuff-2: optimal two-phase responsive BFT. Cryptology ePrint Archive (2023)"},{"key":"4_CR30","unstructured":"Malkhi, D.,\u00a0Szalachowski, P.: Maximal extractable value (MEV) protection on a DAG. CoRR, abs\/2208.00940 (2022)"},{"key":"4_CR31","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1109\/TDSC.2006.35","volume":"3","author":"J-P Martin","year":"2006","unstructured":"Martin, J.-P., Alvisi, L.: Fast Byzantine consensus. IEEE Trans. Dependable Secure Comput. 3, 202\u2013215 (2006)","journal-title":"IEEE Trans. Dependable Secure Comput."},{"issue":"1","key":"4_CR32","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1006\/inco.1998.2770","volume":"150","author":"LE Moser","year":"1999","unstructured":"Moser, L.E., Melliar-Smith, P.M.: Byzantine-resistant total ordering algorithms. Inf. Comput. 150(1), 75\u2013111 (1999)","journal-title":"Inf. Comput."},{"key":"4_CR33","unstructured":"Mysten Labs: Private communication (2023)"},{"key":"4_CR34","doi-asserted-by":"crossref","unstructured":"Reiter, M.K.: Secure agreement protocols: reliable and atomic group multicast in Rampart. In: Proceedings of the 2nd ACM Conference on Computer and Communications Security, CCS 1994, pp. 68\u201380. Association for Computing Machinery (1994)","DOI":"10.1145\/191177.191194"},{"issue":"3","key":"4_CR35","doi-asserted-by":"publisher","first-page":"986","DOI":"10.1145\/177492.177745","volume":"16","author":"MK Reiter","year":"1994","unstructured":"Reiter, M.K., Birman, K.P.: How to securely replicate services. ACM Trans. Program. Lang. Syst. (TOPLAS) 16(3), 986\u20131009 (1994)","journal-title":"ACM Trans. Program. Lang. Syst. (TOPLAS)"},{"key":"4_CR36","unstructured":"Spiegelman, A.,\u00a0Aurn, B.,\u00a0Gelashvili, R.,\u00a0Li, Z.: Shoal: improving DAG-BFT latency and robustness. arXiv preprint arXiv:2306.03058 (2023)"},{"key":"4_CR37","doi-asserted-by":"crossref","unstructured":"Spiegelman, A.,\u00a0Giridharan, N.,\u00a0Sonnino, A.,\u00a0Kokoris-Kogias, L.: Bullshark: DAG BFT protocols made practical. In: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, pp. 2705\u20132718 (2022)","DOI":"10.1145\/3548606.3559361"},{"key":"4_CR38","doi-asserted-by":"crossref","unstructured":"Stathakopoulou, C.,\u00a0David, T.,\u00a0Pavlovic, M.,\u00a0Vukolic, M.: [solution] Mir-BFT: scalable and robust BFT for decentralized networks. J. Syst. Res. 2(1) (2022)","DOI":"10.5070\/SR32159278"},{"key":"4_CR39","doi-asserted-by":"crossref","unstructured":"Stathakopoulou, C.,\u00a0Pavlovic, M.,\u00a0Vukolic, M.: State machine replication scalability made simple. In:\u00a0Bromberg, Y.,\u00a0Kermarrec, A.,\u00a0Kozyrakis, C. (eds.) EuroSys 2022: Seventeenth European Conference on Computer Systems, Rennes, France, 5\u20138 April 2022, pp. 17\u201333. ACM (2022)","DOI":"10.1145\/3492321.3519579"},{"key":"4_CR40","unstructured":"E.\u00a0Systems: The espresso sequencer: HotShot consensus and tiramisu data availability (2023). arXiv preprint arXiv:2306.03058"},{"key":"4_CR41","unstructured":"T.D. Team: DiemBFT v4: State machine replication in the Diem blockchain (2021). https:\/\/developers.diem.com\/docs\/technical-papers\/state-machine-replication-paper"},{"key":"4_CR42","unstructured":"Yang, L., Park, S.J.,\u00a0Alizadeh, M.,\u00a0Kannan, S.,\u00a0Tse, D.: DispersedLedger: High-Throughput Byzantine consensus on variable bandwidth networks. In: 19th USENIX Symposium on Networked Systems Design and Implementation (NSDI 2022), pp. 493\u2013512 (2022)"},{"key":"4_CR43","doi-asserted-by":"crossref","unstructured":"Yin, M.,\u00a0Malkhi, D., Reiter, M.K., Gueta, G.G.,\u00a0Abraham, I.: HotStuff: BFT consensus with linearity and responsiveness. In: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, PODC 2019, pp. 347\u2013356. Association for Computing Machinery (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_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T06:50:32Z","timestamp":1740120632000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-78676-1_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031786754","9783031786761"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-78676-1_4","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"}}]}}