MMR ABA
![[논문 리뷰] The Honey Badger of BFT protocols](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdna%2FtrTFl%2Fbtr2UoyeP5J%2FAAAAAAAAAAAAAAAAAAAAAH3P8M99YYynOoBHufG7kGlWv2VsNQyVI4JIuqef-YaW%2Fimg.png%3Fcredential%3DyqXZFxpELC7KVnFOS48ylbz2pIh7yKj8%26expires%3D1756652399%26allow_ip%3D%26allow_referer%3D%26signature%3DOx%252Be6%252B5bzTpAYR8jI%252FsnWe9aO3A%253D)
[논문 리뷰] The Honey Badger of BFT protocols
Author: Miller, A., Xia, Y., Croman, K., Shi, E., & Song, D. Journal/Conference: Proceedings of the 2016 ACM SIGSAC conference on computer and communications security source: https://dl.acm.org/doi/abs/10.1145/2976749.2978399 [Abstract] The surprising success of cryptocurrencies has led to a surge of interest in deploying large scale, highly robust, Byzantine fault tolerant (BFT) protocols for m..
![[논문 리뷰] Signature-Free Asynchronous Byzantine Consensus with t<n/3 and O(n^2) Messages](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdna%2FE4QfN%2Fbtr2DDiePVk%2FAAAAAAAAAAAAAAAAAAAAALz0Ntc0UXRc57wDLNeCEjRekE6xEGpJlWbucK7SLHmB%2Fimg.png%3Fcredential%3DyqXZFxpELC7KVnFOS48ylbz2pIh7yKj8%26expires%3D1756652399%26allow_ip%3D%26allow_referer%3D%26signature%3DClcqltZD8XC6Fcd4ylMzgT2iWes%253D)
[논문 리뷰] 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