Author:
Song Yu,Long Yu,Xu Xian,Gu Dawu
Publisher
Springer Nature Singapore
Reference21 articles.
1. Byzantine broadcasts and randomized consensus (2009). https://dcl.epfl.ch/site/education/secure_distributed_computing
2. Cachin, C., Shoup, V.: Random oracles in constantinople: practical asynchronous byzantine agreement using. In: Proceedings of the 19th ACM Symposium on Principles of Distributed Computing, pp. 1–26 (2000)
3. Canetti, R., Rabin, T.: Fast asynchronous byzantine agreement with optimal resilience. In: Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, STOC 1993, pp. 42–51 (1993)
4. Castro, M., Liskov, B., et al.: Practical byzantine fault tolerance. In: OSDI, vol. 99, pp. 173–186 (1999)
5. 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, pp. 34–50 (2022)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献