Expected Constant Round Byzantine Broadcast Under Dishonest Majority-Reference-Cited by-同舟云学术

Expected Constant Round Byzantine Broadcast Under Dishonest Majority

Published:2020 Issue: Volume: Page:381-411
ISSN:0302-9743
Container-title:Theory of Cryptography
language:
Short-container-title:

Author:

Wan Jun,Xiao Hanshen,Shi Elaine,Devadas Srinivas

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-030-64375-1_14

Reference37 articles.

1. Abraham, I., et al.: Communication complexity of Byzantine agreement, revisited. In: PODC (2019)

2. Abraham, I., Devadas, S., Dolev, D., Nayak, K., Ren, L.: Synchronous Byzantine agreement with optimal resilience, expected $$O(n^2)$$ communication, and expected $$O(1)$$ rounds. In: Financial Cryptography and Data Security (FC) (2019)

3. Abraham, I., Malkhi, D., Nayak, K., Ren, L., Spiegelman, A.: Solida: a blockchain protocol based on reconfigurable Byzantine consensus. In: OPODIS (2017)

4. Adya, A., et al.: FARSITE: federated, available, and reliable storage for an incompletely trusted environment. ACM SIGOPS Oper. Syst. Rev. 36(SI), 1–14 (2002)

5. Lecture Notes in Computer Science;A Bishop,2016

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

1. All Byzantine Agreement Problems Are Expensive;Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing;2024-06-17

2. Good-case early-stopping latency of synchronous byzantine reliable broadcast: the deterministic case;Distributed Computing;2024-03-22

3. Early Stopping for Any Number of Corruptions;Lecture Notes in Computer Science;2024

4. On the Correlation Complexity of MPC with Cheater Identification;Financial Cryptography and Data Security;2023-12-01

5. Breaking the $$O(\sqrt{n})$$-Bit Barrier: Byzantine Agreement with Polylog Bits Per Party;Journal of Cryptology;2023-10-27