Gossip Average Consensus in a Byzantine Environment Using Stochastic Set-Valued Observers
Autor(a) principal: | |
---|---|
Data de Publicação: | 2013 |
Tipo de documento: | Artigo de conferência |
Idioma: | eng |
Título da fonte: | Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
Texto Completo: | http://hdl.handle.net/11144/3434 |
Resumo: | We address the problem of a consensus system in the presence of Byzantine faults seen as an attacker injecting a perturbation in the state of the nodes. We propose the use of Set-Valued Observers to detect if the state observations are compatible with the system dynamics. The method is extended to the stochastic case by introducing a strategy to construct a set that is guaranteed to contain all possible states with, at least, a pre-specified desired probability. The proposed algorithm is stable in the sense that it requires a finite number of vertices to represent polytopic sets while also enabling the a priori computation of the largest magnitude of a disturbance that an attacker can inject without being detected. |
id |
RCAP_7bb09d72d6a0cf414869bc4ac46fb9e6 |
---|---|
oai_identifier_str |
oai:repositorio.ual.pt:11144/3434 |
network_acronym_str |
RCAP |
network_name_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository_id_str |
7160 |
spelling |
Gossip Average Consensus in a Byzantine Environment Using Stochastic Set-Valued ObserversWe address the problem of a consensus system in the presence of Byzantine faults seen as an attacker injecting a perturbation in the state of the nodes. We propose the use of Set-Valued Observers to detect if the state observations are compatible with the system dynamics. The method is extended to the stochastic case by introducing a strategy to construct a set that is guaranteed to contain all possible states with, at least, a pre-specified desired probability. The proposed algorithm is stable in the sense that it requires a finite number of vertices to represent polytopic sets while also enabling the a priori computation of the largest magnitude of a disturbance that an attacker can inject without being detected.2018-02-07T21:08:15Z2013-12-01T00:00:00Z2013-12info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/conferenceObjectapplication/pdfhttp://hdl.handle.net/11144/3434engSilvestre, Danielinfo:eu-repo/semantics/openAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2024-01-11T02:13:56Zoai:repositorio.ual.pt:11144/3434Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-20T01:32:43.569942Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse |
dc.title.none.fl_str_mv |
Gossip Average Consensus in a Byzantine Environment Using Stochastic Set-Valued Observers |
title |
Gossip Average Consensus in a Byzantine Environment Using Stochastic Set-Valued Observers |
spellingShingle |
Gossip Average Consensus in a Byzantine Environment Using Stochastic Set-Valued Observers Silvestre, Daniel |
title_short |
Gossip Average Consensus in a Byzantine Environment Using Stochastic Set-Valued Observers |
title_full |
Gossip Average Consensus in a Byzantine Environment Using Stochastic Set-Valued Observers |
title_fullStr |
Gossip Average Consensus in a Byzantine Environment Using Stochastic Set-Valued Observers |
title_full_unstemmed |
Gossip Average Consensus in a Byzantine Environment Using Stochastic Set-Valued Observers |
title_sort |
Gossip Average Consensus in a Byzantine Environment Using Stochastic Set-Valued Observers |
author |
Silvestre, Daniel |
author_facet |
Silvestre, Daniel |
author_role |
author |
dc.contributor.author.fl_str_mv |
Silvestre, Daniel |
description |
We address the problem of a consensus system in the presence of Byzantine faults seen as an attacker injecting a perturbation in the state of the nodes. We propose the use of Set-Valued Observers to detect if the state observations are compatible with the system dynamics. The method is extended to the stochastic case by introducing a strategy to construct a set that is guaranteed to contain all possible states with, at least, a pre-specified desired probability. The proposed algorithm is stable in the sense that it requires a finite number of vertices to represent polytopic sets while also enabling the a priori computation of the largest magnitude of a disturbance that an attacker can inject without being detected. |
publishDate |
2013 |
dc.date.none.fl_str_mv |
2013-12-01T00:00:00Z 2013-12 2018-02-07T21:08:15Z |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/conferenceObject |
format |
conferenceObject |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
http://hdl.handle.net/11144/3434 |
url |
http://hdl.handle.net/11144/3434 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
application/pdf |
dc.source.none.fl_str_mv |
reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação instacron:RCAAP |
instname_str |
Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
instacron_str |
RCAAP |
institution |
RCAAP |
reponame_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
collection |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository.name.fl_str_mv |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
repository.mail.fl_str_mv |
|
_version_ |
1799136806995755008 |