Paul W. Cuff – Research Output
Journal Publications
 Smoothing BrascampLieb Inequalities and Strong Converses of Coding Theorems
J. Liu, T. Courtade, P. Cuff, S. Verdú — submitted to IEEE Trans. on Information Theory, April, 2017.
 InformationTheoretic Perspectives on BrascampLieb Inequality and Its Reverse
J. Liu, T. Courtade, P. Cuff, S. Verdú — submitted to IEEE Trans. on Information Theory, February, 2017.
 Wiretap Channels with Random States NonCausally Available at the Encoder
Z. Goldfeld, P. Cuff, H. Permuter — submitted to IEEE Trans. on Information Theory, August, 2016.
 Common Randomness and Key Generation with Limited Interaction
J. Liu, P. Cuff, S. Verdú — submitted to IEEE Trans. on Information Theory, June, 2016.
 Egamma Resolvability
J. Liu, P. Cuff, S. Verdú — IEEE Trans. on Information Theory, 63(5):262958, May, 2017.
 An EEG Acquisition and BiomarkerExtraction System Using LowNoiseAmplifier and CompressiveSensing Circuits Based on Flexible, ThinFilm Electronics
T. Moy, L. Huang, W. RieutortLouis, C. Wu, P. Cuff, S. Wagner, J. Sturm, N. Verma — IEEE Journal of Solid State Circuits, 52(1):30921, January, 2017.
 Strong Secrecy for Cooperative Broadcast Channels
Z. Goldfeld, G. Kramer, H. Permuter, P. Cuff — IEEE Trans. on Information Theory, 63(1):46995, January, 2017.
 Arbitrarily Varying Wiretap Channels with Type Constrained States
Z. Goldfeld, P. Cuff, H. Permuter — IEEE Trans. on Information Theory, 62(12):721644, December, 2016.
 Secure Cascade Channel Synthesis
S. Satpathy, P. Cuff — IEEE Trans. on Information Theory, 62(11):608194, November, 2016.
 SemanticSecurity Capacity for Wiretap Channels of Type II
Z. Goldfeld, P. Cuff, H. Permuter — IEEE Trans. on Information Theory, 62(7):386379, July, 2016.
 The Henchman Problem: Measuring Secrecy by the Minimum Distortion in a List
C. Schieler, P. Cuff — IEEE Trans. on Information Theory, 62(6):343650, June, 2016.
 The Likelihood Encoder for Lossy Compression
E. Song, P. Cuff, V. Poor — IEEE Trans. on Information Theory, 62(4):183649, April, 2016.
 Key Capacity for Product Sources with Application to Stationary Gaussian Processes
J. Liu, P. Cuff, S. Verdú — IEEE Trans. on Information Theory, 62(2):9841005, February, 2016.
 An Upper Bound on the Convergence Time for Quantized Consensus of Arbitrary Static Graphs (longer version)
S. Shang, P. Cuff, P. Hui, S. Kulkarni — IEEE Trans. on Automatic Control, 60(4):112732, April, 2015.
 RateDistortion Theory for Secrecy Systems
C. Schieler, P. Cuff — IEEE Trans. on Information Theory, 60(12):7584605, December, 2014.
 RateDistortionBased Physical Layer Secrecy in Multimode Fiber
E. Song, E. Soljanin, P. Cuff, V. Poor, K. Guan — IEEE Trans. on Communications, 62(3):108090, March, 2014.
 Distributed Channel Synthesis
P. Cuff — IEEE Trans. on Information Theory, 59(11):707196, November, 2013.
 Glauber Dynamics for the meanfield Potts Model
P. Cuff, J. Ding, O. Louidor, E. Lubetzky, Y. Peres, A. Sly — Journal of Statistical Physics, 149(3):432477, November, 2012.
 On the Role of the Refinement Layer in Multiple Description Coding and Scalable Coding (arXiv)
J. Wang, J. Chen, L. Zhao, P. Cuff, H. Permuter — IEEE Trans. on Information Theory, 57(3):144356, March, 2011.
 Coordination Capacity
P. Cuff, H. Permuter, T. Cover — IEEE Trans. on Information Theory, 56(9):4181206, September, 2010.
 Capacity of the Trapdoor Channel with Feedback
