Efficient and Adaptively Secure Asynchronous Binary Agreement via Binding Crusader Agreement-Reference-Cited by-同舟云学术

Efficient and Adaptively Secure Asynchronous Binary Agreement via Binding Crusader Agreement

Published:2022-07-20 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing
language:
Short-container-title:

Author:

Abraham Ittai¹,Ben-David Naama²,Yandamuri Sravya³

Affiliation:

1. VMware Research, Herzelia, Israel

2. VMware Research, Palo Alto, CA, USA

3. Duke University, Durham, NC, USA

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3519270.3538426

Reference29 articles.

1. Reaching Consensus for Asynchronous Distributed Key Generation

2. Marcos Kawazoe Aguilera and Sam Toueg . Correctness proof of ben-or's randomized consensus algorithm . Distributed Computing , 1998 . Marcos Kawazoe Aguilera and Sam Toueg. Correctness proof of ben-or's randomized consensus algorithm. Distributed Computing, 1998.

3. Naama Ben-David and Kartik Nayak . Brief announcement : Classifying trusted hardware via unidirectional communication . In ACM Symposium on Principles of Distributed Computing (PODC) , pages 191 -- 194 , 2021 . Naama Ben-David and Kartik Nayak. Brief announcement: Classifying trusted hardware via unidirectional communication. In ACM Symposium on Principles of Distributed Computing (PODC), pages 191--194, 2021.

4. Michael Ben-Or . Another advantage of free choice (extended abstract) completely asynchronous agreement protocols . In ACM Symposium on Principles of Distributed Computing (PODC) , pages 27 -- 30 , 1983 . Michael Ben-Or. Another advantage of free choice (extended abstract) completely asynchronous agreement protocols. In ACM Symposium on Principles of Distributed Computing (PODC), pages 27--30, 1983.

5. Brief Announcement: Simple Gradecast Based Algorithms

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Byzantine consensus is $$\Theta (n^2)$$: the Dolev-Reischuk bound is tight even in partial synchrony!;Distributed Computing;2023-12-11

2. ParBFT: Faster Asynchronous BFT Consensus with a Parallel Optimistic Path;Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security;2023-11-15

3. Simplex Consensus: A Simple and Fast Consensus Protocol;Theory of Cryptography;2023

4. Bolt-Dumbo Transformer;Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security;2022-11-07