On the Optimal Linear Network Coding Design for Information Theoretically Secure Unicast Streaming

The continuous growth of media-rich content calls for more efficient and secure methods for content delivery. In this paper, we will address the optimal linear network coding (LNC) design for secure unicast streaming against passive attacks, under the requirement of information theoretical security...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on multimedia 2016-06, Vol.18 (6), p.1149-1162
Main Authors: Wang, Jin, Wang, Jianping, Lu, Kejie, Qian, Yi, Gu, Naijie
Format: Article
Language:English
Subjects:
Bandwidth
Bandwidths
Bottlenecks
confidentiality
linear network coding
Network coding
Network topology
passive attack
Security
Streaming media
Topology
Unicast
unicast streaming
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The continuous growth of media-rich content calls for more efficient and secure methods for content delivery. In this paper, we will address the optimal linear network coding (LNC) design for secure unicast streaming against passive attacks, under the requirement of information theoretical security . The objectives include 1) satisfying the information theoretical security requirement, 2) maximizing the transmission rate of a unicast stream, 3) minimizing the number of additional random symbols, and 4) minimizing the total bandwidth cost of content delivery. To fulfill the first three objectives, we formulate an information theoretically secure unicast streaming (ITSUS) problem, and then solve it by transforming it to a maximum network flow problem with node-capacity constraints. Based on the solution of the ITSUS problem, we develop an efficient algorithm that can find the optimal transmission topology with minimum bandwidth cost in a polynomial amount of time. With the optimal transmission topology, we investigate the design of both deterministic LNC and random LNC. For the deterministic LNC design, we not only prove that it achieves the four objectives but also analyze the size of required finite field. Moreover, for the random LNC design, we analyze the probability that a random LNC scheme satisfies the information theoretical security requirement. Finally, extensive simulation experiments have been conducted, and the results demonstrate the effectiveness of the proposed algorithms.
ISSN:1520-9210
1941-0077
DOI:10.1109/TMM.2016.2545403