249 citations · 1k across the 44 of their papers we have counts for
9 papers · 2 filters
-Resolvability
Jingbo Liu, Paul Cuff, Sergio Verdú
The conventional channel resolvability refers to the minimum rate needed for an input process to approximate the channel output distribution in total variation distance. In this pa…
Semantic-Security Capacity for Wiretap Channels of Type II
Ziv Goldfeld, Paul Cuff, Haim H. Permuter
The secrecy capacity of the type II wiretap channel (WTC II) with a noisy main channel is currently an open problem. Herein its secrecy-capacity is derived and shown to be equal to…
A Stronger Soft-Covering Lemma and Applications
Paul Cuff
Wyner's soft-covering lemma is a valuable tool for achievability proofs of information theoretic security, resolvability, channel synthesis, and source coding. The result herein sh…
Gaussian Secure Source Coding and Wyner's Common Information
Sanket Satpathy, Paul Cuff
We study secure source-coding with causal disclosure, under the Gaussian distribution. The optimality of Gaussian auxiliary random variables is shown in various scenarios. We expli…
Secure Cascade Channel Synthesis
Sanket Satpathy, Paul Cuff
We consider the problem of generating correlated random variables in a distributed fashion, where communication is constrained to a cascade network. The first node in the cascade o…
Resolvability in Eγ with Applications to Lossy Compression and Wiretap Channels
Jingbo Liu, Paul Cuff, Sergio Verdú
We study the amount of randomness needed for an input process to approximate a given output distribution of a channel in the distance. A general one-shot achievability bound…