전체 글

[논문 리뷰] Narwhal and Tusk: A DAG-based Mempool and Efficient BFT Consensus

Authors : George Danezis, Lefteris Kokoris-Kogias, Alberto Sonnino, and Alexander Spiegelman Journal/Conference : EuroSys '22, New York, NY, USA, 34–50. Source : https://doi.org/10.1145/3492321.3519594 Abstract We propose separating the task of reliable transaction dissemination from transaction ordering, to enable high-performance Byzantine fault-tolerant quorum-based consensus. We design and e..

[논문 세미나] HotStuff: BFT Consensus with Linearity and Responsiveness

Authors: Yin, M., Malkhi, D., Reiter, M. K., Gueta, G. G., & Abraham, I. Journal/Conference: In Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing (pp. 347-356). Source: https://dl.acm.org/doi/10.1145/3293611.3331591 Presentation material: 저자인 Dahila Malkhi 가 HotStuff-2 를 새롭게 제안했다. paper 는 작성중인 draft 만 발견할 수 있다. 이번 세미나 자료에는 hotstuff-2 에 대한 간략한 개념도 포함했다. Abstract We pres..

학부시절 MDPI Sensors 논문 출판 후기.

학부시절 졸업하면서 MDPI Sensors에 제출한 논문이 최종적으로 accept 되었다.  Efficient Lp Distance Computation Using Function-Hiding Inner Product Encryption for Privacy-Preserving Anomaly DetectionIn Internet of Things (IoT) systems in which a large number of IoT devices are connected to each other and to third-party servers, it is crucial to verify whether each device operates appropriately. Although anomaly det..

[논문 세미나] 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..

[논문 리뷰] Scaling Blockchain Consensus via a Robust Shared Mempool

Author: Fangyu Gai, Jianyu Niu, Ivan Beschastnikh, Chen Feng, Sheng Wang Journal/Conference: ICDE 2023 Source: https://arxiv.org/abs/2203.05158 Abstract There is a resurgence of interest in Byzantine fault-tolerant (BFT) systems due to blockchains. However, leader-based BFT consensus protocols used by permissioned blockchains have limited scalability and robustness. To alleviate the leader bottl..

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