Random Linear Network Coding: A free cipher?

TL;DR

This paper investigates the security of random linear network coding against eavesdroppers, introducing an algebraic security criterion and analyzing how network topology influences security in such scenarios.

Contribution

It develops a new algebraic security criterion for network coding and analyzes the impact of network topology on security in a 'nice but curious' setting.

Findings

Algebraic security criterion for network coding established

Network topology affects security levels, especially in complete directed acyclic graphs

Preliminary analysis shows potential vulnerabilities and strengths

Abstract

We consider the level of information security provided by random linear network coding in network scenarios in which all nodes comply with the communication protocols yet are assumed to be potential eavesdroppers (i.e. "nice but curious"). For this setup, which differs from wiretapping scenarios considered previously, we develop a natural algebraic security criterion, and prove several of its key properties. A preliminary analysis of the impact of network topology on the overall network coding security, in particular for complete directed acyclic graphs, is also included.