activity
20062018
most citedCoordination Capacity

249 citations · 1k across the 44 of their papers we have counts for

collaborators
Showing cs.ITShow all

45 papers · 1 filter

cs.IT2018

Exact Exponent for Soft Covering

Semih Yagli, Paul Cuff

This work establishes the exact exponents for the soft-covering phenomenon of a memoryless channel under the total variation metric when random (i.i.d. and constant-composition) ch…

cs.IT2017

Key and Message Semantic-Security over State-Dependent Channels

Alexander Bunin, Ziv Goldfeld, Haim H. Permuter +3

We study the trade-off between secret message (SM) and secret key (SK) rates, simultaneously achievable over a state-dependent (SD) wiretap channel (WTC) with non-causal channel st…

cs.IT2017★ 15 cited

Information-Theoretic Perspectives on Brascamp-Lieb Inequality and Its Reverse

Jingbo Liu, Thomas A. Courtade, Paul Cuff +1

We introduce an inequality which may be viewed as a generalization of both the Brascamp-Lieb inequality and its reverse (Barthe's inequality), and prove its information-theoretic (…

cs.IT2016★ 192 cited

Differential Privacy as a Mutual Information Constraint

Paul Cuff, Lanqing Yu

Differential privacy is a precise mathematical constraint meant to ensure privacy of individual pieces of information in a database even while queries are being answered about the…

cs.IT2016

Wiretap Channels with Random States Non-Causally Available at the Encoder

Ziv Goldfeld, Paul Cuff, Haim H. Permuter

We study the state-dependent (SD) wiretap channel (WTC) with non-causal channel state information (CSI) at the encoder. This model subsumes all other instances of CSI availability…

cs.IT2016

Soft Covering with High Probability

Paul Cuff

Wyner's soft-covering lemma is the central analysis step for achievability proofs of information theoretic security, resolvability, and channel synthesis. It can also be used for s…