Randomized BFT

[논문 리뷰] Signature-Free Asynchronous Byzantine Consensus with t<n/3 and O(n^2) Messages

Authors : Mostéfaoui, A., Moumen, H., & Raynal, M Journal/Conference: 2014 ACM symposium on Principles of distributed computing source: https://dl.acm.org/doi/abs/10.1145/2611462.2611468 [Abstract] This paper presents a new round-based asynchronous consensus algorithm that copes with up to t