跳到主要导航 跳到搜索 跳到主要内容

Performance bounds in secure network coding

  • Fan Cheng*
  • , Raymond W. Yeung
  • *此作品的通讯作者
  • Chinese University of Hong Kong

科研成果: 书/报告/会议事项章节 › 会议稿件 › 同行评审

摘要

Consider a communication network represented by a directed graph script G = (script V, script E), where script V is the set of nodes and script E is the set of point-to-point channels in the network. On the network a secure message M is transmitted, and there may exist wiretappers who want to obtain information about the message. In secure network coding, we aim to find a network code which can protect the message against the wiretapper whose power is constrained. Cai and Yeung [3] studied the model in which the wiretapper can access any one but not more than one set of channels, called a wiretap set, out of a collection A of all possible wiretap sets. In order to protect the message, the message needs to be mixed with a random key K. They proved tight fundamental performance bounds when A consists of all subsets of E of a fixed size r. In this paper, we investigate the problem when A consists of arbitrary subsets of script E and obtain the following results: 1) an upper bound on H(M); 2) a lower bound on H(K) in terms of H(M). The upper bound on H(M) is explicit, while the lower bound on H(K) can be computed in polynomial time. The tightness of the lower bound for the point-to-point communication system is also proved.

源语言英语
主期刊名2011 International Symposium on Network Coding, NETCOD 2011 - Proceedings
DOI
出版状态已出版 - 2011
已对外发布是
活动2011 International Symposium on Network Coding, NETCOD 2011 - Beijing, 中国
期限: 25 7月 2011 → 27 7月 2011

丛书

姓名2011 International Symposium on Network Coding, NETCOD 2011 - Proceedings

会议

会议2011 International Symposium on Network Coding, NETCOD 2011
国家/地区中国
市Beijing
时期25/07/11 → 27/07/11

学术指纹

探究 'Performance bounds in secure network coding' 的科研主题。它们共同构成独一无二的学术指纹。

引用此