Reduction Theorem for Secrecy over Linear Network Code for Active Attacks †

We discuss the effect of sequential error injection on information leakage under a network code. We formulate a network code for the single transmission setting and the multiple transmission setting. Under this formulation, we show that the eavesdropper cannot increase the power of eavesdropping by...

Descripción completa

Detalles Bibliográficos
Autores principales: Hayashi, Masahito, Owari, Masaki, Kato, Go, Cai, Ning
Formato: Online Artículo Texto
Lenguaje:English
Publicado: MDPI 2020
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7597126/
https://www.ncbi.nlm.nih.gov/pubmed/33286822
http://dx.doi.org/10.3390/e22091053
_version_ 1783602269159161856
author Hayashi, Masahito
Owari, Masaki
Kato, Go
Cai, Ning
author_facet Hayashi, Masahito
Owari, Masaki
Kato, Go
Cai, Ning
author_sort Hayashi, Masahito
collection PubMed
description We discuss the effect of sequential error injection on information leakage under a network code. We formulate a network code for the single transmission setting and the multiple transmission setting. Under this formulation, we show that the eavesdropper cannot increase the power of eavesdropping by sequential error injection when the operations in the network are linear operations. We demonstrated the usefulness of this reduction theorem by applying a concrete example of network.
format Online
Article
Text
id pubmed-7597126
institution National Center for Biotechnology Information
language English
publishDate 2020
publisher MDPI
record_format MEDLINE/PubMed
spelling pubmed-75971262020-11-09 Reduction Theorem for Secrecy over Linear Network Code for Active Attacks † Hayashi, Masahito Owari, Masaki Kato, Go Cai, Ning Entropy (Basel) Article We discuss the effect of sequential error injection on information leakage under a network code. We formulate a network code for the single transmission setting and the multiple transmission setting. Under this formulation, we show that the eavesdropper cannot increase the power of eavesdropping by sequential error injection when the operations in the network are linear operations. We demonstrated the usefulness of this reduction theorem by applying a concrete example of network. MDPI 2020-09-21 /pmc/articles/PMC7597126/ /pubmed/33286822 http://dx.doi.org/10.3390/e22091053 Text en © 2020 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).
spellingShingle Article
Hayashi, Masahito
Owari, Masaki
Kato, Go
Cai, Ning
Reduction Theorem for Secrecy over Linear Network Code for Active Attacks †
title Reduction Theorem for Secrecy over Linear Network Code for Active Attacks †
title_full Reduction Theorem for Secrecy over Linear Network Code for Active Attacks †
title_fullStr Reduction Theorem for Secrecy over Linear Network Code for Active Attacks †
title_full_unstemmed Reduction Theorem for Secrecy over Linear Network Code for Active Attacks †
title_short Reduction Theorem for Secrecy over Linear Network Code for Active Attacks †
title_sort reduction theorem for secrecy over linear network code for active attacks †
topic Article
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7597126/
https://www.ncbi.nlm.nih.gov/pubmed/33286822
http://dx.doi.org/10.3390/e22091053
work_keys_str_mv AT hayashimasahito reductiontheoremforsecrecyoverlinearnetworkcodeforactiveattacks
AT owarimasaki reductiontheoremforsecrecyoverlinearnetworkcodeforactiveattacks
AT katogo reductiontheoremforsecrecyoverlinearnetworkcodeforactiveattacks
AT caining reductiontheoremforsecrecyoverlinearnetworkcodeforactiveattacks

Ejemplares similares