Reduction Theorem for Secrecy over Linear Network Code for Active Attacks†
1
Shenzhen Institute for Quantum Science and Engineering, Southern University of Science and Technology, Shenzhen 518055, China
2
Guangdong Provincial Key Laboratory of Quantum Science and Engineering, Southern University of Science and Technology, Shenzhen 518055, China
3
Shenzhen Key Laboratory of Quantum Science and Engineering, Southern University of Science and Technology, Shenzhen 518055, China
4
Graduate School of Mathematics, Nagoya University, Nagoya 464-8602, Japan
5
Department of Computer Science, Faculty of Informatics, Shizuoka University, Shizuoka 422-8529, Japan
6
NTT Communication Science Laboratories, NTT Corporation, Tokyo 100-8116, Japan
7
The School of Information Science and Technology, ShanghaiTech University, Middle Huaxia Road no. 393, Pudong, Shanghai 201210, China
*
Author to whom correspondence should be addressed.
†
Parts of this paper were presented at the 2017 IEEE International Symposium on Information Theory (ISIT 2017), Aachen, Germany, 25–30 June 2017.
‡
These authors contributed equally to this work.
Entropy 2020, 22(9), 1053; https://doi.org/10.3390/e22091053
Received: 27 August 2020 / Revised: 16 September 2020 / Accepted: 16 September 2020 / Published: 21 September 2020
(This article belongs to the Special Issue Multiuser Information Theory III)
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.
View Full-Text
Keywords:
secrecy analysis; secure network coding; sequential injection; passive attack; active attack
▼
Show Figures
Figure 1
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited
MDPI and ACS Style
Hayashi, M.; Owari, M.; Kato, G.; Cai, N. Reduction Theorem for Secrecy over Linear Network Code for Active Attacks. Entropy 2020, 22, 1053. https://doi.org/10.3390/e22091053
AMA Style
Hayashi M, Owari M, Kato G, Cai N. Reduction Theorem for Secrecy over Linear Network Code for Active Attacks. Entropy. 2020; 22(9):1053. https://doi.org/10.3390/e22091053
Chicago/Turabian StyleHayashi, Masahito; Owari, Masaki; Kato, Go; Cai, Ning. 2020. "Reduction Theorem for Secrecy over Linear Network Code for Active Attacks" Entropy 22, no. 9: 1053. https://doi.org/10.3390/e22091053
Find Other Styles
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.
Search more from Scilit
