pith. sign in

arxiv: 2405.05823 · v1 · pith:HJYS5WCX · submitted 2024-05-09 · cs.IT · math.IT

On the Secrecy Capacity of 1-2-1 Atomic Networks

pith:HJYS5WCXopen to challenge →

classification cs.IT math.IT
keywords networksatomicboundscapacitysecrecydestinationnetworkpresence
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.