skip to main content
10.1145/3188745.3188946acmconferencesArticle/Chapter ViewAbstractPublication PagesstocConference Proceedingsconference-collections
research-article

Composable and versatile privacy via truncated CDP

Published:20 June 2018Publication History

ABSTRACT

We propose truncated concentrated differential privacy (tCDP), a refinement of differential privacy and of concentrated differential privacy. This new definition provides robust and efficient composition guarantees, supports powerful algorithmic techniques such as privacy amplification via sub-sampling, and enables more accurate statistical analyses. In particular, we show a central task for which the new definition enables exponential accuracy improvement.

Skip Supplemental Material Section

Supplemental Material

1c-1.mp4

mp4

33 MB

References

  1. Martín Abadi, Andy Chu, Ian Goodfellow, H Brendan McMahan, Ilya Mironov, Kunal Talwar, and Li Zhang. 2016. Deep learning with differential privacy. In Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Mitali Bafna and Jonathan Ullman. 2017. The Price of Selection in Differential Privacy. In Proceedings of the 30th Conference on Learning Theory, COLT 2017, Amsterdam, The Netherlands, 7-10 July 2017. 151–168.Google ScholarGoogle Scholar
  3. Amos Beimel, Kobbi Nissim, and Uri Stemmer. 2013.Google ScholarGoogle Scholar
  4. Private Learning and Sanitization: Pure vs. Approximate Differential Privacy. In APPROX-RANDOM.Google ScholarGoogle Scholar
  5. Raghav Bhaskar, Srivatsan Laxman, Adam D. Smith, and Abhradeep Thakurta. 2010. Discovering frequent patterns in sensitive data. In Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Washington, DC, USA, July 25-28, 2010. 503–512. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Mark Bun, Kobbi Nissim, Uri Stemmer, and Salil Vadhan. 2015.Google ScholarGoogle Scholar
  7. Differentially private release and learning of threshold functions. In FOCS. IEEE.Google ScholarGoogle Scholar
  8. Mark Bun and Thomas Steinke. 2016. Concentrated Differential Privacy: Simplifications, Extensions, and Lower Bounds. In TCC. https://arxiv.org/abs/1605.02065. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Kamalika Chaudhuri, Daniel J. Hsu, and Shuang Song. 2014. The Large Margin Mechanism for Differentially Private Maximization. In Advances in Neural Information Processing Systems 27: Annual Conference on Neural Information Processing Systems 2014, December 8-13 2014, Montreal, Quebec, Canada. 1287–1295. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Anindya De. 2012. Lower Bounds in Differential Privacy. In TCC. org/10.1007/978- 3- 642- 28914- 9_18Google ScholarGoogle Scholar
  11. Cynthia Dwork. 2006. Differential Privacy. In Proceedings of the 33rd International Conference on Automata, Languages and Programming - Volume Part II (ICALP’06). Springer-Verlag, Berlin, Heidelberg, 1–12. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Cynthia Dwork, Krishnaram Kenthapadi, Frank McSherry, Ilya Mironov, and Moni Naor. 2006. Our Data, Ourselves: Privacy Via Distributed Noise Generation. In EUROCRYPT. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Cynthia Dwork and Jing Lei. 2009. Differential privacy and robust statistics. In STOC. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Cynthia Dwork, Frank McSherry, Kobbi Nissim, and Adam Smith. 2006. Calibrating Noise to Sensitivity in Private Data Analysis. In TCC. http://repository.cmu. edu/jpc/vol7/iss3/2. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Cynthia Dwork, Moni Naor, Omer Reingold, and Guy N. Rothblum. 2015. Pure Differential Privacy for Rectangle Queries via Private Partitions. In Advances in Cryptology - ASIACRYPT 2015 - 21st International Conference on the Theory and Application of Cryptology and Information Security, Auckland, New Zealand, November 29 - December 3, 2015, Proceedings, Part II. 735–751. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Cynthia Dwork and Guy Rothblum. 2016.Google ScholarGoogle Scholar
  17. Concentrated Differential Privacy. CoRR abs/1603.01887 (2016). http://arxiv.org/abs/1603.01887 https://arxiv.org/ abs/1603.01887.Google ScholarGoogle Scholar
  18. Cynthia Dwork, Guy N. Rothblum, and Salil P. Vadhan. 2010.Google ScholarGoogle Scholar
  19. Boosting and Differential Privacy. In FOCS.Google ScholarGoogle Scholar
  20. Moritz Hardt and Kunal Talwar. 2010. On the Geometry of Differential Privacy. In STOC. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Shiva Prasad Kasiviswanathan, Homin K. Lee, Kobbi Nissim, Sofya Raskhodnikova, and Adam D. Smith. 2011.Google ScholarGoogle Scholar
  22. What Can We Learn Privately? SIAM J. Comput. 40, 3 (2011), 793–826. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. F. McSherry and K. Talwar. 2007. Mechanism Design via Differential Privacy. In FOCS. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. Ilya Mironov. 2017. Renyi differential privacy. arXiv preprint arXiv:1702.07476 (2017).Google ScholarGoogle Scholar
  25. https://arxiv.org/abs/1702.07476.Google ScholarGoogle Scholar
  26. Jack Murtagh and Salil P. Vadhan. 2016.Google ScholarGoogle Scholar
  27. The Complexity of Computing the Optimal Composition of Differential Privacy. In TCC.Google ScholarGoogle Scholar
  28. Alfréd Rényi. 1961. On Measures of Entropy and Information. In Proceedings of the Fourth Berkeley Symposium on Mathematical Statistics and Probability, Volume 1: Contributions to the Theory of Statistics. University of California Press, Berkeley, Calif., 547–561. http://projecteuclid.org/euclid.bsmsp/1200512181Google ScholarGoogle Scholar
  29. Adam Smith. 2009. Differential privacy and the secrecy of the sample. (2009).Google ScholarGoogle Scholar
  30. https://adamdsmith.wordpress.com/2009/09/02/samplesecrecy/.Google ScholarGoogle Scholar
  31. Thomas Steinke and Jonathan Ullman. 2017. Tight Lower Bounds for Differentially Private Selection. In FOCS. https://arxiv.org/abs/1704.03024.Google ScholarGoogle Scholar
  32. T. van Erven and P. Harremos. 2014.Google ScholarGoogle Scholar
  33. Rényi Divergence and Kullback-Leibler Divergence. IEEE Transactions on Information Theory 60, 7 (July 2014), 3797–3820.Google ScholarGoogle Scholar

Index Terms

  1. Composable and versatile privacy via truncated CDP

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Conferences
      STOC 2018: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing
      June 2018
      1332 pages
      ISBN:9781450355599
      DOI:10.1145/3188745

      Copyright © 2018 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 20 June 2018

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article

      Acceptance Rates

      Overall Acceptance Rate1,469of4,586submissions,32%

      Upcoming Conference

      STOC '24
      56th Annual ACM Symposium on Theory of Computing (STOC 2024)
      June 24 - 28, 2024
      Vancouver , BC , Canada

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader