2012 IEEE 53rd Annual Symposium on Foundations of Computer Science (2012)
New Brunswick, NJ, USA USA
Oct. 20, 2012 to Oct. 23, 2012
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/FOCS.2012.87
We initiate the study of "privacy for the analyst" in differentially private data analysis. That is, not only will we be concerned with ensuring differential privacy for the data (i.e. individuals or customers), which are the usual concern of differential privacy, but we also consider (differential) privacy for the set of queries posed by each data analyst. The goal is to achieve privacy with respect to other analysts, or users of the system. This problem arises only in the context of stateful privacy mechanisms, in which the responses to queries depend on other queries posed (a recent wave of results in the area utilized cleverly coordinated noise and state in order to allow answering privately hugely many queries). We argue that the problem is real by proving an exponential gap between the number of queries that can be answered (with non-trivial error) by stateless and stateful differentially private mechanisms. We then give a stateful algorithm for differentially private data analysis that also ensures differential privacy for the analyst and can answer exponentially many queries.
long code, differential privacy, list decoding
C. Dwork, M. Naor and S. Vadhan, "The Privacy of the Analyst and the Power of the State," 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science(FOCS), New Brunswick, NJ, USA USA, 2012, pp. 400-409.