PROJECT TITLE :

Secure Network Coding With Erasures and Feedback

ABSTRACT:

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 prime of the resulting error-free network. During this paper, we tend to 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 each Eve and therefore the legitimate network nodes. We tend to show that by leveraging erasures and feedback, we have a tendency to can achieve secrecy rates that are in some cases multiple times above the choice of separate channel-error-correction followed by secure network coding; moreover, we tend to develop outer bounds and prove optimality of our proposed schemes in some special cases.