Please use this identifier to cite or link to this item:
Title: Optimal design of linear network coding for information theoretically secure unicast
Authors: Wang, J
Wang, J
Lu, K
Qian, Y
Xiao, B 
Gu, N
Issue Date: 2011
Source: Proceedings - IEEE INFOCOM, 2011, p. 757-765 How to cite?
Abstract: In this paper, we study the optimal design of linear network coding (LNC) for secure unicast against passive attacks, under the requirement of information theoretical security (ITS). The objectives of our optimal LNC design include (1) satisfying the ITS requirement, (2) maximizing the transmission rate of a unicast stream, and (3) minimizing the number of additional random symbols. We first formulate the problem that maximizes the secure transmission rate under the requirement of ITS, which is then transformed to a constrained maximum network flow problem.We devise an efficient algorithm that can find the optimal transmission topology. Based on the transmission topology, we then design a deterministic LNC which satisfies the aforementioned objectives and provide a constructive upper bound of the size of the finite field. In addition, we also study the potential of random LNC and derive the low bound of the probability that a random LNC is information theoretically secure.
Description: IEEE INFOCOM 2011, Shanghai, 10-15 April 2011
ISBN: 9781424499212
ISSN: 0743-166X
DOI: 10.1109/INFCOM.2011.5935296
Appears in Collections:Conference Paper

View full-text via PolyU eLinks SFX Query
Show full item record


Last Week
Last month
Citations as of Dec 4, 2018

Page view(s)

Last Week
Last month
Citations as of Dec 9, 2018

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.