activity
20132024
most citedFirst and Second Order Asymptotics in Covert Communication

101 citations · 159 across the 12 of their papers we have counts for

collaborators
Showing cs.ITShow all

11 papers · 1 filter

cs.IT2020

On Covert Quantum Sensing and the Benefits of Entanglement

Mehrdad Tahmasbi, Matthieu Bloch

Motivated by applications to covert quantum radar, we analyze a covert quantum sensing problem, in which a legitimate user aims at estimating an unknown parameter taking finitely m…

cs.IT2019

Steganography Protocols for Quantum Channels

Mehrdad Tahmasbi, Matthieu Bloch

We study several versions of a quantum steganography problem, in which two legitimate parties attempt to conceal a cypher in a quantum cover transmitted over a quantum channel with…

cs.IT2019

Toward Undetectable Quantum Key Distribution over Bosonic Channels

Mehrdad Tahmasbi, Matthieu R. Bloch

We show that covert secret key expansion is possible using a public authenticated classical channel and a quantum channel largely under control of an adversary, which we precisely…

cs.IT2019★ 23 cited

Covert Secret Key Generation with an Active Warden

Mehrdad Tahmasbi, Matthieu Bloch

We investigate the problem of covert and secret key generation over a state-dependent discrete memoryless channel with one-way public discussion in which an adversary, the warden,…

cs.IT2018★ 25 cited

A framework for covert and secret key expansion over quantum channels

Mehrdad Tahmasbi, Matthieu R. Bloch

Covert and secret quantum key distribution aims at generating information-theoretically secret bits between distant legitimate parties in a manner that remains provably undetectabl…

cs.IT2018★ 1 cited

Multilevel-Coded Pulse-Position Modulation for Covert Communications over Binary-Input Discrete Memoryless Channels

Ishaque Ashar Kadampot, Mehrdad Tahmasbi, Matthieu R Bloch

We develop a low-complexity coding scheme to achieve covert communications over binary-input discrete memoryless channels (BI-DMCs). We circumvent the impossibility of covert commu…

cs.IT2018

Covert Capacity of Non-Coherent Rayleigh-Fading Channels

Mehrdad Tahmasbi, Anne Savard, Matthieu R. Bloch

The covert capacity is characterized for a non-coherent fast Rayleigh-fading wireless channel, in which a legitimate user wishes to communicate reliably with a legitimate receiver…

cs.IT2018★ 6 cited

Learning an Adversary's Actions for Secret Communication

Mehrdad Tahmasbi, Matthieu R. Bloch, Aylin Yener

Secure communication over a wiretap channel is investigated, in which an active adversary modifies the state of the channel and the legitimate transmitter has the opportunity to se…

cs.IT2017★ 101 cited

First and Second Order Asymptotics in Covert Communication

Mehrdad Tahmasbi, Matthieu R. Bloch

We study the first- and second-order asymptotics of covert communication over binary-input DMC for three different covertness metrics and under maximum probability of error constra…

cs.IT2015

On the Capacity Achieving Probability Measures for Molecular Receivers

Mehrdad Tahmasbi, Faramarz Fekri

In this paper, diffusion-based molecular commu- nication with ligand receptor receivers is studied. Information messages are assumed to be encoded via variations of the con- centra…

cs.IT2013

Critical Graphs in Index Coding

Mehrdad Tahmasbi, Amirbehshad Shahrasbi, Amin Gohari

In this paper we define critical graphs as minimal graphs that support a given set of rates for the index coding problem, and study them for both the one-shot and asymptotic setups…