Advertisement

Pure Differential Privacy for Rectangle Queries via Private Partitions

  • Cynthia Dwork
  • Moni Naor
  • Omer Reingold
  • Guy N. RothblumEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9453)

Abstract

We consider the task of data analysis with pure differential privacy. We construct new and improved mechanisms for statistical release of interval and rectangle queries. We also obtain a new algorithm for counting over a data stream under continual observation, whose error has optimal dependence on the data stream’s length.

A central ingredient in all of these result is a differentially private partition mechanism. Given set of data items drawn from a large universe, this mechanism outputs a partition of the universe into a small number of segments, each of which contain only a few of the data items.

Keywords

Data Item Internal Node Partition Algorithm Differential Privacy Current Segment 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. [Ben75]
    Bentley, J.L.: Multidimensional binary search trees used for associative searching. Commun. ACM 18(9), 509–517 (1975)zbMATHMathSciNetCrossRefGoogle Scholar
  2. [BLR08]
    Blum, A., Ligett, K., Roth, A.: A learning theory approach to non-interactive database privacy. In: STOC (2008)Google Scholar
  3. [BNS13]
    Beimel, A., Nissim, K., Stemmer, U.: Private learning and sanitization: pure vs. approximate differential privacy. In: Raghavendra, P., Raskhodnikova, S., Jansen, K., Rolim, J.D.P. (eds.) APPROX/RANDOM 2013. LNCS, vol. 8096, pp. 363–378. Springer, Heidelberg (2013)CrossRefGoogle Scholar
  4. [BNSV15]
    Bun, M., Nissim, K., Stemmer, U., Vadhan, SP.: Differentially private release and learning of threshold functions. CoRR, abs/1504.07553 (2015)Google Scholar
  5. [BUV14]
    Bun, M., Ullman, J., Vadhan, S.: Fingerprinting codes and the price of approximate differential privacy. In: Proceedings of the 46th Annual ACM Symposium on Theory of Computing, pp. 1–10. ACM (2014)Google Scholar
  6. [CSS11]
    Hubert Chan, T.-H., Shi, E., Song, D.: Private and continual release of statistics. ACM Trans. Inf. Syst. Secur. 14(3), 26 (2011)Google Scholar
  7. [DKM+06]
    Dwork, C., Kenthapadi, K., McSherry, F., Mironov, I., Naor, M.: Our data, ourselves: privacy via distributed noise generation. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 486–503. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  8. [DMNS06]
    Dwork, C., McSherry, F., Nissim, K., Smith, A.: Calibrating noise to sensitivity in private data analysis. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 265–284. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  9. [DN03]
    Dinur, I., Nissim, K.: Revealing information while preserving privacy. In: PODS, pp. 202–210 (2003)Google Scholar
  10. [DN04]
    Dwork, C., Nissim, K.: Privacy-preserving datamining on vertically partitioned databases. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 528–544. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  11. [DNPR10]
    Dwork, C., Naor, M., Pitassi, T., Rothblum, G.N.: Differential privacy under continual observation. In: Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5–8 June 2010, pp. 715–724 (2010)Google Scholar
  12. [DNR+09]
    Dwork, C., Naor, M., Reingold, O., Rothblum, G.N., Vadhan, S.: On the complexity of differentially private data release: efficient algorithms and hardness results. In: STOC, pp. 381–390 (2009)Google Scholar
  13. [DR14]
    Dwork, C., Roth, A.: The algorithmic foundations of differential privacy. Found. Trends Theor. Comput. Sci. 9(3–4), 211–407 (2014)MathSciNetGoogle Scholar
  14. [HR10]
    Hardt, M., Rothblum, G.N.: A multiplicative weights mechanism for interactive privacy-preserving data analysis. In: FOCS (2010)Google Scholar
  15. [MN12]
    Muthukrishnan, S., Nikolov, A.: Optimal private halfspace counting via discrepancy. In: Proceedings of the 44th Symposium on Theory of Computing Conference, STOC 2012, New York, NY, USA, 19–22 May 2012, pp. 1285–1292 (2012)Google Scholar
  16. [Ull13]
    Ullman, J.: Answering n \(\{\)2+ o (1)\(\}\) counting queries with differential privacy is hard. In: Proceedings of the Forty-Fifth Annual ACM Symposium on Theory of Computing, pp. 361–370. ACM (2013)Google Scholar

Copyright information

© International Association for Cryptologc Research 2015

Authors and Affiliations

  • Cynthia Dwork
    • 1
  • Moni Naor
    • 2
  • Omer Reingold
    • 3
  • Guy N. Rothblum
    • 3
    Email author
  1. 1.Microsoft ResearchMountain ViewUSA
  2. 2.The Weizmann InstituteRehovotIsrael
  3. 3.Samsung Research AmericaMountain ViewUSA

Personalised recommendations