{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T18:36:29Z","timestamp":1775068589033,"version":"3.50.1"},"reference-count":28,"publisher":"Oxford University Press (OUP)","issue":"3","license":[{"start":{"date-parts":[[2023,4,24]],"date-time":"2023-04-24T00:00:00Z","timestamp":1682294400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/pages\/standard-publication-reuse-rights"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2022YFB2702702"],"award-info":[{"award-number":["2022YFB2702702"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,4,14]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Byzantine ordered consensus, introduced by Zhang et al. (OSDI 2020), is a new consensus primitive that additionally guarantees a correctness specification of transaction order, allowing nodes to assign fairly an ordering indicator to the committed transaction. Zhang et al. also presented a concrete Byzantine ordered consensus protocol called Pomp\u0113 in the partially synchronous network model. However, Pomp\u0113 cannot prevent an adversary from manipulating message delivery time. In this paper, we present Chronos, the first Byzantine ordered consensus protocol in the asynchronous network model, where an adversary can arbitrarily manipulate message delivery time. To construct Chronos, we propose a variant of asynchronous common subset called signal asynchronous common subset protocol, which guarantees the liveness of Chronos. We implement both Chronos and its baseline HoneyBadgerBFT using Go language and deploy them on 100 Amazon t3.medium instances distributed throughout 10 regions across the world. The experimental results show that Chronos is more efficient than HoneyBadgerBFT for small network, achieving peak throughput of 59 368 tx\/s when the batch size is 100 000 and the number of nodes is 4, while the peak of HoneyBadgerBFT is 57 077 tx\/s.<\/jats:p>","DOI":"10.1093\/comjnl\/bxad048","type":"journal-article","created":{"date-parts":[[2023,4,25]],"date-time":"2023-04-25T18:34:07Z","timestamp":1682447647000},"page":"1153-1162","source":"Crossref","is-referenced-by-count":5,"title":["Chronos: An Efficient Asynchronous Byzantine Ordered Consensus"],"prefix":"10.1093","volume":"67","author":[{"given":"Zongyang","family":"Zhang","sequence":"first","affiliation":[{"name":"School of Cyber Science and Technology, Beihang University , Beijing, China"}]},{"given":"Lingyue","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Cyber Science and Technology, Beihang University , Beijing, China"}]},{"given":"Zhuo","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Cyber Science and Technology, Beihang University , Beijing, China"}]},{"given":"Yichen","family":"Li","sequence":"additional","affiliation":[{"name":"School of Cyber Science and Technology, Beihang University , Beijing, China"}]},{"given":"Rongxing","family":"Lu","sequence":"additional","affiliation":[{"name":"Faculty of Computer Science, University of New Brunswick , Canada"}]},{"given":"Yong","family":"Yu","sequence":"additional","affiliation":[{"name":"School of Computer Science, Shaanxi Normal University , Xi\u2019an, China"}]}],"member":"286","published-online":{"date-parts":[[2023,4,24]]},"reference":[{"key":"2024041716572639200_ref1","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1145\/98163.98167","article-title":"Implementing fault-tolerant services using the state machine approach: a tutorial","volume":"22","author":"Schneider","year":"1990","journal-title":"ACM Comput. Surv."},{"key":"2024041716572639200_ref2","first-page":"183","article-title":"Asynchronous secure computations with optimal resilience (extended abstract)","volume-title":"Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing","author":"Michael","year":"1994"},{"key":"2024041716572639200_ref3","first-page":"524","article-title":"Secure and efficient asynchronous broadcast protocols","volume-title":"Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology","author":"Christian","year":"2001"},{"key":"2024041716572639200_ref4","first-page":"167","article-title":"Secure intrusion-tolerant replication on the internet","volume-title":"2002 International Conference on Dependable Systems and Networks","author":"Cachin","year":"2002"},{"key":"2024041716572639200_ref5","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1145\/3318041.3355468","article-title":"Libra: Fair order-matching for electronic financial exchanges","volume-title":"Proceedings of the 1st ACM Conference on Advances in Financial Technologies","author":"Mavroudis","year":"2019"},{"key":"2024041716572639200_ref6","first-page":"30:1","article-title":"Hyperledger fabric: A distributed operating system for permissioned blockchains","volume-title":"Proceedings of the Thirteenth EuroSys Conference","author":"Elli","year":"2018"},{"key":"2024041716572639200_ref7","doi-asserted-by":"crossref","first-page":"910","DOI":"10.1109\/SP40000.2020.00040","article-title":"Flash boys 2.0: Frontrunning in decentralized exchanges, miner extractable value, and consensus instability","volume-title":"2020 IEEE Symposium on Security and Privacy","author":"Daian","year":"2020"},{"key":"2024041716572639200_ref8","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1109\/TDSC.2020.2979856","article-title":"A blockchain-based self-tallying voting protocol in decentralized iot","volume":"19","author":"Li","year":"2022","journal-title":"IEEE Transactions on Dependable and Secure Computing"},{"key":"2024041716572639200_ref9","doi-asserted-by":"crossref","first-page":"103628","DOI":"10.1016\/j.csi.2022.103628","article-title":"Accountable outsourcing data storage atop blockchain","volume":"82","author":"Xie","year":"2022","journal-title":"Comput. Stand. Interfaces"},{"key":"2024041716572639200_ref10","first-page":"633","article-title":"Byzantine ordered consensus without byzantine oligarchy","volume-title":"14th USENIX Symposium on Operating Systems Design and Implementation","author":"Zhang","year":"2020"},{"key":"2024041716572639200_ref11","first-page":"31","article-title":"The honey badger of bft protocols","volume-title":"Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security","author":"Andrew","year":"2016"},{"key":"2024041716572639200_ref12","first-page":"803","article-title":"Dumbo: Faster asynchronous bft protocols","volume-title":"Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security","author":"Bingyong","year":"2020"},{"key":"2024041716572639200_ref13","first-page":"2028","article-title":"Beat: Asynchronous bft made practical","volume-title":"Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security","author":"Sisi","year":"2018"},{"key":"2024041716572639200_ref14","first-page":"437","article-title":"Epic: Efficient asynchronous bft with adaptive security","volume-title":"2020 50th Annual IEEE\/IFIP International Conference on Dependable Systems and Networks","author":"Chao","year":"2020"},{"key":"2024041716572639200_ref15","first-page":"3151","article-title":"PACE: fully parallelizable BFT from reproposable byzantine agreement","author":"Zhang","year":"2022"},{"key":"2024041716572639200_ref16","first-page":"451","article-title":"Order-fairness for byzantine consensus","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"Mahimna","year":"2020"},{"key":"2024041716572639200_ref17","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1145\/3494105.3526239","article-title":"Order-fair consensus in the permissionless setting","volume-title":"Proceedings of the 9th ACM on ASIA Public-Key Cryptography Workshop","author":"Kelkar","year":"2022"},{"key":"2024041716572639200_ref18","article-title":"Themis: fast, strong order-fairness in byzantine consensus","author":"Kelkar","year":"2021"},{"key":"2024041716572639200_ref19","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1007\/978-3-031-18283-9_15","article-title":"Quick order fairness","volume-title":"Financial Cryptography and Data Security - 26th International Conference, FC","author":"Cachin","year":"2022"},{"key":"2024041716572639200_ref20","first-page":"55","article-title":"A fair consensus protocol for transaction ordering","volume-title":"IEEE 26th International Conference on Network Protocols","author":"Asayag","year":"2018"},{"key":"2024041716572639200_ref21","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1007\/11561927_42","article-title":"Asynchronous verifiable information dispersal","volume-title":"Distributed Computing, 19th International Conference","author":"Cachin","year":"2005"},{"key":"2024041716572639200_ref22","doi-asserted-by":"crossref","DOI":"10.1145\/3335772.3335934","article-title":"Time, Clocks, and the Ordering of Events in a Distributed System","volume-title":"Concurrency: The Works of Leslie Lamport","author":"Lamport","year":"2019"},{"key":"2024041716572639200_ref23","first-page":"2705","article-title":"Asynchronous data dissemination and its applications","volume-title":"Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security","author":"Sourav","year":"2021"},{"key":"2024041716572639200_ref24","first-page":"337","article-title":"Asymptotically optimal validated asynchronous byzantine agreement","volume-title":"Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing","author":"Ittai","year":"2019"},{"key":"2024041716572639200_ref25","first-page":"129","article-title":"Dumbo-mvba: Optimal multi-valued validated asynchronous byzantine agreement, revisited","volume-title":"ACM Symposium on Principles of Distributed Computing","author":"Lu","year":"2020"},{"key":"2024041716572639200_ref26","first-page":"154","article-title":"An asynchronous (n-1)\/3-resilient consensus protocol","volume-title":"Proceedings of the third annual ACM symposium on Principles of distributed computing","author":"Gabriel","year":"1984"},{"key":"2024041716572639200_ref27","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1137\/0108018","article-title":"Polynomial codes over certain finite fields","volume":"8","author":"Reed","year":"1960","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"2024041716572639200_ref28","first-page":"1491","article-title":"Simple and efficient threshold cryptosystem from the gap diffie-hellman group","volume-title":"IEEE Global Telecommunications Conference","author":"Joonsang","year":"2003"}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/67\/3\/1153\/57231517\/bxad048.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/67\/3\/1153\/57231517\/bxad048.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,17]],"date-time":"2024-04-17T20:00:42Z","timestamp":1713384042000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article\/67\/3\/1153\/7140286"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,24]]},"references-count":28,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2023,4,24]]},"published-print":{"date-parts":[[2024,4,14]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxad048","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"value":"0010-4620","type":"print"},{"value":"1460-2067","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2024,3]]},"published":{"date-parts":[[2023,4,24]]}}}