Paul W. Cuff

According to our database1, Paul W. Cuff authored at least 84 papers between 2007 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Smoothing Brascamp-Lieb Inequalities and Strong Converses of Coding Theorems.
IEEE Trans. Inf. Theory, 2020

Wiretap Channels With Random States Non-Causally Available at the Encoder.
IEEE Trans. Inf. Theory, 2020

2019
Exact Exponent for Soft Covering.
IEEE Trans. Inf. Theory, 2019

2018
Puzzles in Memory of Solomon Golomb.
IEEE Trans. Inf. Theory, 2018

Differentially Private Oblivious RAM.
Proc. Priv. Enhancing Technol., 2018

A Forward-Reverse Brascamp-Lieb Inequality: Entropic Duality and Gaussian Optimality.
Entropy, 2018

Exact Soft-Covering Exponent.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Key-Message Security over State-Dependent Wiretap Channels.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017
Secret Key Generation With Limited Interaction.
IEEE Trans. Inf. Theory, 2017

E<sub>γ</sub>-Resolvability.
IEEE Trans. Inf. Theory, 2017

Strong Secrecy for Cooperative Broadcast Channels.
IEEE Trans. Inf. Theory, 2017

An EEG Acquisition and Biomarker-Extraction System Using Low-Noise-Amplifier and Compressive-Sensing Circuits Based on Flexible, Thin-Film Electronics.
IEEE J. Solid State Circuits, 2017

Semantically-Secured Message-Key Trade-off over Wiretap Channels with Random Parameters.
CoRR, 2017

Information-Theoretic Perspectives on Brascamp-Lieb Inequality and Its Reverse.
CoRR, 2017

The shannon cipher system with a guessing eavesdropper.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

The Gelfand-Pinsker wiretap channel: Higher secrecy rates via a novel superposition code.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Physical Layer Security over Wiretap Channels with Random Parameters.
Proceedings of the Cyber Security Cryptography and Machine Learning, 2017

Wiretap channels with random states.
Proceedings of the 51st Annual Conference on Information Sciences and Systems, 2017

On α-decodability and α-likelihood decoder.
Proceedings of the 55th Annual Allerton Conference on Communication, 2017

2016
The Likelihood Encoder for Lossy Compression.
IEEE Trans. Inf. Theory, 2016

The Henchman Problem: Measuring Secrecy by the Minimum Distortion in a List.
IEEE Trans. Inf. Theory, 2016

Secure Cascade Channel Synthesis.
IEEE Trans. Inf. Theory, 2016

Key Capacity for Product Sources With Application to Stationary Gaussian Processes.
IEEE Trans. Inf. Theory, 2016

Arbitrarily Varying Wiretap Channels With Type Constrained States.
IEEE Trans. Inf. Theory, 2016

Semantic-Security Capacity for Wiretap Channels of Type II.
IEEE Trans. Inf. Theory, 2016

Root ORAM: A Tunable Differentially Private Oblivious RAM.
CoRR, 2016

Common Randomness and Key Generation with Limited Interaction.
CoRR, 2016

Semantic-Security Capacity for the Physical Layer via Information Theory.
Proceedings of the 2016 IEEE International Conference on Software Science, 2016

Key generation with limited interaction.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Brascamp-Lieb inequality and its reverse: An information theoretic view.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Smoothing Brascamp-Lieb inequalities and strong converses for common randomness generation.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Soft covering with high probability.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Differential Privacy as a Mutual Information Constraint.
Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, 2016

2015
An Upper Bound on the Convergence Time for Quantized Consensus of Arbitrary Static Graphs.
IEEE Trans. Autom. Control., 2015

$E_γ$-Resolvability.
CoRR, 2015

The likelihood encoder with applications to lossy compression and secrecy.
Proceedings of the 2015 Information Theory and Applications Workshop, 2015

Joint source-channel secrecy using hybrid coding.
Proceedings of the IEEE International Symposium on Information Theory, 2015

Gaussian secure source coding and Wyner's Common Information.
Proceedings of the IEEE International Symposium on Information Theory, 2015

One-shot mutual covering lemma and Marton's inner bound with a common message.
Proceedings of the IEEE International Symposium on Information Theory, 2015

Resolvability in Eγ with applications to lossy compression and wiretap channels.
Proceedings of the IEEE International Symposium on Information Theory, 2015

Secret key generation with one communicator and a one-shot converse via hypercontractivity.
Proceedings of the IEEE International Symposium on Information Theory, 2015

