Research Summary

I am interested in tradeoffs between online privacy and other measures like communication cost, accuracy, and optimality. Can privacy be traded away in return for faster computation time or better answers to computational problems? Do the same protocols protect privacy from eavesdroppers and other participants? Are some applications and functions hopelessly privacy-revealing?

My general theory interests cover a variety of topics, including computability, communication complexity, distributed computing, cryptography, using randomization in algorithms and proof techniques, and proof complexity.

My Erdős number is 4.

Publications

(A name with a * indicates a Swarthmore student.)

Forthcoming

  • L. Fontes, S. Laplante, M. Laurière, and A. Nolin. Lower bounds for public-coin information complexity. In preparation.

Journal Publications

Conference Publications

Manuscripts