Security by Network Coding
Katia Jaffrès‐Runser, Cédric Lauradoux · 2012
This chapter focuses on security methods taken from information theory rather than from cryptology. It examines the attacks exclusively on the confidentiality of messages exchanged on the network on the basis of transmissions about which an attacker is trying to find information conveyed by source(s). To secure the network against nice but curious attackers, the principle idea proposed in is to define an algebraic security criterion that guarantees that a random linear combination of data to the intermediary nodes prevents these nodes from understanding the information. Algebraic security criterion aims to measure the local security level and it presents the characteristics of random linear network coding. The main difficulty in ensuring confidentiality by network coding is being able to guarantee the conditions of the type-II wiretap network. Controlled Vocabulary Terms information theory; network coding