We gratefully acknowledge support from
the Simons Foundation and member institutions.
Full-text links:

Download:

Current browse context:

cs.IT

Change to browse by:

References & Citations

Bookmark

(what is this?)
CiteULike logo BibSonomy logo Mendeley logo del.icio.us logo Digg logo Reddit logo

Computer Science > Information Theory

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

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.
Comments: Accepted to ISIT 2024
Subjects: Information Theory (cs.IT)
Cite as: arXiv:2405.05823 [cs.IT]
  (or arXiv:2405.05823v1 [cs.IT] for this version)

Submission history

From: Mohammad Milanian [view email]
[v1] Thu, 9 May 2024 14:59:19 GMT (21kb)

Link back to: arXiv, form interface, contact.