On the Complexity of Differentially Private Data Release: Efficient Algorithms and Hardness Results

Citation:

Cynthia Dwork, Moni Naor, Omer Reingold, Guy Rothblum, and Salil Vadhan. 2009. “On the Complexity of Differentially Private Data Release: Efficient Algorithms and Hardness Results.” In Proceedings of the 41st Annual ACM Symposium on Theory of Computing (STOC `09), Pp. 381–390. Bethesda, MD. Date Presented: 31 May–2 June. ACM Digital Library
PDF291 KB
Acknowledgements: This paper was supported, in part, by NSF grant CNS-0831289, Microsoft Research, and Harvard's Center for Research on Computation and Society.
Last updated on 01/05/2017