Malicious and coordinated attacks are happening increasingly often, and have targeted
critical systems such as nuclear plants, public transportation systems, hospitals and …

Critical infrastructures have to withstand advanced and persistent threats, which can be
addressed using Byzantine fault tolerant state-machine replication (BFT-SMR). In practice …

This paper addresses the problem of resilient in-network consensus in the presence of
misbehaving nodes. Secure and fault-tolerant consensus algorithms typically assume …

This thesis explores the resilient distributed consensus in networks that lack the necessary
structural robustness to achieve consensus in the presence of malicious agents. While exist …

This paper proposes a new approach that enables multi-agent systems to achieve
resilient\textit {constrained} consensus in the presence of Byzantine attacks, in contrast to …

Distributed consensus protocols are an important class of distributed algorithms. Recently,
an Adversarial Resilient Consensus Protocol (ARC-P) has been proposed which is capable …

This paper addresses the problem of resilient consensus in the presence of misbehaving
nodes. Although it is typical to assume knowledge of at least some nonlocal information …

Byzantine Fault tolerant (BFT) protocols are implemented to guarantee the correct
system/application behavior even in the presence of arbitrary faults (ie, Byzantine faults) …

Due to the openness of communication network and the complexity of system structures,
multi-agent systems are vulnerable to malicious network attacks, which can cause intense …

In this paper, we propose a scheme for a resilient distributed consensus problem through a
set of trusted nodes within the network. Currently, algorithms that solve resilient consensus …