33 citations · 254 across the 68 of their papers we have counts for
8 papers · 1 filter
Broadcast Using Certified Propagation Algorithm in Presence of Byzantine Faults
Lewis Tseng, Nitin Vaidya, Vartika Bhandari
We explore the correctness of the Certified Propagation Algorithm (CPA) [6, 1, 8, 5] in solving broadcast with locally bounded Byzantine faults. CPA allows the nodes to use only lo…
Parameter-independent Iterative Approximate Byzantine Consensus
Lewis Tseng, Nitin H. Vaidya
In this work, we explore iterative approximate Byzantine consensus algorithms that do not make explicit use of the global parameter of the graph, i.e., the upper-bound on the numbe…
Exact Byzantine Consensus in Directed Graphs
Lewis Tseng, Nitin Vaidya
Consider a synchronous point-to-point network of n nodes connected by directed links, wherein each node has a binary input. This paper proves a tight necessary and sufficient condi…
Iterative Approximate Byzantine Consensus under a Generalized Fault Model
Lewis Tseng, Nitin Vaidya
In this work, we consider a generalized fault model that can be used to represent a wide range of failure scenarios, including correlated failures and non-uniform node reliabilitie…
Iterative Approximate Byzantine Consensus in Arbitrary Directed Graphs - Part II: Synchronous and Asynchronous Systems
Nitin Vaidya, Lewis Tseng, Guanfeng Liang
This report contains two related sets of results with different assumptions on synchrony. The first part is about iterative algorithms in synchronous systems. Following our previou…
Matrix Representation of Iterative Approximate Byzantine Consensus in Directed Graphs
Nitin Vaidya
This paper presents a proof of correctness of an iterative approximate Byzantine consensus (IABC) algorithm for directed graphs. The iterative algorithm allows fault- free nodes to…