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.
Lima et al. REF , after considering the threats of the intermediate nodes, developed a security criterion to access intrinsic security provided by network coding.
Random Linear Network Coding: A free cipher?
2007 IEEE International Symposium on Information Theory
2007 IEEE International Symposium on Information Theory
Mathematics Computer Science