[07-01] Algorithmic Foundation of Blockchain: the Case of Broadcast
Title: Algorithmic Foundation of Blockchain: the Case of Broadcast
Speaker: Zhuolun Xiang (Carnegie Mellon University)
Venue: 线上报告，腾讯会议 321 480 877
Abstract: Byzantine fault-tolerant broadcast is a fundamental primitive for many fault-tolerant distributed systems, including blockchain, secure multi-party computation, and distributed cryptographic protocols. For many of these applications, the communication cost of broadcasting a long message, and the latency for finishing broadcast under a non-faulty broadcaster are crucial. This talk will overview several recent results of broadcast focusing on the metrics above, and discuss how they imply improvements over different applications.
Bio: Zhuolun Xiang is a postdoctoral fellow at Carnegie Mellon University, hosted by Prof. Elaine Shi. Prior to that, Zhuolun received his PhD in Computer Science from the University of Illinois at Urbana-Champaign in 2022, advised by Prof. Ling Ren and Prof. Nitin Vaidya, and obtained his bachelor's degree at Tsinghua University in 2016, where he studied computer science at "Yao Class". Zhuolun is generally interested in distributed algorithms & systems, and recently fault-tolerant consensus (blockchain), applied cryptography and parallel execution. Many research outputs appeared at top-tier venues of computer security and distributed computing such as ACM CCS, ACM PODC and IEEE S&P. His study Block-STM was merged on Diem blockchain to support faster parallel transaction execution.