Secure Consensus via Objective Coding: Robustness Analysis to Channel Tampering
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2021
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866913668617207808 |
|---|---|
| author | Fabris, Marco Zelazo, Daniel |
| author_facet | Fabris, Marco Zelazo, Daniel |
| contents | This work mainly addresses continuous-time multiagent consensus networks where an adverse attacker affects the convergence performances of said protocol. In particular, we develop a novel secure-by-design approach in which the presence of a network manager monitors the system and broadcasts encrypted tasks (i.e., hidden edge weight assignments) to the agents involved. Each agent is then expected to decode the received codeword containing data on the task through appropriate decoding functions by leveraging advanced security principles, such as objective coding and information localization. Within this framework, a stability analysis is conducted for showing the robustness to channel tampering in the scenario where part of the codeword corresponding to a single link in the system is corrupted. A tradeoff between objective coding capability and network robustness is also pointed out. To support these novelties, an application example on decentralized estimation is provided. Moreover, an investigation of the robust agreement is as well extended in the discrete-time domain. Further numerical simulations are given to validate the theoretical results in both the time domains. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2107_04276 |
| institution | arXiv |
| publishDate | 2021 |
| record_format | arxiv |
| spellingShingle | Secure Consensus via Objective Coding: Robustness Analysis to Channel Tampering Fabris, Marco Zelazo, Daniel Systems and Control This work mainly addresses continuous-time multiagent consensus networks where an adverse attacker affects the convergence performances of said protocol. In particular, we develop a novel secure-by-design approach in which the presence of a network manager monitors the system and broadcasts encrypted tasks (i.e., hidden edge weight assignments) to the agents involved. Each agent is then expected to decode the received codeword containing data on the task through appropriate decoding functions by leveraging advanced security principles, such as objective coding and information localization. Within this framework, a stability analysis is conducted for showing the robustness to channel tampering in the scenario where part of the codeword corresponding to a single link in the system is corrupted. A tradeoff between objective coding capability and network robustness is also pointed out. To support these novelties, an application example on decentralized estimation is provided. Moreover, an investigation of the robust agreement is as well extended in the discrete-time domain. Further numerical simulations are given to validate the theoretical results in both the time domains. |
| title | Secure Consensus via Objective Coding: Robustness Analysis to Channel Tampering |
| topic | Systems and Control |
| url | https://arxiv.org/abs/2107.04276 |