Show simple item record

dc.contributor.authorOliva, G.en
dc.contributor.authorCioaba, S.en
dc.contributor.authorHadjicostis, Christoforos N.en
dc.creatorOliva, G.en
dc.creatorCioaba, S.en
dc.creatorHadjicostis, Christoforos N.en
dc.description.abstractIn this paper we provide a distributed methodology to allow a network of agents, tasked to execute a distributed algorithm, to overcome Man-in-the-middle attacks that aim at steering the result of the algorithm towards inconsistent values or dangerous configurations. We want the agents to be able to restore the correct result of the algorithm in spite of the attacks. To this end, we provide a distributed algorithm to let the set of agents, interconnected by an undirected network topology, construct several $edge-disjoint spanning trees$ by assigning a label to their incident edges. The ultimate objective is to use these spanning trees to run multiple instances of the same distributed algorithm in parallel, in order to be able to detect Man-in-the- middle attacks or other faulty or malicious link behavior (e.g., when the instances yield different results) and to restore the correct result (when the majority of instances is unaffected). The proposed algorithm is lightweight and asynchronous, and is based on iterated depth-first visits on the graph. We complement the paper with a thorough analysis of the performance of the proposed algorithms. IEEEen
dc.sourceIEEE Transactions on Control of Network Systemsen
dc.subjectParallel algorithmsen
dc.subjectNetwork protocolsen
dc.subjectNetwork architectureen
dc.subjectAlgorithm design and analysisen
dc.subjectControl systemsen
dc.subjectControl system analysisen
dc.subjectTrees (mathematics)en
dc.subjectDistributed algorithmsen
dc.subjectEdge detectionen
dc.subjectEdge disjoint spanning treesen
dc.subjectEdge-disjoint spanning treesen
dc.subjectElectronic mailen
dc.subjectImage edge detectionen
dc.subjectMan in the middle attacksen
dc.subjectMan-in-the-middle attacksen
dc.subjectSoftware agentsen
dc.subjectTree packingen
dc.subjectTree packing problemen
dc.titleDistributed Calculation of Edge-Disjoint Spanning Trees for Robustifying Distributed Algorithms against Man-in-the-Middle Attacksen
dc.description.issueJournal ArticleenΠολυτεχνική Σχολή / Faculty of EngineeringΤμήμα Ηλεκτρολόγων Μηχανικών και Μηχανικών Υπολογιστών / Department of Electrical and Computer Engineering
dc.source.abbreviationIEEE Trans.Control Netw.Syst.en
dc.contributor.orcidHadjicostis, Christoforos N. [0000-0002-1706-708X]

Files in this item


There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record