By Topic

Refined Secure Network Coding Scheme with no Restriction on Coding Vectors

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Young-Sik Kim ; Dept. of Inf. & Commun. Eng., Chosun Univ., Gwangju, South Korea

In this letter, we consider the secure network coding problem with no restriction on the network coding vectors. Adeli and Liu proposed a scheme achieving perfect security in a network with network coding. In order to hide a security weakness of their scheme, they imposed a restriction on the linear network code design. However, this restriction can be violated when the random linear network coding is used due to the completely decentralized nature of it. We refine Adeli and Liu's scheme into new one with no restriction and thus remove the security weakness under the computationally bounded adversary assumption.

Published in:

Communications Letters, IEEE  (Volume:16 ,  Issue: 11 )