Multilevel Secrecy over 1-2-1 Networks

This paper studies the problem of secure communication over noiseless 1-2-1 networks, an abstract model for networks with directional communication capabilities such as mmWave networks. A secure transmission scheme is designed and shown to achieve a secure rate that is larger than state-of-the-art lower bounds for a class of 1-2-1 network topologies. The proposed scheme leverages the scheduling nature of 1-2-1 networks, the network topology, as well as storage at intermediate nodes to create shared randomness with the source to improve the secure rate. Finally, a novel outer bound is derived and shown to match the achievability bound under certain network conditions, hence characterizing the secure capacity in such regimes.

[1]  László Czap,et al.  Creating Secrets Out of Packet Erasures , 2016, IEEE Transactions on Information Forensics and Security.

[2]  Christina Fragouli,et al.  Secure Communication over 1-2-1 Networks , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).

[3]  A. Lee Swindlehurst,et al.  Robust Beamforming for Security in MIMO Wiretap Channels With Imperfect CSI , 2010, IEEE Transactions on Signal Processing.

[4]  Tracey Ho,et al.  Resilient network coding in the presence of Byzantine adversaries , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[5]  Tracey Ho,et al.  On Secure Network Coding With Nonuniform or Restricted Wiretap Sets , 2009, IEEE Transactions on Information Theory.

[6]  Christina Fragouli,et al.  Gaussian 1-2-1 Networks: Capacity Results for mmWave Communications , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).

[7]  Peter Sanders,et al.  Polynomial time algorithms for multicast network code construction , 2005, IEEE Transactions on Information Theory.

[8]  R. Yeung,et al.  Secure network coding , 2002, Proceedings IEEE International Symposium on Information Theory,.