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

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Milanian, Mohammad, Jeong, Minoh, Cardone, Martina
Format: Preprint
Veröffentlicht: 2024
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866916240394551296
author Milanian, Mohammad
Jeong, Minoh
Cardone, Martina
author_facet Milanian, Mohammad
Jeong, Minoh
Cardone, Martina
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2405_05823
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle On the Secrecy Capacity of 1-2-1 Atomic Networks
Milanian, Mohammad
Jeong, Minoh
Cardone, Martina
Information Theory
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.
title On the Secrecy Capacity of 1-2-1 Atomic Networks
topic Information Theory
url https://arxiv.org/abs/2405.05823