BlockChain/[paper] Consensus

[논문 리뷰] 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..

[논문 세미나] PACE: Fully Parallelizable BFT from Reproposable Byzantine Agreement

Author: Haibin Zhang, Sisi Duan Jounal/Conference: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security source: (archive) https://eprint.iacr.org/2022/020 (acm sigsac) https://dl.acm.org/doi/abs/10.1145/3548606.3559348 Presentation material: [Abstract] The classic asynchronous Byzantine fault tolerance (BFT) framework of Ben-Or, Kemler, and Rabin (BKR) and its de..

[논문 리뷰] Asychronous Secure Computations with Optimal Resilience

Author: Ben-Or, M., Kelmer, B., & Rabin, T. Journal/Conference: In Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing. source: https://dl.acm.org/doi/pdf/10.1145/197917.198088 [Abstract] We investigate the problem of multiparty computations in a fully connected, asynchronous network of n players, in which up to t Byzantine faults may occur. It was shown in ..

[논문 리뷰] 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

[논문 리뷰] PBFT: Practical Byzantine Fault Tolerance

Authors : Miguel Castro, Barbara Liskov Source : OSDI 1999 [Background] 네트워크 환경 구분 3가지 : 메세지 송수신 간의 딜레이를 기준으로 (1) Synchronous, (2) Partially synchronous, (3) Asynchronous 로 구분함. Byzantine Fault Problem 을 해결하기 위해서는 Safety 와 Liveness 를 만족시켜야함. : Safety - replicated state machines 들이 linearizability를 만족하는 것. 동일한 인풋이 주어지면 모든 노드들이 같은 결과에 도달하는 것. 마치 하나의 머신이 요청을 atomic 하게 처리하는 것과 같은 효과를 내야함. : Liveness..