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

Entropy

Masaki Owari¹  Go Kato²  Masahito Hayashi³  Ning Cai⁴ 

[1] Department of Computer Science, Faculty of Informatics, Shizuoka University, Shizuoka 422-8529, Japan;NTT Communication Science Laboratories, NTT Corporation, Tokyo 100-8116, Japan;Shenzhen Institute for Quantum Science and Engineering, Southern University of Science and Technology, Shenzhen 518055, China;The School of Information Science and Technology, ShanghaiTech University, Middle Huaxia Road no. 393, Pudong, Shanghai 201210, China;

关键词: secrecy analysis;    secure network coding;    sequential injection;    passive attack;    active attack;   

DOI  :  10.3390/e22091053

来源: DOAJ

【 摘 要 】

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.

【 授权许可】

Unknown