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 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.


Published in:
Ieee Transactions On Information Theory, 61, 4, 1667-1686
Year:
2015
Publisher:
Piscataway, Ieee-Inst Electrical Electronics Engineers Inc
ISSN:
0018-9448
Keywords:
Laboratories:




 Record created 2015-05-29, last modified 2018-01-28


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)