New Secure Network Coding Scheme with Low Complexity 


Vol. 38,  No. 4, pp. 295-302, Apr.  2013


PDF
  Abstract

In the network coding, throughput can be increased by allowing the transformation of the received data at the intermediate nodes. However, the adversary can obtain more information at the intermediate nodes and make troubles for decoding of transmitted data at the sink nodes by modifying transmitted data at the compromised nodes. In order to resist the adversary activities, various information theoretic or cryptographic secure network coding schemes are proposed. Recently, a secure network coding based on the cryptographic hash function can be used at the random network coding. However, because of the computational resource requirement for cryptographic hash functions, networks with limited computational resources such as sensor nodes have difficulties to use the cryptographic solution. In this paper, we propose a new secure network coding scheme which uses linear transformations and table lookup and safely transmits n-1 packets at the random network coding under the assumption that the adversary can eavesdrop at most n-1 nodes. It is shown that the proposed scheme is an all-or-nothing transform (AONT) and weakly secure network coding in the information theory.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

Y. Kim, "New Secure Network Coding Scheme with Low Complexity," The Journal of Korean Institute of Communications and Information Sciences, vol. 38, no. 4, pp. 295-302, 2013. DOI: .

[ACM Style]

Young-Sik Kim. 2013. New Secure Network Coding Scheme with Low Complexity. The Journal of Korean Institute of Communications and Information Sciences, 38, 4, (2013), 295-302. DOI: .

[KICS Style]

Young-Sik Kim, "New Secure Network Coding Scheme with Low Complexity," The Journal of Korean Institute of Communications and Information Sciences, vol. 38, no. 4, pp. 295-302, 4. 2013.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880