BFT
![[논문 세미나] PACE: Fully Parallelizable BFT from Reproposable Byzantine Agreement](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdna%2FOYlTe%2Fbtr2D9H7hL4%2FAAAAAAAAAAAAAAAAAAAAAMyt7NGPr4kXXhRNkafRGjHV8zRhgbod8iRoYhhuyNM7%2Fimg.png%3Fcredential%3DyqXZFxpELC7KVnFOS48ylbz2pIh7yKj8%26expires%3D1769871599%26allow_ip%3D%26allow_referer%3D%26signature%3Dq8mX9H5UZxt4XJkTd6EO%252BU5yn68%253D)
[논문 세미나] 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](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdna%2FcvF2g1%2Fbtr2DDbEabl%2FAAAAAAAAAAAAAAAAAAAAAOna9OFrdJzyqssGVtY8aXVU5t599r5DeJOBzSi0UBAG%2Fimg.png%3Fcredential%3DyqXZFxpELC7KVnFOS48ylbz2pIh7yKj8%26expires%3D1769871599%26allow_ip%3D%26allow_referer%3D%26signature%3DH1OkTlnlR8yhHRcbLcCF34QiWOo%253D)
[논문 리뷰] 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 ..
