Sublinear Message Bounds of Authenticated Implicit Byzantine Agreement-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Sublinear Message Bounds of Authenticated Implicit Byzantine Agreement

Published:2024-01-04 Issue: Volume: Page:124-133
ISSN:
Container-title:Proceedings of the 25th International Conference on Distributed Computing and Networking
language:
Short-container-title:

Author:

Kumar Manish¹^ORCID,Molla Anisur Rahaman¹^ORCID

Affiliation:

1. Cryptology and Security Research Unit, Indian Statistical Institute, Kolkata, India

Funder

ISI DCSW

Publisher

ACM

Link

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

Reference49 articles.

1. Ittai Abraham TH Hubert Chan Danny Dolev Kartik Nayak Rafael Pass Ling Ren and Elaine Shi. 2019.. Communication complexity of byzantine agreement revisited. In PODC.

2. Ittai Abraham, Srinivas Devadas, Danny Dolev, Kartik Nayak, and Ling Ren. [n. d.]. Synchronous Byzantine Agreement with Expected O(1) Rounds, Expected O(n2) Communication, and Optimal Resilience. In FC 2019.

3. Ittai Abraham, Dahlia Malkhi, Kartik Nayak, Ling Ren, and Alexander Spiegelman. [n. d.]. Solida: A Blockchain Protocol Based on Reconfigurable Byzantine Consensus. In OPODIS 2017.

4. A. Agbaria and R. Friedman. 2003. Overcoming Byzantine Failures Using Checkpointing. UILU-ENG- 03-2228 (CRHC-03-14) (2003).

5. Yair Amir Claudiu Danilov Jonathan Kirsch John Lane Danny Dolev Cristina Nita-Rotaru Josh Olsen and David John Zage. 2006. Scaling Byzantine Fault-Tolerant Replication toWide Area Networks. In DSN.

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP