Performance Bounds on a Wiretap Network With Arbitrary Wiretap Sets
Publication in refereed journal


Times Cited
Web of Science13WOS source URL (as at 10/05/2021) Click here for the latest count
Altmetrics Information
.

Other information
AbstractConsider a communication network represented by a directed graph G = (nu, epsilon), where nu is the set of nodes and epsilon 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 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. However, beyond this special case, obtaining such bounds is much more difficult. 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) and 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 when vertical bar A vertical bar is fixed. The tightness of the lower bound for the point-to-point communication system is also proved.
All Author(s) ListCheng F, Yeung RW
Journal nameIEEE Transactions on Information Theory
Detailed descriptionIEEE.
Year2014
Month6
Day1
Volume Number60
Issue Number6
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
Pages3345 - 3358
ISSN0018-9448
eISSN1557-9654
LanguagesEnglish-United Kingdom
KeywordsInformation inequality; perfect secrecy; performance bounds; secure network coding
Web of Science Subject CategoriesComputer Science; Computer Science, Information Systems; Engineering; Engineering, Electrical & Electronic

Last updated on 2021-11-05 at 00:26