On the Secrecy Capacity of 1-2-1 Atomic Networks
Preprint
Abstract
We consider the problem of secure communication over a noiseless 1-2-1 network, an abstract model introduced to capture the directivity characteristic of mmWave communications. We focus on structured networks, which we refer to as 1-2-1 atomic networks. Broadly speaking, these are characterized by a source, a destination, and three layers of intermediate nodes with sparse connections. The goal is for the source to securely communicate to the destination in the presence of an eavesdropper with unbounded computation capabilities, but limited network presence. We derive novel upper and lower bounds on the secrecy capacity of 1-2-1 atomic networks. These bounds are shown to be tighter than existing bounds in some regimes. Moreover, in such regimes, the bounds match and hence, they characterize the secrecy capacity of 1-2-1 atomic networks.Keywords
All Related Versions
This publication has 11 references indexed in Scilit:
- Gaussian 1-2-1 Networks: Capacity Results for mmWave CommunicationsIEEE Transactions on Information Theory, 2020
- A Comprehensive Survey on Millimeter Wave Communications for Fifth-Generation Wireless Networks: Feasibility and ChallengesIEEE Access, 2020
- Millimeter Wave Communication: A Comprehensive SurveyIEEE Communications Surveys & Tutorials, 2018
- Creating Secrets Out of Packet ErasuresIEEE Transactions on Information Forensics and Security, 2016
- On Secure Network Coding With Nonuniform or Restricted Wiretap SetsIEEE Transactions on Information Theory, 2012
- Graph-Theoretical Constructions for Graph Entropy and Network Coding Based CommunicationsIEEE Transactions on Information Theory, 2011
- Network Generalized Hamming WeightIEEE Transactions on Information Theory, 2011
- Byzantine Modification Detection in Multicast Networks With Random Network CodingIEEE Transactions on Information Theory, 2008
- Polynomial Time Algorithms for Multicast Network Code ConstructionIEEE Transactions on Information Theory, 2005
- Generalized Hamming weights for linear codesIEEE Transactions on Information Theory, 1991