2007/05/12 by Luísa Lima, Lima, Luísa, Muriel Médard +3 · 1 citation
Computer Science · Engineering · Mathematics · #Coding theory and cryptography #Cooperative Communication and Network Coding #Cryptography and Security (cs.CR) #FOS: Computer and information sciences #Information Theory (cs.IT) #Wireless Communication Security Techniques #cs.CR #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.0705.1789
5 pages, 2 figures, Accepted for the IEEE International Symposium on Information Theory, Nice, France, June, 2007
arxiv created 2007/05/12 · openalex publication_date 2007/05/12 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.