Secure Network Coding With Erasures and Feedback

Secure network coding assumes that the underlying network channels are error-free; thus, if our channels introduce errors, we need to first apply a channel code to correct them, and then build security on top of the resulting error-free network. In this paper, we develop achievability protocols and...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on information theory Jg. 61; H. 4; S. 1667 - 1686
Hauptverfasser: Czap, Laszlo, Fragouli, Christina, Prabhakaran, Vinod M., Diggavi, Suhas
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York IEEE 01.04.2015
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
Coding theory
Cryptography
Encoding
Error correction & detection
Feedback
Network coding
Receivers
State feedback
Vectors
network coding
Encoding
erasure networks
security coding
decoding
message secrecy
ISSN:0018-9448, 1557-9654
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Secure network coding assumes that the underlying network channels are error-free; thus, if our channels introduce errors, we need to first apply a channel code to correct them, and then build security on top of the resulting error-free network. In this paper, we develop achievability protocols and outer bounds for the secure network coding setting, where the edges are subject to packet erasures, and public feedback of the channel state is available to both Eve and the legitimate network nodes. We show that by leveraging erasures and feedback, we can achieve secrecy rates that are in some cases multiple times higher than the alternative of separate channel-error-correction followed by secure network coding; moreover, we develop outer bounds and prove optimality of our proposed schemes in some special cases.
Bibliographie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0018-9448
1557-9654
DOI:10.1109/TIT.2015.2402272