Asynchronous Byzantine Consensus on Undirected Graphs under Local Broadcast Model
MS Khan, N Vaidya - arXiv preprint arXiv:1909.02865, 2019 - arxiv.org
In this work we look at Byzantine consensus in asynchronous systems under the local
broadcast model. In the local broadcast model, a message sent by any node is received …
broadcast model. In the local broadcast model, a message sent by any node is received …
Asynchronous Byzantine Consensus on Undirected Graphs under Local Broadcast Model
M Samir Khan, N Vaidya - arXiv e-prints, 2019 - ui.adsabs.harvard.edu
In this work we look at Byzantine consensus in asynchronous systems under the local
broadcast model. In the local broadcast model, a message sent by any node is received …
broadcast model. In the local broadcast model, a message sent by any node is received …
Exact Byzantine consensus on arbitrary directed graphs under local broadcast model
We consider Byzantine consensus in a synchronous system where nodes are connected by
a network modeled as a directed graph, ie, communication links between neighboring …
a network modeled as a directed graph, ie, communication links between neighboring …
Exact Byzantine Consensus on Undirected Graphs under Local Broadcast Model
M Samir Khan, S Shalan Naqvi, NH Vaidya - arXiv e-prints, 2019 - ui.adsabs.harvard.edu
This paper considers the Byzantine consensus problem for nodes with binary inputs. The
nodes are interconnected by a network represented as an undirected graph, and the system …
nodes are interconnected by a network represented as an undirected graph, and the system …
Exact byzantine consensus on undirected graphs under local broadcast model
MS Khan, SS Naqvi, NH Vaidya - … of the 2019 ACM Symposium on …, 2019 - dl.acm.org
This paper considers the Byzantine consensus problem for nodes with binary inputs. The
nodes are interconnected by a network represented as an undirected graph, and the system …
nodes are interconnected by a network represented as an undirected graph, and the system …
Exact byzantine consensus under local-broadcast model
SS Naqvi, MS Khan, NH Vaidya - arXiv preprint arXiv:1811.08535, 2018 - arxiv.org
This paper considers the problem of achieving exact Byzantine consensus in a synchronous
system under a local-broadcast communication model. The nodes communicate with each …
system under a local-broadcast communication model. The nodes communicate with each …
Byzantine consensus under local broadcast model: Tight sufficient condition
MS Khan, NH Vaidya - arXiv preprint arXiv:1901.03804, 2019 - arxiv.org
In this work we consider Byzantine Consensus on undirected communication graphs under
the local broadcast model. In the classical point-to-point communication model the …
the local broadcast model. In the classical point-to-point communication model the …
Byzantine consensus with local multicast channels
MS Khan - Leibniz international proceedings in informatics, 2021 - par.nsf.gov
Byzantine consensus is a classical problem in distributed computing. Each node in a
synchronous system starts with a binary input. The goal is to reach agreement in the …
synchronous system starts with a binary input. The goal is to reach agreement in the …
Byzantine Consensus in Directed Hypergraphs
MS Khan, NH Vaidya - arXiv preprint arXiv:2109.01205, 2021 - arxiv.org
Byzantine consensus is a classical problem in distributed computing. Each node in a
synchronous system starts with a binary input. The goal is to reach agreement in the …
synchronous system starts with a binary input. The goal is to reach agreement in the …
Exact byzantine consensus in directed graphs
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 …
wherein each node has a binary input. This paper proves a tight necessary and sufficient …