Algorithms Seminar

Communication Complexity for Byzantine Fault Tolerant Consensus Protocols

February 1, -
Speaker(s): Kartik Nayak


Communication complexity is an important metric determining the practicality of consensus protocols. In this talk, we will describe the evolution of communication-efficient BFT protocols for small 1-bit messages and for extremely long messages.

Speaker Bio

Kartik Nayak is an assistant professor in the Department of Computer Science at Duke University and an academic advisor at Espresso Systems. He works in blockchains and applied cryptography. Before joining Duke University, he spent a year as a postdoctoral researcher at VMware Research. Before that, he graduated from the University of Maryland, College Park. He has served on program committees of several top-tier conferences, such as IEEE SP, ACM CCS, PODC, VLDB, Asiacrypt, and PoPETS. Kartik is a recipient of the 2016 Google Ph.D. fellowship in Security. His research is funded by the NSF CAREER Award, several NSF SaTC Awards, VMware Early Career Grant Award, Novi, Zcash Foundation, and Ethereum Foundation.


LSRC D344 or join virtually via Zoom



Yiheng Shen