Home > Papers

 
 
Secure Network Coding Near Max Flow
Li Hui *,Zhou Yejun
State Key Lab of ISN, Xidian University
*Correspondence author
#Submitted by
Subject:
Funding: Doctoral Fund of Ministry of Education of China(No.No.20100203110002)
Opened online:13 January 2014
Accepted by: none
Citation: Li Hui,Zhou Yejun.Secure Network Coding Near Max Flow[OL]. [13 January 2014] http://en.paper.edu.cn/en_releasepaper/content/4579989
 
 
In this paper, a perfect information theoritical secure network coding scheme against the eavesdropping adversaries is proposed. We show that, if the number of channels the adversaries can eavesdrop on is less than the max-flow of a network, the max-flow of the network can be achieved. We also show that the proposed coding scheme has the property of being universal. All the coding scheme need is to reduce a small amount of overall capacity and a slightly modify the processing in the source and destinations, the operations at the intermediate nodes need not to be changed.
Keywords:Communication and Information System;Network coding; Security; Eavesdropping?
 
 
 

For this paper

  • PDF (0B)
  • ● Revision 0   
  • ● Print this paper
  • ● Recommend this paper to a friend
  • ● Add to my favorite list

    Saved Papers

    Please enter a name for this paper to be shown in your personalized Saved Papers list

Tags

Add yours

Related Papers

Statistics

PDF Downloaded 217
Bookmarked 0
Recommend 5
Comments Array
Submit your papers