H. Permuter, P. Cuff, B. Van Roy, T. Weissman — IEEE Trans. on Information Theory, 54(7):315065, July, 2008.
Dissertation
 Communication in Networks for Coordinating Behavior
P. Cuff — Ph.D. Dissertation, Stanford University, August, 2009.
Conference Proceedings
 The Shannon Cipher System with a Guessing Eavesdropper
L. Yu, P. Cuff — ISIT, June, 2017.
 The GelfandPinsker wiretap channel: Higher secrecy rates via a novel superposition code
Z. Goldfeld, P. Cuff, H. Permuter — ISIT, June, 2017.
 SemanticallySecured MessageKey Tradeoff over Wiretap Channels with Random Parameters
A. Bunin, Z. Goldfeld, H. Permuter, S. Shamai, P. Cuff, P. Piantanida — Eurocrypt, Workshop on Comm. Security (WCS), April, 2017.
 Arbitrarily Varying Wiretap Channels with Type Constrained States
Z. Goldfeld, P. Cuff, H. Permuter — Globecom, December, 2016.
 Wiretap Channels with Random States NonCausally Available at the Encoder
Z. Goldfeld, P. Cuff, H. Permuter — ICSEE, November, 2016.
 Differential Privacy as a Mutual Information Constraint
P. Cuff, L. Yu — CCS, October, 2016.
 SemanticSecurity Capacity for Wiretap Channels of Type II
Z. Goldfeld, P. Cuff, H. Permuter — ISIT, July, 2016.
 Soft Covering with High Probability
P. Cuff — ISIT, July, 2016.
 Key Generation with Limited Interaction
J. Liu, P. Cuff, S. Verdú — ISIT, July, 2016.
 BrascampLieb Inequality and Its Reverse: An Information Theoretic View
J. Liu, T. Courtade, P. Cuff, S. Verdú — ISIT, July, 2016.
 Smoothing BrascampLieb Inequalities and Strong Converses for Common Randomness Generation
J. Liu, T. Courtade, P. Cuff, S. Verdú — ISIT, July, 2016.
 SemanticSecurity Capacity for the Physical Layer via Information Theory
Z. Goldfeld, P. Cuff, H. Permuter — SwSTE, June, 2016.
 Strong Secrecy for Cooperative Broadcast Channels
Z. Goldfeld, G. Kramer, H. Permuter, P. Cuff — Int'l. Zurich Seminar on Communications, March, 2016.
 A Stronger SoftCovering Lemma and Applications
P. Cuff — CNS Workshop on Physicallayer Methods for Wireless Security, September, 2015.
 Gaussian Secure Source Coding and Wyner's Common Information
S. Satpathy, P. Cuff — ISIT, June, 2015.
 OneShot Mutual Covering Lemma and Marton's Inner Bound with a Common Message
J. Liu, P. Cuff, S. Verdú — ISIT, June, 2015 (semiplenary).
 Secret Key Generation with One Communicator and a OneShot Converse via Hypercontractivity
J. Liu, P. Cuff, S. Verdú — ISIT, June, 2015.
 Resolvability in Egamma with Applications to Lossy Compression and Wiretap Channels
J. Liu, P. Cuff, S. Verdú — ISIT, June, 2015.
 Joint SourceChannel Secrecy Using Hybrid Coding
E. Song, P. Cuff, V. Poor — ISIT, June, 2015.
 A RateDistortion Based Secrecy System with Side Information at the Decoders
E. Song, P. Cuff, V. Poor — Allerton, October, 2014.
 Secure Coordination with a TwoSided Helper
S. Satpathy, P. Cuff — ISIT, July, 2014.
 The Likelihood Encoder for Lossy Source Compression
E. Song, P. Cuff, V. Poor — ISIT, July, 2014.
 The Henchman Problem: Measuring Secrecy by the Minimum Distortion in a List
C. Schieler, P. Cuff — ISIT, July, 2014.
 Key Capacity with Limited OneWay Communication for Product Sources
J. Liu, P. Cuff, S. Verdú — ISIT, July, 2014.
 The Application of Differential Privacy for Rank Aggregation: Privacy and Accuracy
