Silva, D. and Kschsiischang, F.R. (2008) Security for Wiretap Networks via Rank-Metric Codes. 2008 IEEE International Symposium on Information Theory, Toronto, 6-11 July 2008, 176-180.
https://doi.org/10.1109/ISIT.2008.4594971

has been cited by the following article:

• TITLE: Security Analysis of Subspace Network Coding

  AUTHORS: Yantao Liu, Yasser Morgan

  KEYWORDS: Network Security, Wiretap Attacks, Subspace Code, Network Coding

  JOURNAL NAME: Journal of Information Security, Vol.9 No.1, January 23, 2018

  ABSTRACT: This paper analyzed the security of constant dimensional subspace code against wiretap attacks. The security was measured in the probability with which an eavesdropper guessed the source message successfully. With the methods of linear algebra and combinatorics, an analytic solution of the probability was obtained. Performance of subspace code was compared to several secure network coding schemes from the perspective of security, flexibility, complexity, and independence, etc. The comparison showed subspace code did not have perfect security, but it achieved probabilistic security with low complexity. As a result, subspace code was suitable to the applications with limited computation and moderate security requirement.