{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T22:13:57Z","timestamp":1766441637654,"version":"3.28.0"},"reference-count":44,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1109\/nca.2018.8548057","type":"proceedings-article","created":{"date-parts":[[2018,11,29]],"date-time":"2018-11-29T18:47:51Z","timestamp":1543517271000},"page":"1-8","source":"Crossref","is-referenced-by-count":118,"title":["DBFT: Efficient Leaderless Byzantine Consensus and its Application to Blockchains"],"prefix":"10.1109","author":[{"given":"Tyler","family":"Crain","sequence":"first","affiliation":[]},{"given":"Vincent","family":"Gramoli","sequence":"additional","affiliation":[]},{"given":"Mikel","family":"Larrea","sequence":"additional","affiliation":[]},{"given":"Michel","family":"Raynal","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"journal-title":"DBFT Efficient byzantine consensus with a weak coordinator and its application to consortium blockchains","year":"2017","author":"crain","key":"ref39"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/197917.198088"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/46.1.16"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2015.2427797"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxh145"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/98163.98167"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2005.153"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/322186.322188"},{"journal-title":"Communication and Agreement Abstractions for Fault-tolerant Asynchronous Distributed Systems","year":"2010","author":"raynal","key":"ref35"},{"journal-title":"Distributed Algorithms","year":"1996","author":"nancy","key":"ref34"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/7531.7533"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(82)90033-3"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/571637.571640"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2006.35"},{"key":"ref13","first-page":"45","article-title":"Zyzzyva: Speculative byzantine fault tolerance","author":"kotla","year":"2007","journal-title":"Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles ser SOSP ‘07"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2014.43"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2658994"},{"key":"ref16","first-page":"485","article-title":"XFT: practical fault tolerance beyond crashes","author":"liu","year":"2016","journal-title":"12th USENIX Symposium on Operating Systems Design and Implementation OSDI 2016"},{"key":"ref17","first-page":"153","article-title":"Making byzantine fault tolerant systems tolerate byzantine faults","author":"clement","year":"2009","journal-title":"Proceedings of the 6th USENIX Symposium on Networked Systems Design and Implementation Ser NSDI'09"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2010.70"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2013.53"},{"journal-title":"The Red Belly Blockchain","year":"2017","author":"gramoli","key":"ref28"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/s00446-002-0083-3","article-title":"Resilient-optimal interactive consistency in constant time","volume":"16","author":"ben-or","year":"2003","journal-title":"Distributed Computing"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978399"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-002-0081-5"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2837019"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/359545.359563"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167105"},{"key":"ref8","first-page":"31:1","article-title":"Signature-free asynchronous binary byzantine consensus with n\/3, o(n2) messages, and o(1) expected time","volume":"62","year":"2015","journal-title":"J ACM"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2611462.2611468"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/357172.357176"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/42282.42283"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/3149.214121"},{"key":"ref20","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/978-3-642-11322-2_11","article-title":"A leader-free byzantine consensus algorithm","author":"borran","year":"2010","journal-title":"Distributed Computing and Networking"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/226643.226647"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/BF01667080"},{"journal-title":"Optimistic asynchronous byzantine agreement","year":"2000","author":"kursawe","key":"ref42"},{"key":"ref24","first-page":"1469","article-title":"ComChain: Bridging the gap between public and consortium blockchains","author":"vizier","year":"2018","journal-title":"Proceedings of the IEEE International Conference on Blockchain ‘18)"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15260-3"},{"journal-title":"Bitcoin A Peer-to-Peer Electronic Cash System","year":"2008","author":"nakamoto","key":"ref23"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(87)90054-X"},{"journal-title":"Tendermint Byzantine Fault Tolerance in the Age of Blockchains","year":"2016","author":"buchman","key":"ref26"},{"key":"ref43","first-page":"524","article-title":"Secure and efficient asynchronous broadcast protocols","author":"cachin","year":"2001","journal-title":"Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology ser CRYPTO ‘01"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2018.00018"}],"event":{"name":"2018 IEEE 17th International Symposium on Network Computing and Applications (NCA)","start":{"date-parts":[[2018,11,1]]},"location":"Cambridge, MA","end":{"date-parts":[[2018,11,3]]}},"container-title":["2018 IEEE 17th International Symposium on Network Computing and Applications (NCA)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8533540\/8548052\/08548057.pdf?arnumber=8548057","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,27]],"date-time":"2022-01-27T10:20:41Z","timestamp":1643278841000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8548057\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11]]},"references-count":44,"URL":"https:\/\/doi.org\/10.1109\/nca.2018.8548057","relation":{},"subject":[],"published":{"date-parts":[[2018,11]]}}}