TY - GEN
T1 - Performance bounds in secure network coding
AU - Cheng, Fan
AU - Yeung, Raymond W.
PY - 2011
Y1 - 2011
N2 - 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.
AB - 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.
KW - Perfect secrecy
KW - performance bounds
KW - secure network coding
UR - https://www.scopus.com/pages/publications/80053002686
U2 - 10.1109/ISNETCOD.2011.5978913
DO - 10.1109/ISNETCOD.2011.5978913
M3 - 会议稿件
AN - SCOPUS:80053002686
SN - 9781612841403
T3 - 2011 International Symposium on Network Coding, NETCOD 2011 - Proceedings
BT - 2011 International Symposium on Network Coding, NETCOD 2011 - Proceedings
T2 - 2011 International Symposium on Network Coding, NETCOD 2011
Y2 - 25 July 2011 through 27 July 2011
ER -