Paul W. Cuff – Research Output

Publications

• Secrecy is Cheap if the Adversary Must Reconstruct

  • C. Schieler, P. Cuff  —  ISIT, July, 2012.

• Glauber Dynamics for the mean-field Potts Model

  • P. Cuff, J. Ding, O. Louidor, E. Lubetzky, Y. Peres, A. Sly  —  arXiv, 2012.

• Coordination using Implicit Communication

  • P. Cuff and L. Zhao  —  ITW, October, 2011.

• Hybrid Codes Needed for Coordination over the Point-to-Point Channel

  • P. Cuff and C. Schieler  —  Allerton, September, 2011.

• 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.

• 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 Info. Theory, 57(3):1443-56, March, 2011.

• Using a Secret Key to Foil an Eavesdropper

  • P. Cuff  —  Allerton, September, 2010.

• A Framework for Partial Secrecy

  • P. Cuff  —  Globecom, December, 2010.

• Coordination Capacity

  • P. Cuff, H. Permuter, and T. Cover  —  IEEE Trans. on Info. Theory, 56(9):4181-206, September, 2010.

• State Information in Bayesian Games

  • P. Cuff  —  Presented at Allerton, October, 2009.

• Communication in Networks for Coordinating Behavior

  • P. Cuff  —  Ph.D. Dissertation, Stanford University, August, 2009.

• 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 of the Trapdoor Channel with Feedback

  • H. Permuter, P. Cuff, B. Van Roy, and T. Weissman  —  IEEE Trans. on Info. Theory, 54(7):3150-65, July, 2008.

Talks (slides)

• CISS 2012 - “A Toward a Secure Data-rate Theorem.”

• Zurich Seminar on Communications 2012 - “A The Sourse Coding Side of Secrecy.”

• ITA 2012 - “A Class of Log-optimal Utility Functions.”

• Allerton 2011 - “Hybrid Codes Needed for Coordination over the Point-to-Point 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, 2010 - “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 Zero-Error Capacity of the Chemical Channel with Feedback.”