Practical Byzantine reliable broadcast on partially connected networks
In this paper, we consider the Byzantine reliable broadcast problem on authenticated and
partially connected networks. The state-of-the-art method to solve this problem consists in …
partially connected networks. The state-of-the-art method to solve this problem consists in …
Resilient trajectory propagation in multirobot networks
J Usevitch, D Panagou - IEEE Transactions on Robotics, 2021 - ieeexplore.ieee.org
This article presents a novel method for a class of multirobot networks to resiliently
propagate vector messages from a set of leaders to all followers within the network in the …
propagate vector messages from a set of leaders to all followers within the network in the …
Reliable broadcast with respect to topology knowledge
Abstract We study the Reliable Broadcast problem in incomplete networks against a
Byzantine adversary. We examine the problem under the locally bounded adversary model …
Byzantine adversary. We examine the problem under the locally bounded adversary model …
Reliable communication in dynamic networks with locally bounded byzantine faults
The Byzantine tolerant reliable communication primitive is a fundamental building block in
distributed systems that guarantees the authenticity, integrity, and delivery of information …
distributed systems that guarantees the authenticity, integrity, and delivery of information …
Resilient leader-follower consensus with time-varying leaders in discrete-time systems
J Usevitch, D Panagou - 2019 IEEE 58th Conference on …, 2019 - ieeexplore.ieee.org
The problem of consensus in the presence of adversarially behaving agents has been
studied extensively in the literature. The proposed algorithms typically guarantee that the …
studied extensively in the literature. The proposed algorithms typically guarantee that the …
Reliable broadcast in dynamic networks with locally bounded byzantine failures
Ensuring reliable communication despite possibly malicious participants is a primary
objective in any distributed system or network. In this paper, we investigate the possibility of …
objective in any distributed system or network. In this paper, we investigate the possibility of …
Asynchronous Byzantine approximate consensus in directed networks
This paper considers the problem of approximate consensus in directed asynchronous
message-passing networks where some nodes may become Byzantine faulty. We obtain a …
message-passing networks where some nodes may become Byzantine faulty. We obtain a …
Reliable Communication in Hybrid Authentication and Trust Models
Reliable communication is a fundamental distributed communication abstraction that allows
any two nodes of a network to communicate with each other. It is necessary for more …
any two nodes of a network to communicate with each other. It is necessary for more …
Reliable communication via semilattice properties of partial knowledge
A fundamental primitive in distributed computing is Reliable Message Transmission (RMT),
which refers to the task of correctly sending a message from a party to another, despite the …
which refers to the task of correctly sending a message from a party to another, despite the …
[PDF][PDF] Reliable Message Transmission under Partial Knowledge.
A fundamental primitive in distributed computing is Reliable Message Transmission (RMT),
which refers to the task of correctly sending a message from a party to another, despite the …
which refers to the task of correctly sending a message from a party to another, despite the …