Open AccessProceedings Article10.1109/ISIT.2007.4557284

A Security Condition for Multi-Source Linear Network Coding

- 24 Jun 2007

- pp 561-565

TL;DR: A necessary and sufficient condition for the security of multi-source linear network codes is obtained by studying the algebraic structure of such codes and shows that theSecurity of a linear network code does not depend on the source distribution.

Abstract: We obtain a necessary and sufficient condition for the security of multi-source linear network codes by studying the algebraic structure of such codes. This condition is useful for analyzing the security of such linear network codes, and it applies in cases when the random keys do not necessarily have uniform distributions. This condition also shows that the security of a linear network code does not depend on the source distribution.

AI Agents for this Paper

Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps

Most frequently asked questions

1. What have the authors contributed in "A general security condition for multi-source linear network coding" ?

In this paper, the authors study the linear multi-source network coding security problem in [ 4 ], without the assumption that all source messages have positive distributions.. The authors obtain a necessary and sufficient security condition, which can be regarded as a generalization of the one in [ 4 ].

Citations

•Book

Information Theoretic Security

Yingbin Liang, +2 more

- 12 Jun 2009

TL;DR: Information Theoretic Security surveys the research dating back to the 1970s which forms the basis of applying this technique in modern systems to achieve secrecy for a basic wire-tap channel model as well as for its extensions to multiuser networks.

...read moreread less

918

Journal Article•10.1109/TIT.2010.2090197

Secure Network Coding on a Wiretap Network

Ning Cai, +1 more

- 01 Jan 2011

- IEEE Transactions on Information Theory

TL;DR: This paper proposes a model, call the wiretap network, that incorporates information security with network coding, and presents a construction of secure linear network codes that can be used provided a certain graph-theoretic condition is satisfied.

...read moreread less

276

Journal Article•10.1109/JPROC.2010.2094592

Theory of Secure Network Coding

Ning Cai, +1 more

- 24 Jan 2011

TL;DR: This tutorial paper presents a model for secure network coding and then a necessary and sufficient condition for a linear network code to be secure, and optimal methods to construct linear secure network codes are provided.

...read moreread less

121

•Journal Article•10.1109/TIT.2015.2429713

Relative Generalized Rank Weight of Linear Codes and Its Applications to Network Coding

Jun Kurihara, +2 more

- 05 May 2015

- IEEE Transactions on Information Theory

TL;DR: This paper introduces two new relative code parameters of a linear code C1 of length n over a field extension Fqm and its subcode C2 ⊆ C1, and introduces the relative generalized rank weight (RGRW).

...read moreread less

104

•Journal Article•10.1109/TIT.2012.2216936

On Secure Network Coding With Nonuniform or Restricted Wiretap Sets

Tao Cui, +2 more

- 01 Jan 2013

- IEEE Transactions on Information Theory

TL;DR: This paper considers secure network coding with nonuniform or restricted wiretap sets, for example, networks with unequal link capacities where a wiretapper can wiretap any subset of k links, or networks where only a subset of links can be wiretapped.

...read moreread less

...

Expand

References

Journal Article•10.1145/359168.359176

How to share a secret

Adi Shamir

- 01 Nov 1979

- Communications of The ACM

TL;DR: This technique enables the construction of robust key management schemes for cryptographic systems that can function securely and reliably even when misfortunes destroy half the pieces and security breaches expose all but one of the remaining pieces.

...read moreread less

16K

Journal Article•10.1002/J.1538-7305.1949.TB00928.X

Communication theory of secrecy systems

Claude E. Shannon

- 01 Oct 1949

- Bell System Technical Journal

TL;DR: A theory of secrecy systems is developed on a theoretical level and is intended to complement the treatment found in standard works on cryptography.

...read moreread less

10.1K

Journal Article•10.1109/TIT.2002.807285

Linear network coding

Shuo-Yen Robert Li, +2 more

- 01 Feb 2003

- IEEE Transactions on Information Theory

TL;DR: This work forms this multicast problem and proves that linear coding suffices to achieve the optimum, which is the max-flow from the source to each receiving node.

...read moreread less

3.9K

Proceedings Article•10.1109/MARK.1979.8817296

Safeguarding cryptographic keys

G. R. Blakley

- 01 Dec 1979

TL;DR: Certain cryptographic keys, such as a number which makes it possible to compute the secret decoding exponent in an RSA public key cryptosystem, 1 , 5 or the system master key and certain other keys in a DES cryptos system, 3 are so important that they present a dilemma.

...read moreread less

3.5K

•10.1109/AFIPS.1979.98

Safeguarding cryptographic keys

G. R. Blakley

- 30 Dec 1899

TL;DR: Certain cryptographic keys, such as a number which makes it possible to compute the secret decoding exponent in an RSA public key cryptosSystem,1,5 or the system master key and certain other keys in a DES cryptosystem,3 are so important that they present a dilemma.

...read moreread less

2.5K

A Security Condition for Multi-Source Linear Network Coding

Chat with Paper

AI Agents for this Paper

Most frequently asked questions

1. What have the authors contributed in "A general security condition for multi-source linear network coding" ?

Citations

Information Theoretic Security

Secure Network Coding on a Wiretap Network

Theory of Secure Network Coding

Relative Generalized Rank Weight of Linear Codes and Its Applications to Network Coding

On Secure Network Coding With Nonuniform or Restricted Wiretap Sets

References

How to share a secret

Communication theory of secrecy systems

Linear network coding

Safeguarding cryptographic keys

Safeguarding cryptographic keys

Related Papers (5)

Secure network coding

Linear network coding

Network information flow

An algebraic approach to network coding

Universal Secure Network Coding via Rank-Metric Codes