Network Codes Resilient to Jamming and Eavesdropping
Network Codes Resilient to Jamming and Eavesdropping
复制标题
DOI：
10.1109/netcod.2010.5487669
复制
发表时间：
2010-01
期刊：
影响因子：
--
通讯作者：
Hongyi Yao;Danilo Silva;S. Jaggi;M. Langberg
中科院分区：
文献类型：
--
作者：
Hongyi Yao;Danilo Silva;S. Jaggi;M. Langberg
我们考虑了在隐藏的敌手存在的情况下通过网络秘密而可靠地通信信息的问题，该敌手可以窃听并注入恶意错误。我们为这种情况提供了多项式时间、速率最优的分布式网络编码，改进了(Ngai和Yeung，2009)中所能达到的速率。我们的主要贡献表明，只要敌方的干扰率Z_O和他的窃听率Z_I之和小于网络容量C(即，Z_O+Z_I<；C)，我们的代码就可以(以极小的差错概率)正确地通信一比特，并且不会向对手泄露任何信息。然后，我们使用它来设计代码，允许以C-Z_O-Z_I的最佳信源速率进行通信，同时对被通信的消息保密。内部节点对对手的存在视而不见，并执行随机线性网络编码；只需调整源和目的地。在证明我们的结果时，我们纠正了先前工作(Jaggi和Langberg，2007)中的一个错误，该错误是由本工作中的一部分作者提出的。
We consider the problem of communicating information over a network secretly and reliably in the presence of a hidden adversary who can eavesdrop and inject malicious errors. We provide polynomial-time, rate-optimal distributed network codes for this scenario, improving on the rates achievable in (Ngai and Yeung, 2009). Our main contribution shows that as long as the sum of the adversary's jamming rate Z_O and his eavesdropping rate Z_I is less than the network capacity C, (i.e., Z_O + Z_I < C), our codes can communicate (with vanishingly small error probability) a single bit correctly and without leaking any information to the adversary. We then use this to design codes that allow communication at the optimal source rate of C - Z_O - Z_I, while keeping the communicated message secret from the adversary. Interior nodes are oblivious to the presence of adversaries and perform random linear network coding; only the source and destination need to be tweaked. In proving our results we correct an error in prior work (Jaggi and Langberg, 2007) by a subset of the authors in this work.