ACS

[논문 세미나] Practical Signature-Free ACS in Constant Time

Author: SisiDuan, Xin Wang, HaibinZhang Journal/Conference: draft. https://eprint.iacr.org/2023/154 Presentation material: Reproposable ABA 를 CKPS 계열의 BFT 프로토콜에 적용하여 합의 속도를 증가시킨 케이스. RBC phase 의 network bandwidth consumption 이 dominant 하다. (communication complexity 와 message complexity 가 여전히 \(O(n^3)\)) Weak RBC 는 기억할만하다. 메세지는 처음 교환할 때만 이루어지고, 메세지에 대한 합의는 hash of message 를 이용해서 communication com..

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

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