umu.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Secure random linear network coding on a wiretap network
Nantong Univ, Sch Elect & Informat, Nantong 226019, Jiangsu, Peoples R China. .
Nantong Univ, Sch Elect & Informat, Nantong 226019, Jiangsu, Peoples R China. .
Nantong Univ, Sch Elect & Informat, Nantong 226019, Jiangsu, Peoples R China. .
Umeå University, Faculty of Science and Technology, Department of Mathematics and Mathematical Statistics.
2015 (English)In: AEU - International Journal of Electronics and Communications, ISSN 1434-8411, E-ISSN 1618-0399, Vol. 69, no 1, 467-472 p.Article in journal (Refereed) Published
Abstract [en]

We develop a secure random linear network coding scheme on wiretap networks where a wiretapper can only eavesdrop on a limited number of channels. On one hand, by refining Lima's "locked coefficients" method and applying the approach of one-time pad, our scheme can well protect message packets without decreasing network throughput. On the other hand, by treating ciphertext as noisy symbols, inspired by the physical layer technique, and applying Shamir's secret sharing scheme, our scheme can successfully protect secret random seed without any forms of key exchange or secret channels. Compared to existing schemes, our scheme has minimum information overhead, independency of hash functions, and no restriction on global encoding kernel. Finally, we analyze the computational complexity of our proposed scheme and rigorously prove that our scheme can achieve secure network communication. (C) 2014 Elsevier GmbH. All rights reserved.

Place, publisher, year, edition, pages
2015. Vol. 69, no 1, 467-472 p.
Keyword [en]
Wiretap networks, Information theoretic security, Random linear network coding, Secret sharing, e-time pad
National Category
Mathematics
Identifiers
URN: urn:nbn:se:umu:diva-99776DOI: 10.1016/j.aeue.2014.10.018ISI: 000347495600062OAI: oai:DiVA.org:umu-99776DiVA: diva2:788726
Available from: 2015-02-16 Created: 2015-02-12 Last updated: 2017-12-04Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Zhang, Lai
By organisation
Department of Mathematics and Mathematical Statistics
In the same journal
AEU - International Journal of Electronics and Communications
Mathematics

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 129 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf