Covert capacity of bosonic channels

Christos N. Gagatsos; Michael S. Bullock; Boulat A. Bash

doi:10.1109/JSAIT.2020.3017199

Covert capacity of bosonic channels

Christos N. Gagatsos, Michael S. Bullock, Boulat A. Bash

Research output: Contribution to journal › Article › peer-review

22 Scopus citations

Abstract

We investigate the quantum-secure covertcommunication capabilities of lossy thermal-noise bosonic channels, the quantum-mechanical model for many practical channels. We determine the expressions for the covert capacity of these channels: Lno-EA, when Alice and Bob share only a classical secret, and LEA, when they benefit from entanglement assistance. We find that entanglement assistance alters the fundamental scaling law for covert communication. Instead of Lno-EA √ n - rno-EA(n), rno-EA(n) = o( √ n), entanglement assistance allows LEA √ n log n - rEA(n), rEA(n) = o( √ n log n), covert bits to be transmitted reliably over n channel uses.

Original language	English (US)
Article number	3017199
Pages (from-to)	555-567
Number of pages	13
Journal	IEEE Journal on Selected Areas in Information Theory
Volume	1
Issue number	2
DOIs	https://doi.org/10.1109/JSAIT.2020.3017199
State	Published - Aug 2020

Keywords

Channel capacity
Communication system security
Covert communication
Low probability of detection
Low probability of intercept
Quantum cryptography

ASJC Scopus subject areas

Computer Networks and Communications
Media Technology
Artificial Intelligence
Applied Mathematics

Access to Document

10.1109/JSAIT.2020.3017199

Cite this

@article{e7c52f451c394aa18f721c6c63797c4c,

title = "Covert capacity of bosonic channels",

abstract = "We investigate the quantum-secure covertcommunication capabilities of lossy thermal-noise bosonic channels, the quantum-mechanical model for many practical channels. We determine the expressions for the covert capacity of these channels: Lno-EA, when Alice and Bob share only a classical secret, and LEA, when they benefit from entanglement assistance. We find that entanglement assistance alters the fundamental scaling law for covert communication. Instead of Lno-EA √ n - rno-EA(n), rno-EA(n) = o( √ n), entanglement assistance allows LEA √ n log n - rEA(n), rEA(n) = o( √ n log n), covert bits to be transmitted reliably over n channel uses.",

keywords = "Channel capacity, Communication system security, Covert communication, Low probability of detection, Low probability of intercept, Quantum cryptography",

author = "Gagatsos, {Christos N.} and Bullock, {Michael S.} and Bash, {Boulat A.}",

year = "2020",

month = aug,

doi = "10.1109/JSAIT.2020.3017199",

language = "English (US)",

volume = "1",

pages = "555--567",

journal = "IEEE Journal on Selected Areas in Information Theory",

issn = "2641-8770",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "2",

}

TY - JOUR

T1 - Covert capacity of bosonic channels

AU - Gagatsos, Christos N.

AU - Bullock, Michael S.

AU - Bash, Boulat A.

PY - 2020/8

Y1 - 2020/8

N2 - We investigate the quantum-secure covertcommunication capabilities of lossy thermal-noise bosonic channels, the quantum-mechanical model for many practical channels. We determine the expressions for the covert capacity of these channels: Lno-EA, when Alice and Bob share only a classical secret, and LEA, when they benefit from entanglement assistance. We find that entanglement assistance alters the fundamental scaling law for covert communication. Instead of Lno-EA √ n - rno-EA(n), rno-EA(n) = o( √ n), entanglement assistance allows LEA √ n log n - rEA(n), rEA(n) = o( √ n log n), covert bits to be transmitted reliably over n channel uses.

AB - We investigate the quantum-secure covertcommunication capabilities of lossy thermal-noise bosonic channels, the quantum-mechanical model for many practical channels. We determine the expressions for the covert capacity of these channels: Lno-EA, when Alice and Bob share only a classical secret, and LEA, when they benefit from entanglement assistance. We find that entanglement assistance alters the fundamental scaling law for covert communication. Instead of Lno-EA √ n - rno-EA(n), rno-EA(n) = o( √ n), entanglement assistance allows LEA √ n log n - rEA(n), rEA(n) = o( √ n log n), covert bits to be transmitted reliably over n channel uses.

KW - Channel capacity

KW - Communication system security

KW - Covert communication

KW - Low probability of detection

KW - Low probability of intercept

KW - Quantum cryptography

UR - http://www.scopus.com/inward/record.url?scp=85101439992&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85101439992&partnerID=8YFLogxK

U2 - 10.1109/JSAIT.2020.3017199

DO - 10.1109/JSAIT.2020.3017199

M3 - Article

AN - SCOPUS:85101439992

SN - 2641-8770

VL - 1

SP - 555

EP - 567

JO - IEEE Journal on Selected Areas in Information Theory

JF - IEEE Journal on Selected Areas in Information Theory

IS - 2

M1 - 3017199

ER -

Covert capacity of bosonic channels

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this