Reduction Theorem for Secrecy over Linear Network Code for Active Attacks

03/26/2020
by   Masahito Hayashi, et al.
0

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 improve the power of eavesdropping by sequential error injection when the operations in the network are linear operations. We demonstrate the usefulness of this reduction theorem by applying a concrete example of network.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/27/2020

Secure network code over one-hop relay network

When there exists a malicious attacker in the network, we need to consid...
research
12/25/2017

Secure Network Code for Adaptive and Active Attacks with No-Randomness in Intermediate Nodes

We analyze the security for network code when the eavesdropper can conta...
research
12/14/2018

Conditional bias reduction can be dangerous: a key example from sequential analysis

We present a key example from sequential analysis, which illustrates tha...
research
11/18/2019

A Code injection Method for Rapid Docker Image Building

Docker images are built by layers, yet the current implementation has ma...
research
03/28/2022

Injection testing backed refactoring

Injection-based testing while refactoring is a pattern that minimizes th...
research
03/27/2020

Asymptotically Secure Network Code for Active Attacks and its Application to Network Quantum Key Distribution

When there exists a malicious attacker in the network, we need to be car...

Please sign up or login with your details

Forgot password? Click here to reset