2 papers
cs.DC2026
Byzantine Consensus in Directed Graphs with Message Authentication
Nitin H. Vaidya, Lewis Tseng
We consider the problem of reaching consensus in communication networks that are modeled by directed graphs. We assume the existence of a message authentication mechanism (such as…
cs.DC2024
Byzantine fault-tolerant distributed set intersection with redundancy
Shuo Liu, Nitin H. Vaidya
In this report, we study the problem of Byzantine fault-tolerant distributed set intersection and the importance of redundancy in solving this problem. Specifically, consider a dis…