S. Shang, T. Wang, P. Cuff, S. Kulkarni — Fusion, July, 2014.
 Beyond Personalization and Anonymity: Toward a GroupBased Recommender System
S. Shang, Y. Hui, P. Hui, P. Cuff, S. Kulkarni — Symp. on Applied Computing (SAC), March, 2014.
 A Connection between Good Ratedistortion Codes and Backward DMCs
C. Schieler, P. Cuff — ITW, September, 2013.
 The Likelihood Encoder for Source Coding
P. Cuff, E. Song — ITW, September, 2013.
 Secrecy in Cascade Networks
P. Cuff — ITW, September, 2013.
 Secure Cascade Channel Synthesis
S. Satpathy, P. Cuff — ISIT, July, 2013.
 A Bit of Secrecy for Gaussian Source Compression
E. Song, P. Cuff, V. Poor — ISIT, July, 2013.
 RateDistortion Theory for Secrecy Systems
C. Schieler, P. Cuff — ISIT, July, 2013.
 An Upper Bound on the Convergence Time for Quantized Consensus (full version)
S. Shang, P. Cuff, P. Hui, S. Kulkarni — Infocom, April, 2013.
 Optimal Equivocation in Secrecy Systems  A Special Case of Distortionbased Characterization
P. Cuff — ITA, February, 2013 (Invited).
 SourceChannel Secrecy with Causal Disclosure
C. Schieler, E. Song, P. Cuff, V. Poor — Allerton, October, 2012.
 Condorcet Voting Methods Avoid the Paradoxes of Voting Theory
T. Wang, J. Sturm, P. Cuff, S. Kulkarni — Allerton, October, 2012 (Invited).
 A Random Walk Based Model Incorporating Social Information for Recommendations
S. Shang, S. Kulkarni , P. Cuff, P. Hui — MLSP, September, 2012.
 Iterative collaborative filtering for recommender systems with sparse data
Z. Zhang, P. Cuff, S. Kulkarni — MLSP, September, 2012.
 Secrecy is Cheap if the Adversary Must Reconstruct
C. Schieler, P. Cuff — ISIT, July, 2012.
 An Upper Bound on the Convergence Time for Distributed Binary Consensus
S. Shang, P. Cuff, S. Kulkarni, P. Hui — Fusion, July, 2012.
 Cooperative Caching based on File Popularity Ranking in Delay Tolerant Networks
T. Wang, P. Hui, S. Kulkarni, P. Cuff — ExtremeCom, March, 2012.
 The Source Coding Side of Secrecy
P. Cuff — Zurich Seminar on Comm. (IZS), February, 2012 (Invited).
 A Class of Logoptimal Utility Functions
P. Cuff — ITA, February, 2012 (Invited).
 Wisdom of the Crowd: Incorporating Social Influence in Recommendation Models
S. Shang, P. Hui, S. Kulkarni, P. Cuff — ICPADS, HotPOST Workshop, December, 2011 (Best Paper Award).
 Coordination using Implicit Communication
P. Cuff and L. Zhao — ITW, October, 2011.
 Hybrid Codes Needed for Coordination over the PointtoPoint Channel
P. Cuff and C. Schieler — Allerton, September, 2011 (Invited).
 A Lattice of Gambles
P. Cuff, T. Cover, G. Kumar, and L. Zhao — ISIT, August, 2011.
 Mutual Information Scheduling for Ranking
H. Aftab, N. Raj, P. Cuff, and S. Kulkarni — Fusion, July, 2011.
 A Framework for Partial Secrecy
P. Cuff — Globecom, December, 2010.
 Using a Secret Key to Foil an Eavesdropper
P. Cuff — Allerton, September, 2010 (Invited).
 State Information in Bayesian Games
P. Cuff — Presented at Allerton, October, 2009 (Invited).
 Cascade Multiterminal Source Coding
P. Cuff, H.I. Su, and A. El Gamal — ISIT, July, 2009.
 Consolidating Achievable Regions of Multiple Descriptions
L. Zhao, P. Cuff, H. Permuter — ISIT, July, 2009.
 Communication Requirements for Generating Correlated Random Variables
