In EDS ansehen

Practical Schemes for Tunable Secure Network Coding.

Gespeichert in:

Bibliographische Detailangaben
Titel:	Practical Schemes for Tunable Secure Network Coding.
Autoren:	Guangjun Liu¹
Quelle:	KSII Transactions on Internet & Information Systems. Mar2015, Vol. 9 Issue 3, p1193-1209. 17p. 2 Diagrams, 1 Chart.
Schlagwörter:	Linear network coding, Eavesdropping, Cryptography, Data security, Vandermonde matrices
Abstract:	Network coding is promising to maximize network throughput and improve the resilience to random network failures in various networking systems. In this paper, the problem of providing efficient confidentiality for practical network coding system against a global eavesdropper (with full eavesdropping capabilities to the network) is considered. By exploiting a novel combination between the construction technique of systematic Maximum Distance Separable (MDS) erasure coding and traditional cryptographic approach, two efficient schemes are proposed that can achieve the maximum possible rate and minimum encryption overhead respectively on top of any communication network or underlying linear network code. Every generation is first subjected to an encoding by a particular matrix generated by two (or three) Vandermonde matrices, and then parts of coded vectors (or secret symbols) are encrypted before transmitting. The proposed schemes are characterized by tunable and measurable degrees of security and also shown to be of low overhead in computation and bandwidth. [ABSTRACT FROM AUTHOR]
Datenbank:	Supplemental Index

Beschreibung
Abstract:	Network coding is promising to maximize network throughput and improve the resilience to random network failures in various networking systems. In this paper, the problem of providing efficient confidentiality for practical network coding system against a global eavesdropper (with full eavesdropping capabilities to the network) is considered. By exploiting a novel combination between the construction technique of systematic Maximum Distance Separable (MDS) erasure coding and traditional cryptographic approach, two efficient schemes are proposed that can achieve the maximum possible rate and minimum encryption overhead respectively on top of any communication network or underlying linear network code. Every generation is first subjected to an encoding by a particular matrix generated by two (or three) Vandermonde matrices, and then parts of coded vectors (or secret symbols) are encrypted before transmitting. The proposed schemes are characterized by tunable and measurable degrees of security and also shown to be of low overhead in computation and bandwidth. [ABSTRACT FROM AUTHOR]
ISSN:	19767277
DOI:	10.3837/tiis.2015.03.020