Load Balanced Scalable Byzantine Agreement through Quorum Building, with Full Information-Reference-Cited by-同舟云学术

Load Balanced Scalable Byzantine Agreement through Quorum Building, with Full Information

Published:2011 Issue: Volume: Page:203-214
ISSN:0302-9743
Container-title:Distributed Computing and Networking
language:
Short-container-title:

Author:

King Valerie,Lonargan Steven,Saia Jared,Trehan Amitabh

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-17679-1_18

Reference18 articles.

1. Aspnes, J., Shah, G.: Skip graphs. In: SODA, pp. 384–393 (2003)

2. Attiya, H., Welch, J.: Distributed Computing: Fundamentals, Simulations and Advanced Topics. John Wiley & Sons, Chichester (2004)

3. Awerbuch, B., Scheideler, C.: Provably secure distributed name service. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142. Springer, Heidelberg (2004)

4. Lecture Notes in Computer Science;B. Awerbuch,2005

5. Awerbuch, B., Scheideler, C.: Towards a Scalable and Robust DHT. In: SPAA, pp. 318–327 (2006)

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

1. DARE to Agree: Byzantine Agreement With Optimal Resilience and Adaptive Communication;Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing;2024-06-17

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

3. Optimal Load-Balanced Scalable Distributed Agreement;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

4. Scalable Agreement Protocols with Optimal Optimistic Efficiency;Lecture Notes in Computer Science;2024

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