Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

article · 2003

Secure network coding

Ning Cai, Raymond W. Yeung

Cited by 452Abstract and details only

Abstract

Recent work on network coding renders a new view on multicasting in a network. In the paradigm of network coding, the nodes in a network are allowed to encode the information received from the input links. The usual function of switching at a node is a special case of network coding. The advantage of network coding is that the full capacity of the network can be utilized. In this paper, we propose a new model which incorporates network coding and information security. Specifically, a collection of subsets of links is given, and a wiretapper is allowed to access any one (but not more than one) of these subsets without being able to obtain any information about the message transmitted. Our model includes secret sharing as a special case. We present a construction of secure linear network codes provided a certain graph-theoretic sufficient condition is satisfied.

Cite this paper

APA 7

Cai, N., & Yeung, R. W. (2003). Secure network coding. https://doi.org/10.1109/isit.2002.1023595

MLA 9

Cai, Ning, and Raymond W. Yeung. “Secure network coding.” 2003, p. 323, https://doi.org/10.1109/isit.2002.1023595.

Chicago

Cai, Ning, and Raymond W. Yeung. 2003. “Secure network coding.” https://doi.org/10.1109/isit.2002.1023595.

Harvard

Cai, N. and Yeung, R.W. (2003) ‘Secure network coding’. Available at: https://doi.org/10.1109/isit.2002.1023595.

BibTeX
@article{cai2003secure,
  title = {{Secure network coding}},
  author = {Cai, Ning and Yeung, Raymond W.},
  pages = {323},
  year = {2003},
  doi = {10.1109/isit.2002.1023595}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.

Related papers