Reduction Theorem for Secrecy over Linear Network Code for Active Attacks
Keyword(s):
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.
2016 ◽
Vol 82
(3)
◽
pp. 559-582
◽
2020 ◽
Vol 66
(6)
◽
pp. 3954-3954
2020 ◽
Vol 66
(3)
◽
pp. 1428-1448
◽
2017 ◽
Vol 21
(3)
◽
pp. 448-451
◽
2017 ◽
Vol 25
(6)
◽
pp. 3441-3454
◽