Secure coding over networks
ISIT（2009）
摘要
In this paper we study the problem of secure communication over a network in which each link may be noisy or noiseless. A single-source single-sink acyclic planar network is considered, and the communication between the source and the sink is subject to non-cooperating eavesdropping on each link. Sufficient conditions, in terms of communication rates and network parameters, are found for provable secure communication, along with an intuitive and efficient coding scheme. The derived achievable rate equivocation region is tight when specializing to several special cases.
更多查看译文
关键词
secure coding,networks,single-source single-sink acyclic planar network,cryptography,eavesdropping,single-source single-sink acyclic planar,provable secure communication,encoding,special case,achievable rate equivocation region,sufficient condition,non-cooperating eavesdropping,secure communication,network parameter,telecommunication security,efficient coding scheme,communication rate,noisy link,communication systems,provable security,noise measurement,channel coding,data mining,network security,network coding
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要