Universal weakly secure network coding

This paper considers the problem of secure network coding under the weak (and practically appealing) security requirements of Bhattad and Narayanan. Weak security allows communication at maximum rate while ensuring that only meaningless information is leaked to a wiretapper. Differently from the app...

Full description

Saved in:
Bibliographic Details
Published in2009 IEEE Information Theory Workshop on Networking and Information Theory pp. 281 - 285
Main Authors Silva, D., Kschischang, F.R.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.06.2009
Subjects
Brazil Council
Communication system security
Computer security
Galois fields
Information security
Network coding
Vectors
Online AccessGet full text
ISBN1424445353
9781424445356
DOI10.1109/ITWNIT.2009.5158587

Cover

More Information
Summary:This paper considers the problem of secure network coding under the weak (and practically appealing) security requirements of Bhattad and Narayanan. Weak security allows communication at maximum rate while ensuring that only meaningless information is leaked to a wiretapper. Differently from the approach of Bhattad and Narayanan, which requires a joint design of the underlying network code and the outer security scheme, we propose a universal approach that is completely independent of the network code. In particular, the field size for linear network coding operations does not need to be enlarged. The scheme is also compatible with random network coding.
ISBN:1424445353
9781424445356
DOI:10.1109/ITWNIT.2009.5158587