P. Cuff — ISIT, July, 2008 (Best Student Paper Award).
 Capacity and ZeroError Capacity of the Chemical Channel with Feedback
H. Permuter, P. Cuff, B. Van Roy, and T. Weissman — ISIT, July, 2007.
Talks (slides)
ITA 2017 — Differential Privacy as a Mutual Information Constraint
U. of Maryland, U. of Michigan 2016 — Part 1: Wiretap Channels with Random States; Part 2: Differential Privacy as a Mutual Information Constraint
Stanford Information Theory Forum 2016 — Part 1: Wiretap Channels with Random States; Part 2: Differential Privacy as a Mutual Information Constraint
Penn State 2016 — Secure Communication through Wiretap Channels
CISS 2016 — Panel  The Next 50 Years
Zurich Seminar on Communications 2016 — Semantic Security using a Stronger SoftCovering Lemma
ITA 2016 — Estimation of Smoothed Entropy
Science of Information, Caltech, Stanford, USC, UC Irvine, UC Berkeley 2015 — Semantic Security using a Stronger SoftCovering Lemma
CNS Workshop on Physicallayer Methods for Wireless Security 2015 (Keynote Talk) — Semantic Security using a Stronger SoftCovering Lemma
ISIT 2015 — Gaussian Secure Source Coding and Wyner's Common Information
CTW 2015 — Embedded Coordination for Signals
ITW 2015 — ZeroDelay DistortionInducing Secure Source Coding
ITW 2015 — The Third Way
ITA 2015 — Secret Key Agreement with RateLimited Communication Among Three Nodes
Allerton 2014 — Secure RateLimited Feedback for Control
Edgestream Partners 2014 — Source Coding (secrecy and embedding)
SPCOM Tutorial 2014 — RateDistortion Theory for Secrecy Systems
Cornell, BYU 2013 — Ratedistortion Theory for Secrecy Systems
Yale 2013 — Ratedistortion Theory for Communication in Games
ITW 2013 — The Likelihood Encoder for Source Coding
ITW 2013 — Secrecy in Cascade Networks
UIUC, NIKSUN WWSMC, PDT 2013 — RateDistortion Theory for Secrecy Systems
ITA 2013 — Equivocation  A Special Case of Distortionbased Characterization
NIPS Workshop on Social Choice Theory 2012 — Requirements for Fair and Robust Voting Systems
Stanford ISL Colloquium, UC Berkeley Seminar, Bell Labs Mathematics Colloquium 2012 — Secure Communication of Signals
CISS 2012 — Toward a Secure Datarate Theorem
Zurich Seminar on Communications 2012 — The Source Coding Side of Secrecy
ITA 2012 — A Class of Logoptimal Utility Functions
Allerton 2011 — Hybrid Codes Needed for Coordination over the PointtoPoint Channel
Fusion 2011 — Mutual Information Scheduling for Ranking
Princeton Stats Symposium 2011 — Information Theory  Aggregating Information
ITA 2011 — Causal Secrecy: An Informed Eavesdropper
Globecom 2010 — A Framework for Partial Secrecy
MIT  HP Seminar, UIUC 201011 — Secure Communication for Distributed Systems
BYU 2010 — Information Theory for Secrecy and Control
Princeton Staff Lunch Lecture 2010 — A Bit About Bits
Princeton, ISS 2009 — Efficient Communication for Control in Games and Networks
Allerton 2009 — State Information in Bayesian Games
Stanford University PhD Oral Exam — Communication in Networks for Coordinating Behavior (video)
ISIT 2009 — Cascade Multiterminal Source Coding
ITA (UCSD) 2009 — Investigating the Fundamental Communication Burden of Cooperation
MIT  LIDS 2008 — The Golden Ratio in Communication  Blackwell's Trapdoor Channel and Task Assignment
Allerton 2008 — Coordination via Communication
ISIT 2008 — Communication Requirement for Generating Correlated Random Variables
School of Information Theory 2008 — Coordination via Communication
BIRS 2007 — Entropy Rates of Hidden Markov Processes emerge from Blackwell's Trapdoor Channel
ISIT 2007 — Capacity and ZeroError Capacity of the Chemical Channel with Feedback
