On the complexity of differentially private data release: efficient algorithms and hardness results

Cynthia Dwork, Moni Naor, Omer Reingold, Guy N. Rothblum, Salil P. Vadhan. On the complexity of differentially private data release: efficient algorithms and hardness results. In Michael Mitzenmacher, editor, Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009. pages 381-390, ACM, 2009. [doi]

Authors

Cynthia Dwork

This author has not been identified. Look up 'Cynthia Dwork' in Google

Moni Naor

This author has not been identified. Look up 'Moni Naor' in Google

Omer Reingold

This author has not been identified. Look up 'Omer Reingold' in Google

Guy N. Rothblum

This author has not been identified. Look up 'Guy N. Rothblum' in Google

Salil P. Vadhan

This author has not been identified. Look up 'Salil P. Vadhan' in Google