{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T14:22:38Z","timestamp":1766067758485,"version":"3.40.3"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031327322"},{"type":"electronic","value":"9783031327339"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-32733-9_9","type":"book-chapter","created":{"date-parts":[[2023,5,24]],"date-time":"2023-05-24T23:04:40Z","timestamp":1684969480000},"page":"165-198","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["FnF-BFT: A BFT Protocol with\u00a0Provable Performance Under Attack"],"prefix":"10.1007","author":[{"given":"Zeta","family":"Avarikioti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lioba","family":"Heimbach","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roland","family":"Schmid","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laurent","family":"Vanbever","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roger","family":"Wattenhofer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Patrick","family":"Wintermeyer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,5,25]]},"reference":[{"key":"9_CR1","unstructured":"The swirdls hashgraph consensus algorithm: fair, fast, byzantine fault tolerance. https:\/\/www.swirlds.com\/downloads\/SWIRLDS-TR-2016-01.pdf. Accessed 30 Jan 2023"},{"key":"9_CR2","unstructured":"Abraham, I., Gueta, G., Malkhi, D., Alvisi, L., Kotla, R., Martin, J.P.: Revisiting fast practical byzantine fault tolerance (2017)"},{"key":"9_CR3","doi-asserted-by":"publisher","unstructured":"Amir, Y., Dolev, D., Kramer, S., Malki, D.: Transis: a communication subsystem for high availability. In: 1992 Digest of Papers. FTCS-22: The Twenty-Second International Symposium on Fault-Tolerant Computing, pp. 76\u201384 (1992). https:\/\/doi.org\/10.1109\/FTCS.1992.243613","DOI":"10.1109\/FTCS.1992.243613"},{"issue":"4","key":"9_CR4","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1109\/TDSC.2010.70","volume":"8","author":"Y Amir","year":"2010","unstructured":"Amir, Y., Coan, B., Kirsch, J., Lane, J.: Prime: byzantine replication under attack. IEEE Trans. Dependable Secure Comput. 8(4), 564\u2013577 (2010)","journal-title":"IEEE Trans. Dependable Secure Comput."},{"issue":"1","key":"9_CR5","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1109\/TDSC.2008.53","volume":"7","author":"Y Amir","year":"2008","unstructured":"Amir, Y., et al.: Steward: scaling byzantine fault-tolerant replication to wide area networks. IEEE Trans. Dependable Secure Comput. 7(1), 80\u201393 (2008)","journal-title":"IEEE Trans. Dependable Secure Comput."},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Aublin, P., Mokhtar, S.B., Qu\u00e9ma, V.: RBFT: redundant byzantine fault tolerance. In: ICDCS, pp. 297\u2013306 (2013)","DOI":"10.1109\/ICDCS.2013.53"},{"key":"9_CR7","unstructured":"Avarikioti, G., Kokoris-Kogias, E., Wattenhofer, R.: Divide and scale: formalization of distributed ledger sharding protocols (2019)"},{"key":"9_CR8","doi-asserted-by":"publisher","unstructured":"Birman, K., Joseph, T.: Exploiting virtual synchrony in distributed systems. In: Proceedings of the Eleventh ACM Symposium on Operating Systems Principles, SOSP 1987, pp. 123\u2013138. Association for Computing Machinery, New York (1987). https:\/\/doi.org\/10.1145\/41457.37515","DOI":"10.1145\/41457.37515"},{"issue":"4","key":"9_CR9","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1145\/571637.571640","volume":"20","author":"M Castro","year":"2002","unstructured":"Castro, M., Liskov, B.: Practical byzantine fault tolerance and proactive recovery. ACM Trans. Comput. Syst. (TOCS) 20(4), 398\u2013461 (2002)","journal-title":"ACM Trans. Comput. Syst. (TOCS)"},{"key":"9_CR10","unstructured":"Clement, A., Wong, E.L., Alvisi, L., Dahlin, M., Marchetti, M.: Making byzantine fault tolerant systems tolerate byzantine faults. In: NSDI, pp. 153\u2013168 (2009)"},{"key":"9_CR11","doi-asserted-by":"publisher","unstructured":"Danezis, G., Kokoris-Kogias, L., Sonnino, A., Spiegelman, A.: Narwhal and tusk: a DAG-based mempool and efficient BFT consensus. In: Proceedings of the Seventeenth European Conference on Computer Systems, EuroSys 2022, pp. 34\u201350. Association for Computing Machinery, New York (2022). https:\/\/doi.org\/10.1145\/3492321.3519594","DOI":"10.1145\/3492321.3519594"},{"issue":"1","key":"9_CR12","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1145\/2455.214112","volume":"32","author":"D Dolev","year":"1985","unstructured":"Dolev, D., Reischuk, R.: Bounds on information exchange for byzantine agreement. J. ACM (JACM) 32(1), 191\u2013204 (1985)","journal-title":"J. ACM (JACM)"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Dolev, D., Strong, H.R.: Polynomial algorithms for multiple processor agreement. In: ACM STOC, pp. 401\u2013407 (1982)","DOI":"10.1145\/800070.802215"},{"issue":"2","key":"9_CR14","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)"},{"issue":"2","key":"9_CR15","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.S.: Impossibility of distributed consensus with one faulty process. J. ACM (JACM) 32(2), 374\u2013382 (1985)","journal-title":"J. ACM (JACM)"},{"key":"9_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/978-3-031-18283-9_14","volume-title":"Financial Cryptography and Data Security","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":"9_CR17","doi-asserted-by":"publisher","unstructured":"G\u0105gol, A., Leundefinedniak, D., Straszak, D., undefinedwiundefinedtek, 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, pp. 214\u2013228. Association for Computing Machinery, New York (2019). https:\/\/doi.org\/10.1145\/3318041.3355467","DOI":"10.1145\/3318041.3355467"},{"key":"9_CR18","unstructured":"Gueta, G.G., et al.: SBFT: a scalable decentralized trust infrastructure for blockchains (2018)"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Gupta, S., Hellings, J., Sadoghi, M.: RCC: resilient concurrent consensus for high-throughput secure transaction processing. In: 2021 IEEE 37th International Conference on Data Engineering (ICDE), pp. 1392\u20131403. IEEE (2021)","DOI":"10.1109\/ICDE51399.2021.00124"},{"key":"9_CR20","doi-asserted-by":"publisher","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, pp. 165\u2013175. Association for Computing Machinery, New York (2021). https:\/\/doi.org\/10.1145\/3465084.3467905","DOI":"10.1145\/3465084.3467905"},{"key":"9_CR21","doi-asserted-by":"crossref","unstructured":"Kokoris-Kogias, E., Jovanovic, P., Gasser, L., Gailly, N., Syta, E., Ford, B.: Omniledger: a secure, scale-out, decentralized ledger via sharding. In: IEEE SP, pp. 19\u201334 (2018)","DOI":"10.1109\/SP.2018.000-5"},{"issue":"6","key":"9_CR22","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1145\/1323293.1294267","volume":"41","author":"R Kotla","year":"2007","unstructured":"Kotla, R., Alvisi, L., Dahlin, M., Clement, A., Wong, E.: Zyzzyva: speculative byzantine fault tolerance. SIGOPS Oper. Syst. Rev. 41(6), 45\u201358 (2007)","journal-title":"SIGOPS Oper. Syst. Rev."},{"issue":"3","key":"9_CR23","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L Lamport","year":"1982","unstructured":"Lamport, L., Shostak, R., Pease, M.: The byzantine generals problem. ACM Trans. Program. Lang. Syst. 4(3), 382\u2013401 (1982)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"9_CR24","unstructured":"Lynch, N.A.: Distributed Algorithms. Elsevier (1996)"},{"key":"9_CR25","doi-asserted-by":"publisher","unstructured":"Malkhi, D., Szalachowski, P.: Maximal extractable value (MEV) protection on a DAG (2022). https:\/\/doi.org\/10.48550\/ARXIV.2208.00940","DOI":"10.48550\/ARXIV.2208.00940"},{"key":"9_CR26","unstructured":"Mao, Y., Junqueira, F.P., Marzullo, K.: Mencius: building efficient replicated state machines for wans. In: USENIX OSDI, pp. 369\u2013384 (2008)"},{"issue":"1","key":"9_CR27","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1109\/71.80121","volume":"1","author":"P Melliar-Smith","year":"1990","unstructured":"Melliar-Smith, P., Moser, L., Agrawala, V.: Broadcast protocols for distributed systems. IEEE Trans. Parallel Distrib. Syst. 1(1), 17\u201325 (1990). https:\/\/doi.org\/10.1109\/71.80121","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"9_CR28","doi-asserted-by":"crossref","unstructured":"Milosevic, Z., Biely, M., Schiper, A.: Bounded delay in byzantine-tolerant state machine replication. In: IEEE SRDS, pp. 61\u201370 (2013)","DOI":"10.1109\/SRDS.2013.15"},{"issue":"1","key":"9_CR29","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). https:\/\/doi.org\/10.1006\/inco.1998.2770","journal-title":"Inf. Comput."},{"issue":"2","key":"9_CR30","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"M Pease","year":"1980","unstructured":"Pease, M., Shostak, R., Lamport, L.: Reaching agreement in the presence of faults. J. ACM (JACM) 27(2), 228\u2013234 (1980)","journal-title":"J. ACM (JACM)"},{"issue":"3","key":"9_CR31","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1145\/65000.65001","volume":"7","author":"LL Peterson","year":"1989","unstructured":"Peterson, L.L., Buchholz, N.C., Schlichting, R.D.: Preserving and using context information in interprocess communication. ACM Trans. Comput. Syst. 7(3), 217\u2013246 (1989). https:\/\/doi.org\/10.1145\/65000.65001","journal-title":"ACM Trans. Comput. Syst."},{"key":"9_CR32","doi-asserted-by":"crossref","unstructured":"Reiter, M.K.: Secure agreement protocols: reliable and atomic group multicast in rampart. In: ACM CCS, pp. 68\u201380 (1994)","DOI":"10.1145\/191177.191194"},{"key":"9_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/3-540-60042-6_7","volume-title":"Theory and Practice in Distributed Systems","author":"MK Reiter","year":"1995","unstructured":"Reiter, M.K.: The Rampart toolkit for building high-integrity services. In: Birman, K.P., Mattern, F., Schiper, A. (eds.) Theory and Practice in Distributed Systems. LNCS, vol. 938, pp. 99\u2013110. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-60042-6_7"},{"key":"9_CR34","doi-asserted-by":"publisher","unstructured":"Spiegelman, A., Giridharan, N., Sonnino, A., Kokoris-Kogias, L.: Bullshark: DAG BFT protocols made practical. In: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, CCS 2022, pp. 2705\u20132718. Association for Computing Machinery, New York (2022). https:\/\/doi.org\/10.1145\/3548606.3559361","DOI":"10.1145\/3548606.3559361"},{"key":"9_CR35","unstructured":"Stathakopoulou, C., David, T., Vukoli\u0107, M.: Mir-BFT: high-throughput BFT for blockchains (2019)"},{"key":"9_CR36","doi-asserted-by":"crossref","unstructured":"Stathakopoulou, C., Pavlovic, M., Vukoli\u0107, M.: State machine replication scalability made simple. In: Proceedings of the Seventeenth European Conference on Computer Systems, pp. 17\u201333 (2022)","DOI":"10.1145\/3492321.3519579"},{"key":"9_CR37","doi-asserted-by":"crossref","unstructured":"Veronese, G.S., Correia, M., Bessani, A.N., Lung, L.C.: Spin one\u2019s wheels? Byzantine fault tolerance with a spinning primary. In: IEEE SRDS, pp. 135\u2013144 (2009)","DOI":"10.1109\/SRDS.2009.36"},{"key":"9_CR38","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: ACM PODC, pp. 347\u2013356 (2019)","DOI":"10.1145\/3293611.3331591"},{"key":"9_CR39","doi-asserted-by":"crossref","unstructured":"Zamani, M., Movahedi, M., Raykova, M.: Rapidchain: scaling blockchain via full sharding. In: ACM CCS, pp. 931\u2013948 (2018)","DOI":"10.1145\/3243734.3243853"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-32733-9_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,24]],"date-time":"2023-05-24T23:05:44Z","timestamp":1684969544000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-32733-9_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031327322","9783031327339"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-32733-9_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"25 May 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SIROCCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Colloquium on Structural Information and Communication Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Alcal\u00e1 de Henares","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sirocco2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sirocco2023.networks.imdea.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"48","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":"26","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":"0","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":"54% - 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":"5","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)"}}]}}