A stronger soft-covering lemma and applications.
Proceedings of the 2015 IEEE Conference on Communications and Network Security, 2015

2014
Rate-Distortion Theory for Secrecy Systems.
IEEE Trans. Inf. Theory, 2014

Rate-Distortion-Based Physical Layer Secrecy with Applications to Multimode Fiber.
IEEE Trans. Commun., 2014

Cooperative Caching based on File Popularity Ranking in Delay Tolerant Networks.
CoRR, 2014

Beyond personalization and anonymity: towards a group-based recommender system.
Proceedings of the Symposium on Applied Computing, 2014

The likelihood encoder for lossy source compression.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Secure coordination with a two-sided helper.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Key capacity with limited one-way communication for product sources.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

The application of differential privacy for rank aggregation: Privacy and accuracy.
Proceedings of the 17th International Conference on Information Fusion, 2014

A rate-distortion based secrecy system with side information at the decoders.
Proceedings of the 52nd Annual Allerton Conference on Communication, 2014

2013
Distributed Channel Synthesis.
IEEE Trans. Inf. Theory, 2013

Privacy Preserving Recommendation System Based on Groups
CoRR, 2013

Rate-Distortion-Based Physical Layer Secrecy in Multimode Fiber
CoRR, 2013

A connection between good rate-distortion codes and backward DMCs.
Proceedings of the 2013 IEEE Information Theory Workshop, 2013

The likelihood encoder for source coding.
Proceedings of the 2013 IEEE Information Theory Workshop, 2013

Secrecy in cascade networks.
Proceedings of the 2013 IEEE Information Theory Workshop, 2013

Optimal equivocation in secrecy systems a special case of distortion-based characterization.
Proceedings of the 2013 Information Theory and Applications Workshop, 2013

A bit of secrecy for Gaussian source compression.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

An upper bound on the convergence time for quantized consensus.
Proceedings of the IEEE INFOCOM 2013, Turin, Italy, April 14-19, 2013, 2013

2012
A Random Walk Based Model Incorporating Social Information for Recommendations
CoRR, 2012

Iterative collaborative filtering for recommender systems with sparse data.
Proceedings of the IEEE International Workshop on Machine Learning for Signal Processing, 2012

A randomwalk based model incorporating social information for recommendations.
Proceedings of the IEEE International Workshop on Machine Learning for Signal Processing, 2012

A class of log-optimal utility functions.
Proceedings of the 2012 Information Theory and Applications Workshop, 2012

Secrecy is cheap if the adversary must reconstruct.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

An upper bound on the convergence time for distributed binary consensus.
Proceedings of the 15th International Conference on Information Fusion, 2012

Condorcet voting methods avoid the paradoxes of voting theory.
Proceedings of the 50th Annual Allerton Conference on Communication, 2012

Source-channel secrecy with causal disclosure.
Proceedings of the 50th Annual Allerton Conference on Communication, 2012

2011
On the Role of the Refinement Layer in Multiple Description Coding and Scalable Coding.
IEEE Trans. Inf. Theory, 2011

Using a Secret Key to Foil an Eavesdropper
CoRR, 2011

Coordination using implicit communication.
Proceedings of the 2011 IEEE Information Theory Workshop, 2011

A lattice of gambles.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Wisdom of the Crowd: Incorporating Social Influence in Recommendation Models.
Proceedings of the 17th IEEE International Conference on Parallel and Distributed Systems, 2011

Mutual information scheduling for ranking.
Proceedings of the 14th International Conference on Information Fusion, 2011

Hybrid codes needed for coordination over the point-to-point channel.
Proceedings of the 49th Annual Allerton Conference on Communication, 2011

2010
Coordination capacity.
IEEE Trans. Inf. Theory, 2010

A Framework for Partial Secrecy.
Proceedings of the Global Communications Conference, 2010

2009
State Information in Bayesian Games
CoRR, 2009

A Random Variable Substitution Lemma With Applications to Multiple Description Coding
CoRR, 2009

Consolidating achievable regions of multiple descriptions.
Proceedings of the IEEE International Symposium on Information Theory, 2009

Cascade multiterminal source coding.
Proceedings of the IEEE International Symposium on Information Theory, 2009

2008
Capacity of the Trapdoor Channel With Feedback.
IEEE Trans. Inf. Theory, 2008

Communication requirements for generating correlated random variables.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

2007
Capacity and Zero-Error Capacity of the Chemical Channel with Feedback.
Proceedings of the IEEE International Symposium on Information Theory, 2007


  Loading...