Performance Bounds in Secure Network Coding
Consider a communication network represented by a directed graph G=(V, E), where V is the set of nodes and 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 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.
Fan Cheng Raymond W.Yeung
Department of Information Engineering, The Chinese University of Hong Kong, N.T., Hong Kong
国际会议
2011 International Symposium on Network Coding(2011网络编码国际会议 NETCOD 2011)
北京
英文
1-6
2011-07-25（万方平台首次上网日期，不代表论文的发表时间）