Random Linear Network Coding: A free cipher?

Abstract

THIS PAPER IS ELIGIBLE FOR THE STU-DENT PAPER AWARD" 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.

An Efficient Reliable Communication Scheme in Wireless Sensor Networks Using Linear Network Coding

“…In practice, random linear coding has been widely used in the literature [15,22], because of the simplicity of the coding scheme. With random linear coding, random linear combinations of the packets can be forwarded by a node, which the node received previously, to outgoing edges.…”

A Secure Network Coding-based Data Gathering Model and Its Protocol in Wireless Sensor Networks

“…The first kind is mainly for resisting internal attackers, i.e., preventing intermediate nodes from acquiring source private data by using the information flowing across them [3][4][5] . Lima et al 3 showed that network coding could offer information-theoretic security against internal attackers with high probability, if the source disseminates encoded blocks of data by using multiple paths and the size of the codeword field goes to infinity. 4 proposed a secure multi-path network coding schemes for WSNs.…”

“…Some SNC protocols are designed for preserving private data from being obtained by any intermediate node that is not an intended recipient [3][4][5] . Some are for resisting eavesdropping attacks [6][7][8] , and the others are for resisting pollution attacks [9][10][11][12][13][14] , both of which are external attacks.…”

Trusted Storage over Untrusted Networks

“…The work in [15] derives bounds for the probability of decoding an individual symbol in a network where Random Linear Network Coding (RLNC, i.e., random mixings of packets at the intermediate nodes of the network) is used. It is shown that RLNC increases the security for a threat model in which the intermediate nodes comply with the protocol however may try to decode as much as possible.…”