Hao Lu
ABSTRACT
The main issue that hinders the widespread deployment of blockchains is their low throughput and high latency. This has revitalized the search for efficient Byzantine fault-tolerance (BFT) protocols. However, existing BFT protocols either require two-phase voting or speculative execution (which may require replicas to rollback some executions). In this paper, we propose Dagger, which only requires a single voting phase in the optimistic case where all replicas are correct; and it does not require any rollback in the worst-case.
- Ittai Abraham, Guy Gueta, Dahlia Malkhi, Lorenzo Alvisi, Rama Kotla, and Jean-Philippe Martin. Revisiting fast practical byzantine fault tolerance. arXiv preprintarXiv:1712.01367, 2017.Google Scholar
- Ittai Abraham, Guy Gueta, Dahlia Malkhi, and Jean-Philippe Martin. Revisiting fast practical byzantine fault tolerance: Thelma, velma, and zelma. arXiv preprint arXiv:1801.10022, 2018.Google Scholar
- Ittai Abraham, Dahlia Malkhi, Kartik Nayak, Ling Ren, and Maofan Yin. Synchotstuff: Synchronous smr with 2 latency and optimistic responsiveness.Google Scholar
- Elli Androulaki, Artem Barger, Vita Bortnikov, Christian Cachin, Konstantinos Christidis, Angelo De Caro, David Enyeart, Christopher Ferris, Gennady Laventman, Yacov Manevich, et al. Hyperledger Fabric: A distributed operating system for permissioned blockchains. arXiv preprint arXiv:1801.10228, 2018. Google ScholarDigital Library
- Dan Boneh, Ben Lynn, and Hovav Shacham. Short signatures from the weil pairing. In Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology, ASI-ACRYPT '01, pages 514--532, London, UK, 2001. Springer-Verlag. Google ScholarDigital Library
- Vitalik. Buterin. A next-generation smart contract and decentralized application platform, 2014. https://github.com/ethereum/wiki/wiki/White-Paper. 2 The throughput is calculated by dividing the batch size by the latency. We did not use multithread during implementation, so all transactions are proccessed in sequential. The actual throughput should be better than this.Google Scholar
- Miguel Castro and Barbara Liskov. Practical byzantine fault tolerance. In Proceedings of the Third Symposium on Operating Systems Design and Implementation, OSDI '99, pages 173--186, Berkeley, CA, USA, 1999. USENIX Association. Google ScholarDigital Library
- TH Hubert Chan, Rafael Pass, and Elaine Shi. Pili: A simple, fast, and robust family of blockchain protocols.Google Scholar
- TH Hubert Chan, Rafael Pass, and Elaine Shi. Pala: A simple partially synchronous blockchain, 2018.Google Scholar
- T. Distler, C. Cachin, and R. Kapitza. Resource-efficient byzantine fault tolerance. IEEE Transactions on Computers, 65(9):2807--2819, Sep. 2016. Google ScholarDigital Library
- Michael J. Fischer, Nancy A. Lynch, and Michael S. Paterson. Impossibility of distributed consensus with one faulty process. J. ACM, 32(2):374--382, April 1985. Google ScholarDigital Library
- Yossi Gilad, Rotem Hemo, Silvio Micali, Georgios Vlachos, and Nickolai Zeldovich. Algorand: Scaling byzantine agreements for cryptocurrencies. In Proceedings of the 26th Symposium on Operating Systems Principles, SOSP '17, pages 51--68, New York, NY, USA, 2017. ACM. Google ScholarDigital Library
- G. Golan Gueta, I. Abraham, S. Grossman, D. Malkhi, B. Pinkas, M. Reiter, D. Seredinschi, O. Tamir, and A. Tomescu. Sbft: A scalable and decentralizedtrust infrastructure. In 2019 49th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN), pages 568--580, 2019.Google ScholarCross Ref
- Rachid Guerraoui, Nikola Kne?evic, Vivien Quéma, and Marko Vukolic. The next 700 bft protocols. In Proceedings of the 5th European Conference on Computer Systems, EuroSys'10, pages 363--376, New York, NY, USA, 2010. ACM. Google ScholarDigital Library
- Rüdiger Kapitza, Johannes Behl, Christian Cachin, Tobias Distler, Simon Kuhnle, Seyed Vahid Mohammadi, Wolfgang Schröder-Preikschat, and Klaus Stengel. CheapBFT: Resource-efficient byzantine fault tolerance. In Proceedings of the 7th ACM European Conference on Computer Systems, EuroSys '12, pages 295--308, New York, NY, USA, 2012. ACM. Google ScholarDigital Library
- Rüdiger Kapitza, Johannes Behl, Christian Cachin, Tobias Distler, Simon Kuhnle, Seyed Vahid Mohammadi, Wolfgang Schröder-Preikschat, and Klaus Stengel. CheapBFT: Resource-efficient Byzantine Fault Tolerance. In Proceedings of the 7th ACM European Conference on Computer Systems, 2012. Google ScholarDigital Library
- Eleftherios Kokoris Kogias, Philipp Jovanovic, Nicolas Gailly, Ismail Khoffi, Linus Gasser, and Bryan Ford. Enhancing bitcoin security and performance with strong consistency via collective signing. In 25th USENIX Security Symposium (USENIX Security 16), pages 279--296, Austin, TX, 2016. USENIX Association. Google ScholarDigital Library
- Eleftherios Kokoris-Kogias, Philipp Jovanovic, Linus Gasser, Nicolas Gailly, and Bryan Ford. Omniledger: A secure, scale-out, decentralized ledger. IACR Cryptology ePrint Archive, 2017:406, 2017.Google Scholar
- Ramakrishna Kotla, Lorenzo Alvisi, Mike Dahlin, Allen Clement, and Edmund Wong. Zyzzyva: Speculative byzantine fault tolerance. In Proceedings of Twenty-first ACM SIGOPS Symposium on Operating Systems Principles, SOSP '07, pages 45--58, New York, NY, USA, 2007. ACM. Google ScholarDigital Library
- Jian Liu, Wenting Li, Ghassan O. Karame, and N. Asokan. Scalable byzantine consensus via hardware-assisted secret sharing. arXiv preprint arXiv:1612.04997,2016.Google Scholar
- Satoshi Nakamoto. Bitcoin: A peer-to-peer electronic cash system, 2009. http://www.bitcoin.org/bitcoin.pdf.Google Scholar
- Team Rocket. Snowflake to avalanche: A novel metastable consensus protocol family for cryptocurrencies, 2018. https://avalanchelabs.org/avalanche.pdf.Google Scholar
- Mahnush Movahedi Timo Hanke and Dominic Williams. DFINITY technology overview series consensus system. https://dfinity.org/pdf-viewer/pdfs/viewer?file=../library/dfinity-consensus.pdf .Google Scholar
- Vuvuzela. BLS: go implementation. https://github.com/vuvuzela/crypto/blob/master/bls/bls.go.Google Scholar
- Maofan Yin, Dahlia Malkhi, Michael K Reiter, Guy Golan Gueta, and IttaiAbraham. Hotstuff: Bft consensus in the lens of blockchain. arXiv preprintarXiv:1803.05069, 2018.Google Scholar
Index Terms
- Dagger: Optimistic Byzantine Fault-Tolerance without Rollback
Recommendations
Optimistic Byzantine fault tolerance
The primary concern of traditional Byzantine fault tolerance is to ensure strong replica consistency by executing incoming requests sequentially according to a total order. Speculative execution at both clients and server replicas has been proposed as a ...
Multi-Threshold Byzantine Fault Tolerance
CCS '21: Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications SecurityClassic Byzantine fault tolerant (BFT) protocols are designed for a specific timing model, most often one of the following: synchronous, asynchronous or partially synchronous. It is well known that the timing model and fault tolerance threshold present ...
Efficient Byzantine Fault-Tolerance
We present two asynchronous Byzantine fault-tolerant state machine replication (BFT) algorithms, which improve previous algorithms in terms of several metrics. First, they require only 2f+1 replicas, instead of the usual 3f+1. Second, the trusted ...
Comments