{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T08:39:51Z","timestamp":1770885591178,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":44,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,10,2]],"date-time":"2021-10-02T00:00:00Z","timestamp":1633132800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,11,22]]},"DOI":"10.1145\/3464298.3484503","type":"proceedings-article","created":{"date-parts":[[2021,10,3]],"date-time":"2021-10-03T06:07:43Z","timestamp":1633241263000},"page":"52-63","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":17,"title":["Prosecutor"],"prefix":"10.1145","author":[{"given":"Gengrui","family":"Zhang","sequence":"first","affiliation":[{"name":"University of Toronto"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hans-Arno","family":"Jacobsen","sequence":"additional","affiliation":[{"name":"University of Toronto"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,10,2]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Bitcoin historical data from select exchanges Jan 2012 to Dec 2020. https:\/\/www.kaggle.com\/mczielinski\/bitcoin-historical-data. Accessed: 2020.  Bitcoin historical data from select exchanges Jan 2012 to Dec 2020. https:\/\/www.kaggle.com\/mczielinski\/bitcoin-historical-data. Accessed: 2020."},{"key":"e_1_3_2_1_2_1","unstructured":"Hotstuff docker image with all external tools libraries and dependencies. Docker Hub: docker pull dopamineedward\/hotterstuff:v1.  Hotstuff docker image with all external tools libraries and dependencies. Docker Hub: docker pull dopamineedward\/hotterstuff:v1."},{"key":"e_1_3_2_1_3_1","volume-title":"A general-puropse bft state machine replication library with modularity and simplicity. https:\/\/github.com\/hot-stuff\/libhotstuff. Accessed","author":"Libhotstuff","year":"2019","unstructured":"Libhotstuff : A general-puropse bft state machine replication library with modularity and simplicity. https:\/\/github.com\/hot-stuff\/libhotstuff. Accessed : 2019 . Libhotstuff: A general-puropse bft state machine replication library with modularity and simplicity. https:\/\/github.com\/hot-stuff\/libhotstuff. Accessed: 2019."},{"key":"e_1_3_2_1_4_1","unstructured":"NetEm. https:\/\/www.linux.org\/docs\/man8\/tc-netem.html.  NetEm. https:\/\/www.linux.org\/docs\/man8\/tc-netem.html."},{"key":"e_1_3_2_1_5_1","first-page":"206","volume-title":"Byzantine replication under attack. In <i>2008 IEEE International Conference on Dependable Systems and Networks With FTCS and DCC (DSN)<\/i&gt","author":"Amir Y.","year":"2008","unstructured":"Amir , Y. , Coan , B. , Kirsch , J. , and Lane , J . Byzantine replication under attack. In <i>2008 IEEE International Conference on Dependable Systems and Networks With FTCS and DCC (DSN)<\/i&gt ; ( 2008 ), IEEE , pp. 197– 206 . Amir, Y., Coan, B., Kirsch, J., and Lane, J. Byzantine replication under attack. In <i>2008 IEEE International Conference on Dependable Systems and Networks With FTCS and DCC (DSN)<\/i> (2008), IEEE, pp. 197–206."},{"key":"e_1_3_2_1_6_1","first-page":"30","volume-title":"ACM","author":"Androulaki E.","unstructured":"Androulaki , E. , Barger , A. , Bortnikov , V. , Cachin , C. , Christidis , K. , De Caro , A. , Enyeart , D. , Ferris , C. , Laventman , G. , Manevich , Y. , Hyperledger fabric: a distributed operating system for permissioned blockchains. In <i>Proceedings of the Thirteenth EuroSys Conference<\/i> (2018) , ACM , p. 30 . Androulaki, E., Barger, A., Bortnikov, V., Cachin, C., Christidis, K., De Caro, A., Enyeart, D., Ferris, C., Laventman, G., Manevich, Y., et al. Hyperledger fabric: a distributed operating system for permissioned blockchains. In <i>Proceedings of the Thirteenth EuroSys Conference<\/i> (2018), ACM, p. 30."},{"key":"e_1_3_2_1_7_1","first-page":"306","volume-title":"Rbft: Redundant byzantine fault tolerance. In <i>2013 IEEE 33rd International Conference on Distributed Computing Systems<\/i&gt","author":"Aublin P.-L.","year":"2013","unstructured":"Aublin , P.-L. , Mokhtar , S. B. , and Qu éma, V. Rbft: Redundant byzantine fault tolerance. In <i>2013 IEEE 33rd International Conference on Distributed Computing Systems<\/i&gt ; ( 2013 ), IEEE , pp. 297– 306 . Aublin, P.-L., Mokhtar, S. B., and Quéma, V. Rbft: Redundant byzantine fault tolerance. In <i>2013 IEEE 33rd International Conference on Distributed Computing Systems<\/i> (2013), IEEE, pp. 297–306."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2695533.2695545"},{"key":"e_1_3_2_1_9_1","first-page":"362","volume-title":"State machine replication for the masses with bft-smart. In <i>2014 44th Annual IEEE\/IFIP International Conference on Dependable Systems and Networks<\/i&gt","author":"Bessani A.","year":"2014","unstructured":"Bessani , A. , Sousa , J. , and Alchieri , E. E . State machine replication for the masses with bft-smart. In <i>2014 44th Annual IEEE\/IFIP International Conference on Dependable Systems and Networks<\/i&gt ; ( 2014 ), IEEE , pp. 355– 362 . Bessani, A., Sousa, J., and Alchieri, E. E. State machine replication for the masses with bft-smart. In <i>2014 44th Annual IEEE\/IFIP International Conference on Dependable Systems and Networks<\/i> (2014), IEEE, pp. 355–362."},{"key":"e_1_3_2_1_10_1","volume-title":"August<\/i&gt","author":"Brown R. G.","year":"2016","unstructured":"Brown , R. G. , Carlyle , J. , Grigg , I. , and Hearn , M . Corda: an introduction. <i>R3 CEV , August<\/i&gt ; ( 2016 ). Brown, R. G., Carlyle, J., Grigg, I., and Hearn, M. Corda: an introduction. <i>R3 CEV, August<\/i> (2016)."},{"key":"e_1_3_2_1_12_1","volume-title":"Casper the friendly finality gadget. <i>arXiv preprint arXiv:1710.09437<\/i&gt","author":"Buterin V.","year":"2017","unstructured":"Buterin , V. , and Griffith , V . Casper the friendly finality gadget. <i>arXiv preprint arXiv:1710.09437<\/i&gt ; ( 2017 ). Buterin, V., and Griffith, V. Casper the friendly finality gadget. <i>arXiv preprint arXiv:1710.09437<\/i> (2017)."},{"key":"e_1_3_2_1_13_1","volume-title":"Architecture of the hyperledger blockchain fabric. In <i>Workshop on distributed cryptocurrencies and consensus ledgers<\/i&gt","author":"Cachin C.","year":"2016","unstructured":"Cachin , C. Architecture of the hyperledger blockchain fabric. In <i>Workshop on distributed cryptocurrencies and consensus ledgers<\/i&gt ; ( 2016 ), vol. 310 . Cachin, C. Architecture of the hyperledger blockchain fabric. In <i>Workshop on distributed cryptocurrencies and consensus ledgers<\/i> (2016), vol. 310."},{"key":"e_1_3_2_1_14_1","volume-title":"Blockchain consensus protocols in the wild. <i>arXiv preprint arXiv:1707.01873<\/i&gt","author":"Cachin C.","year":"2017","unstructured":"Cachin , C. , and Vukoli\u0107 , M . Blockchain consensus protocols in the wild. <i>arXiv preprint arXiv:1707.01873<\/i&gt ; ( 2017 ). Cachin, C., and Vukoli\u0107, M. Blockchain consensus protocols in the wild. <i>arXiv preprint arXiv:1707.01873<\/i> (2017)."},{"key":"e_1_3_2_1_15_1","first-page":"186","volume-title":"Practical byzantine fault tolerance. In <i>OSDI<\/i&gt","author":"Castro M.","year":"1999","unstructured":"Castro , M. , Liskov , B. , Practical byzantine fault tolerance. In <i>OSDI<\/i&gt ; ( 1999 ), vol. 99 , pp. 173– 186 . Castro, M., Liskov, B., et al. Practical byzantine fault tolerance. In <i>OSDI<\/i> (1999), vol. 99, pp. 173–186."},{"key":"e_1_3_2_1_16_1","first-page":"168","volume-title":"Making byzantine fault tolerant systems tolerate byzantine faults. In <i>NSDI<\/i&gt","author":"Clement A.","year":"2009","unstructured":"Clement , A. , Wong , E. L. , Alvisi , L. , Dahlin , M. , and Marchetti , M . Making byzantine fault tolerant systems tolerate byzantine faults. In <i>NSDI<\/i&gt ; ( 2009 ), vol. 9 , pp. 153– 168 . Clement, A., Wong, E. L., Alvisi, L., Dahlin, M., and Marchetti, M. Making byzantine fault tolerant systems tolerate byzantine faults. In <i>NSDI<\/i> (2009), vol. 9, pp. 153–168."},{"key":"e_1_3_2_1_17_1","first-page":"13","volume-title":"ACM","author":"Decker C.","unstructured":"Decker , C. , Seidel , J. , and Wattenhofer , R . Bitcoin meets strong consistency. In <i>Proceedings of the 17th International Conference on Distributed Computing and Networking<\/i> (2016) , ACM , p. 13 . Decker, C., Seidel, J., and Wattenhofer, R. Bitcoin meets strong consistency. In <i>Proceedings of the 17th International Conference on Distributed Computing and Networking<\/i> (2016), ACM, p. 13."},{"key":"e_1_3_2_1_18_1","first-page":"1100","volume-title":"ACM","author":"Dinh T. T. A.","unstructured":"Dinh , T. T. A. , Wang , J. , Chen , G. , Liu , R. , Ooi , B. C. , and Tan , K . -L. Blockbench: A framework for analyzing private blockchains. In <i>Proceedings of the 2017 ACM International Conference on Management of Data<\/i> (2017) , ACM , pp. 1085– 1100 . Dinh, T. T. A., Wang, J., Chen, G., Liu, R., Ooi, B. C., and Tan, K.-L. Blockbench: A framework for analyzing private blockchains. In <i>Proceedings of the 2017 ACM International Conference on Management of Data<\/i> (2017), ACM, pp. 1085–1100."},{"key":"e_1_3_2_1_19_1","volume-title":"Consensus in the presence of partial synchrony. <i>Journal of the ACM (JACM) 35<\/i>, 2","author":"Dwork C.","year":"1988","unstructured":"Dwork , C. , Lynch , N. , and Stockmeyer , L . Consensus in the presence of partial synchrony. <i>Journal of the ACM (JACM) 35<\/i>, 2 ( 1988 ), 288–323. Dwork, C., Lynch, N., and Stockmeyer, L. Consensus in the presence of partial synchrony. <i>Journal of the ACM (JACM) 35<\/i>, 2 (1988), 288–323."},{"key":"e_1_3_2_1_20_1","first-page":"59","volume-title":"Bitcoin-ng: A scalable blockchain protocol. In <i>13th USENIX Symposium on Networked Systems Design and Implementation (NSDI 16)<\/i&gt","author":"Eyal I.","year":"2016","unstructured":"Eyal , I. , Gencer , A. E. , Sirer , E. G. , and Van Renesse , R. Bitcoin-ng: A scalable blockchain protocol. In <i>13th USENIX Symposium on Networked Systems Design and Implementation (NSDI 16)<\/i&gt ; ( 2016 ), pp. 45– 59 . Eyal, I., Gencer, A. E., Sirer, E. G., and Van Renesse, R. Bitcoin-ng: A scalable blockchain protocol. In <i>13th USENIX Symposium on Networked Systems Design and Implementation (NSDI 16)<\/i> (2016), pp. 45–59."},{"key":"e_1_3_2_1_21_1","volume-title":"Impossibility of distributed consensus with one faulty process. <i>Journal of the ACM (JACM) 32<\/i>, 2","author":"Fischer M. J.","year":"1985","unstructured":"Fischer , M. J. , Lynch , N. A. , and Paterson , M. S . Impossibility of distributed consensus with one faulty process. <i>Journal of the ACM (JACM) 32<\/i>, 2 ( 1985 ), 374–382. Fischer, M. J., Lynch, N. A., and Paterson, M. S. Impossibility of distributed consensus with one faulty process. <i>Journal of the ACM (JACM) 32<\/i>, 2 (1985), 374–382."},{"key":"e_1_3_2_1_22_1","first-page":"68","volume-title":"Algorand: Scaling byzantine agreements for cryptocurrencies. In <i>Proceedings of the 26th Symposium on Operating Systems Principles<\/i&gt","author":"Gilad Y.","year":"2017","unstructured":"Gilad , Y. , Hemo , R. , Micali , S. , Vlachos , G. , and Zeldovich , N . Algorand: Scaling byzantine agreements for cryptocurrencies. In <i>Proceedings of the 26th Symposium on Operating Systems Principles<\/i&gt ; ( 2017 ), pp. 51– 68 . Gilad, Y., Hemo, R., Micali, S., Vlachos, G., and Zeldovich, N. Algorand: Scaling byzantine agreements for cryptocurrencies. In <i>Proceedings of the 26th Symposium on Operating Systems Principles<\/i> (2017), pp. 51–68."},{"key":"e_1_3_2_1_23_1","first-page":"376","volume-title":"The next 700 bft protocols. In <i>Proceedings of the 5th European conference on Computer systems<\/i&gt","author":"Guerraoui R.","year":"2010","unstructured":"Guerraoui , R. , Kne\u017eevi\u0107 , N. , Qu éma, V., and Vukoli\u0107 , M . The next 700 bft protocols. In <i>Proceedings of the 5th European conference on Computer systems<\/i&gt ; ( 2010 ), pp. 363– 376 . Guerraoui, R., Kne\u017eevi\u0107, N., Quéma, V., and Vukoli\u0107, M. The next 700 bft protocols. In <i>Proceedings of the 5th European conference on Computer systems<\/i> (2010), pp. 363–376."},{"key":"e_1_3_2_1_24_1","first-page":"580","volume-title":"Sbft: a scalable and decentralized trust infrastructure. In <i>2019 49th Annual IEEE\/IFIP international conference on dependable systems and networks (DSN)<\/i&gt","author":"Gueta G. G.","year":"2019","unstructured":"Gueta , G. G. , Abraham , I. , Grossman , S. , Malkhi , D. , Pinkas , B. , Reiter , M. , Seredinschi , D.-A. , Tamir , O. , and Tomescu , A . Sbft: a scalable and decentralized trust infrastructure. In <i>2019 49th Annual IEEE\/IFIP international conference on dependable systems and networks (DSN)<\/i&gt ; ( 2019 ), IEEE , pp. 568– 580 . Gueta, G. G., Abraham, I., Grossman, S., Malkhi, D., Pinkas, B., Reiter, M., Seredinschi, D.-A., Tamir, O., and Tomescu, A. Sbft: a scalable and decentralized trust infrastructure. In <i>2019 49th Annual IEEE\/IFIP international conference on dependable systems and networks (DSN)<\/i> (2019), IEEE, pp. 568–580."},{"key":"e_1_3_2_1_25_1","volume-title":"Arc: analysis of raft consensus. Tech. rep","author":"Howard H.","year":"2014","unstructured":"Howard , H. Arc: analysis of raft consensus. Tech. rep ., University of Cambridge , Computer Laboratory , 2014 . Howard, H. Arc: analysis of raft consensus. Tech. rep., University of Cambridge, Computer Laboratory, 2014."},{"key":"e_1_3_2_1_26_1","first-page":"1","volume":"4","author":"Howard H.","year":"2015","unstructured":"Howard , H. , Schwarzkopf , M. , Madhavapeddy , A. , and Crowcroft , J. Raft refloated: Do we have consensus? <i> Operating Systems Review 4 9<\/i>, 1 ( 2015 ), 12–21. Howard, H., Schwarzkopf, M., Madhavapeddy, A., and Crowcroft, J. Raft refloated: Do we have consensus? <i>Operating Systems Review 49<\/i>, 1 (2015), 12–21.","journal-title":"Operating Systems Review"},{"key":"e_1_3_2_1_27_1","volume-title":"August 19<\/i&gt","author":"King S.","year":"2012","unstructured":"King , S. , and Nadal , S . Ppcoin: Peer-to-peer crypto-currency with proof-of-stake. <i>self-published paper , August 19<\/i&gt ; ( 2012 ). King, S., and Nadal, S. Ppcoin: Peer-to-peer crypto-currency with proof-of-stake. <i>self-published paper, August 19<\/i> (2012)."},{"key":"e_1_3_2_1_28_1","first-page":"296","volume-title":"Enhancing bitcoin security and performance with strong consistency via collective signing. In <i>25th usenix security symposium (usenix security 16)<\/i&gt","author":"Kogias E. K.","year":"2016","unstructured":"Kogias , E. K. , Jovanovic , P. , Gailly , N. , Khoffi , I. , Gasser , L. , and Ford , B . Enhancing bitcoin security and performance with strong consistency via collective signing. In <i>25th usenix security symposium (usenix security 16)<\/i&gt ; ( 2016 ), pp. 279– 296 . Kogias, E. K., Jovanovic, P., Gailly, N., Khoffi, I., Gasser, L., and Ford, B. Enhancing bitcoin security and performance with strong consistency via collective signing. In <i>25th usenix security symposium (usenix security 16)<\/i> (2016), pp. 279–296."},{"key":"e_1_3_2_1_29_1","first-page":"58","volume-title":"Zyzzyva: speculative byzantine fault tolerance. In <i>ACM SIGOPS Operating Systems Review<\/i&gt","author":"Kotla R.","year":"2007","unstructured":"Kotla , R. , Alvisi , L. , Dahlin , M. , Clement , A. , and Wong , E . Zyzzyva: speculative byzantine fault tolerance. In <i>ACM SIGOPS Operating Systems Review<\/i&gt ; ( 2007 ), vol. 41 , ACM , pp. 45– 58 . Kotla, R., Alvisi, L., Dahlin, M., Clement, A., and Wong, E. Zyzzyva: speculative byzantine fault tolerance. In <i>ACM SIGOPS Operating Systems Review<\/i> (2007), vol. 41, ACM, pp. 45–58."},{"key":"e_1_3_2_1_30_1","first-page":"7","volume":"2","author":"Lamport L.","year":"1978","unstructured":"Lamport , L. Time , clocks, and the ordering of events in a distributed system. <i> Communications of the ACM 2 1<\/i>, 7 ( 1978 ), 558–565. Lamport, L. Time, clocks, and the ordering of events in a distributed system. <i>Communications of the ACM 21<\/i>, 7 (1978), 558–565.","journal-title":"ACM"},{"key":"e_1_3_2_1_31_1","first-page":"2","volume":"1","author":"Lamport L.","year":"1998","unstructured":"Lamport , L. , The part-time parliament. <i>ACM Transactions on Computer systems 1 6<\/i>, 2 ( 1998 ), 133–169. Lamport, L., et al. The part-time parliament. <i>ACM Transactions on Computer systems 16<\/i>, 2 (1998), 133–169.","journal-title":"The part-time parliament. <i>ACM Transactions on Computer systems"},{"key":"e_1_3_2_1_32_1","first-page":"4","volume":"3","author":"Lamport L.","year":"2001","unstructured":"Lamport , L. , Paxos made simple. <i>ACM Sigact News 3 2<\/i>, 4 ( 2001 ), 18–25. Lamport, L., et al. Paxos made simple. <i>ACM Sigact News 32<\/i>, 4 (2001), 18–25.","journal-title":"Paxos made simple. <i>ACM Sigact News"},{"key":"e_1_3_2_1_33_1","volume-title":"The byzantine generals problem. <i>ACM Transactions on Programming Languages and Systems (TOPLAS) 4<\/i>, 3","author":"Lamport L.","year":"1982","unstructured":"Lamport , L. , Shostak , R. , and Pease , M . The byzantine generals problem. <i>ACM Transactions on Programming Languages and Systems (TOPLAS) 4<\/i>, 3 ( 1982 ), 382–401. Lamport, L., Shostak, R., and Pease, M. The byzantine generals problem. <i>ACM Transactions on Programming Languages and Systems (TOPLAS) 4<\/i>, 3 (1982), 382–401."},{"key":"e_1_3_2_1_34_1","volume-title":"Born and raised distributively: Fully distributed non-interactive adaptively-secure threshold signatures with short shares. <i>Theoretical Computer Science 645<\/i&gt","author":"Libert B.","year":"2016","unstructured":"Libert , B. , Joye , M. , and Yung , M . Born and raised distributively: Fully distributed non-interactive adaptively-secure threshold signatures with short shares. <i>Theoretical Computer Science 645<\/i&gt ; ( 2016 ), 1–24. Libert, B., Joye, M., and Yung, M. Born and raised distributively: Fully distributed non-interactive adaptively-secure threshold signatures with short shares. <i>Theoretical Computer Science 645<\/i> (2016), 1–24."},{"key":"e_1_3_2_1_35_1","volume-title":"An introduction to libra","author":"Libra","year":"2019","unstructured":"Libra . An introduction to libra , 2019 . https:\/\/libra.org\/en-US\/white-paper\/. Libra. An introduction to libra, 2019. https:\/\/libra.org\/en-US\/white-paper\/."},{"key":"e_1_3_2_1_36_1","first-page":"42","volume-title":"ACM","author":"Miller A.","unstructured":"Miller , A. , Xia , Y. , Croman , K. , Shi , E. , and Song , D . The honey badger of bft protocols. In <i>Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security<\/i> (2016) , ACM , pp. 31– 42 . Miller, A., Xia, Y., Croman, K., Shi, E., and Song, D. The honey badger of bft protocols. In <i>Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security<\/i> (2016), ACM, pp. 31–42."},{"key":"e_1_3_2_1_37_1","first-page":"2","volume-title":"ACM","author":"Milutinovic M.","unstructured":"Milutinovic , M. , He , W. , Wu , H. , and Kanwal , M . Proof of luck: an efficient blockchain consensus protocol. In <i>Proceedings of the 1st Workshop on System Software for Trusted Execution<\/i> (2016) , ACM , p. 2 . Milutinovic, M., He, W., Wu, H., and Kanwal, M. Proof of luck: an efficient blockchain consensus protocol. In <i>Proceedings of the 1st Workshop on System Software for Trusted Execution<\/i> (2016), ACM, p. 2."},{"key":"e_1_3_2_1_38_1","unstructured":"Nakamoto S. etal Bitcoin: A peer-to-peer electronic cash system.  Nakamoto S. et al. Bitcoin: A peer-to-peer electronic cash system."},{"key":"e_1_3_2_1_39_1","first-page":"319","volume-title":"search of an understandable consensus algorithm. In <i>2014 USENIX Annual Technical Conference (USENIXATC 14)<\/i&gt","author":"Ongaro D.","year":"2014","unstructured":"Ongaro , D. , and Ousterhout , J . In search of an understandable consensus algorithm. In <i>2014 USENIX Annual Technical Conference (USENIXATC 14)<\/i&gt ; ( 2014 ), pp. 305– 319 . Ongaro, D., and Ousterhout, J. In search of an understandable consensus algorithm. In <i>2014 USENIX Annual Technical Conference (USENIXATC 14)<\/i> (2014), pp. 305–319."},{"key":"e_1_3_2_1_40_1","unstructured":"Pass R. and \n      Shi E\n  . \n  Hybrid Consensus: Efficient Consensus in the Permissionless Model. In <i>31st International Symposium on Distributed Computing (DISC 2017)<\/i&gt\n  ; (Dagstuhl Germany 2017\n  ) A. W. Richa Ed. vol. \n  91\n   of \n  <i>Leibniz International Proceedings in Informatics (LIPIcs)<\/i> Schloss Dagstuhl–Leibniz-Zentrum fuer \n  Informatik pp. 39:1–39:\n  16\n  .  Pass R. and Shi E. Hybrid Consensus: Efficient Consensus in the Permissionless Model. In <i>31st International Symposium on Distributed Computing (DISC 2017)<\/i> (Dagstuhl Germany 2017) A. W. Richa Ed. vol. 91 of <i>Leibniz International Proceedings in Informatics (LIPIcs)<\/i> Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik pp. 39:1–39:16."},{"key":"e_1_3_2_1_41_1","first-page":"220","volume-title":"Practical threshold signatures. In <i>International Conference on the Theory and Applications of Cryptographic Techniques<\/i&gt","author":"Shoup V.","year":"2000","unstructured":"Shoup , V. Practical threshold signatures. In <i>International Conference on the Theory and Applications of Cryptographic Techniques<\/i&gt ; ( 2000 ), Springer , pp. 207– 220 . Shoup, V. Practical threshold signatures. In <i>International Conference on the Theory and Applications of Cryptographic Techniques<\/i> (2000), Springer, pp. 207–220."},{"key":"e_1_3_2_1_42_1","first-page":"144","volume-title":"Spin one's wheels? byzantine fault tolerance with a spinning primary. In <i>2009 28th IEEE International Symposium on Reliable Distributed Systems<\/i&gt","author":"Veronese G. S.","year":"2009","unstructured":"Veronese , G. S. , Correia , M. , Bessani , A. N. , and Lung , L. C . Spin one's wheels? byzantine fault tolerance with a spinning primary. In <i>2009 28th IEEE International Symposium on Reliable Distributed Systems<\/i&gt ; ( 2009 ), IEEE , pp. 135– 144 . Veronese, G. S., Correia, M., Bessani, A. N., and Lung, L. C. Spin one's wheels? byzantine fault tolerance with a spinning primary. In <i>2009 28th IEEE International Symposium on Reliable Distributed Systems<\/i> (2009), IEEE, pp. 135–144."},{"key":"e_1_3_2_1_43_1","first-page":"125","volume-title":"The quest for scalable blockchain fabric: Proof-of-work vs. bft replication. In <i>International workshop on open problems in network security<\/i&gt","author":"Vukoli\u0107 M.","year":"2015","unstructured":"Vukoli\u0107 , M. The quest for scalable blockchain fabric: Proof-of-work vs. bft replication. In <i>International workshop on open problems in network security<\/i&gt ; ( 2015 ), Springer , pp. 112– 125 . Vukoli\u0107, M. The quest for scalable blockchain fabric: Proof-of-work vs. bft replication. In <i>International workshop on open problems in network security<\/i> (2015), Springer, pp. 112–125."},{"key":"e_1_3_2_1_44_1","first-page":"356","volume-title":"Hotstuff: Bft consensus with linearity and responsiveness. In <i>Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing<\/i&gt","author":"Yin M.","year":"2019","unstructured":"Yin , M. , Malkhi , D. , Reiter , M. K. , Gueta , G. G. , and Abraham , I . Hotstuff: Bft consensus with linearity and responsiveness. In <i>Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing<\/i&gt ; ( 2019 ), pp. 347– 356 . Yin, M., Malkhi, D., Reiter, M. K., Gueta, G. G., and Abraham, I. Hotstuff: Bft consensus with linearity and responsiveness. In <i>Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing<\/i> (2019), pp. 347–356."},{"key":"e_1_3_2_1_45_1","first-page":"649","volume-title":"Byzantine ordered consensus without byzantine oligarchy. In <i>14th USENIX Symposium on Operating Systems Design and Implementation (OSDI 20)<\/i&gt","author":"Zhang Y.","year":"2020","unstructured":"Zhang , Y. , Setty , S. , Chen , Q. , Zhou , L. , and Alvisi , L . Byzantine ordered consensus without byzantine oligarchy. In <i>14th USENIX Symposium on Operating Systems Design and Implementation (OSDI 20)<\/i&gt ; ( 2020 ), pp. 633– 649 . Zhang, Y., Setty, S., Chen, Q., Zhou, L., and Alvisi, L. Byzantine ordered consensus without byzantine oligarchy. In <i>14th USENIX Symposium on Operating Systems Design and Implementation (OSDI 20)<\/i> (2020), pp. 633–649."}],"event":{"name":"Middleware '21: 22nd International Middleware Conference","location":"Qu\u00e9bec city Canada","acronym":"Middleware '21","sponsor":["ACM Association for Computing Machinery","USENIX Assoc USENIX Assoc","IFIP"]},"container-title":["Proceedings of the 22nd International Middleware Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3464298.3484503","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3464298.3484503","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:12:15Z","timestamp":1750191135000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3464298.3484503"}},"subtitle":["an efficient BFT consensus algorithm with behavior-aware penalization against Byzantine attacks"],"short-title":[],"issued":{"date-parts":[[2021,10,2]]},"references-count":44,"alternative-id":["10.1145\/3464298.3484503","10.1145\/3464298"],"URL":"https:\/\/doi.org\/10.1145\/3464298.3484503","relation":{},"subject":[],"published":{"date-parts":[[2021,10,2]]},"assertion":[{"value":"2021-10-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}