DocumentCode
2022798
Title
Random Linear Network Coding: A free cipher?
Author
Lima, L. ; Medard, M. ; Barros, J.
Author_Institution
Dept. of Comput. Sci., Univ. do Porto, Porto
fYear
2007
fDate
24-29 June 2007
Firstpage
546
Lastpage
550
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
cryptography; linear codes; protocols; random codes; telecommunication security; algebraic security criterion; communication protocol; directed acyclic graphs; free cipher; information security; network topology; random linear network coding; Costs; Cryptography; Data security; Decoding; Graph theory; Information security; Information theory; Network coding; Network topology; Protocols; graph theory; information theory; network coding; security;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2007. ISIT 2007. IEEE International Symposium on
Conference_Location
Nice
Print_ISBN
978-1-4244-1397-3
Type
conf
DOI
10.1109/ISIT.2007.4557282
Filename
4557282
Link To Document