Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/29188
Title: Optimal linear network coding design for secure unicast with multiple streams
Authors: Wang, J
Wang, J
Lu, K
Xiao, B 
Gu, N
Keywords: Network coding
Throughput capacity
Weakly secure
Issue Date: 2010
Source: Proceedings - IEEE INFOCOM, 2010, 5462049 How to cite?
Abstract: Linear network coding is a promising technology that can maximize the throughput capacity of communication network. Despite this salient feature, there are still many challenges to be addressed, and security is clearly one of the most important challenges. In this paper, we will address the design of secure linear network coding. Specifically, we will investigate the network coding design that can both satisfy the weakly secure requirements and maximize the transmission data rate of multiple unicast streams between the same source and destination pair, which has not been addressed in the literature. In our study, we first prove that the secure unicast routing problem is equivalent to a constrained link-disjoint path problem. We then develop efficient algorithm that can find the optimal unicast topology in a polynomial amount of time. Based on the topology, we design deterministic linear network code that is weakly secure and can be constructed at the source node. And finally, we investigate the potential of random linear code for weakly secure unicast and prove the low bound of the probability that a random linear code is weakly secure.
Description: IEEE INFOCOM 2010, San Diego, CA, 14-19 March 2010
URI: http://hdl.handle.net/10397/29188
ISBN: 9781424458363
ISSN: 0743-166X
DOI: 10.1109/INFCOM.2010.5462049
Appears in Collections:Conference Paper

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

SCOPUSTM   
Citations

18
Last Week
0
Last month
0
Citations as of Sep 9, 2017

Page view(s)

33
Last Week
2
Last month
Checked on Sep 18, 2017

Google ScholarTM

Check

Altmetric



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