Random Linear Network Coding: A free cipher?
- 1 June 2007
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21578095,p. 546-550
- https://doi.org/10.1109/isit.2007.4557282
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.Keywords
All Related Versions
This publication has 6 references indexed in Scilit:
- Correction of adversarial errors in networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Security based on network topology against the wiretapping attackIEEE Wireless Communications, 2004
- An algebraic approach to network codingIEEE/ACM Transactions on Networking, 2003
- The benefits of coding over routing in a randomized settingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Network information flowIEEE Transactions on Information Theory, 2000
- Communication Theory of Secrecy Systems*Bell System Technical Journal, 1949