2020
DOI: 10.48550/arxiv.2006.11711
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Resilient Consensus Against Mobile Malicious Agents

Abstract: This paper addresses novel consensus problems in the presence of adversaries that can move within the network and induce faulty behaviors in the attacked agents. By adopting several mobile adversary models from the computer science literature, we develop protocols which can mitigate the influence of such malicious agents. The algorithms follow the class of mean subsequence reduced (MSR) algorithms, under which agents ignore the suspicious values received from neighbors during their state updates. Different fro… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
6
0

Year Published

2021
2021
2021
2021

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(6 citation statements)
references
References 35 publications
(80 reference statements)
0
6
0
Order By: Relevance
“…We next introduce a lemma from our previous mobile malicious work [18]. This lemma will be used in the proofs of the results for the complete graph case studied in this section.…”
Section: Resiliency Results For Complete Graphsmentioning
confidence: 99%
See 4 more Smart Citations
“…We next introduce a lemma from our previous mobile malicious work [18]. This lemma will be used in the proofs of the results for the complete graph case studied in this section.…”
Section: Resiliency Results For Complete Graphsmentioning
confidence: 99%
“…The algorithm is outlined below. In particular, we present a modified version of the MSR algorithm from [18].…”
Section: A Resilient Consensusmentioning
confidence: 99%
See 3 more Smart Citations