Private Data Analysis via Output Perturbation

A Rigorous Approach to Constructing Sanitizers and Privacy Preserving Algorithms
  • Kobbi Nissim
Part of the Advances in Database Systems book series (ADBS, volume 34)

We describe output perturbation techniques that allow for a provable, rigorous sense of individual privacy. Examples where the techniques are effective span frombasic statistical computations to sophisticated machine learning algorithms.

Keywords

Private query processing output perturbation 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Nabil R. Adam and John C. Wortmann. Security-control methods for statistical databases: a comparative study. In ACM Computing surveys, Vol. 21, No. 4, pages 515–556, 1989.CrossRefGoogle Scholar
  2. 2.
    Dakshi Agrawal and Charu C. Aggarwal. On the design and quantification of privacy preserving data mining algorithms. In Proceedings of the 20th Symposium on Principles of Database Systems (PODS), pages 247–255, 2001.Google Scholar
  3. 3.
    Rakesh Agrawal and Ramakrishnan Srikant. Privacy-preserving data mining. In Proceedings of the 2000 SIGMOD International Conference on Management of Data, Vol. 29, No. 2, pages 439–450, 2000.Google Scholar
  4. 4.
    Boaz Barak, Kamalika Chaudhuri, Cynthia Dwork, Satyen Kale, Frank McSherry, and Kunal Talwar. Privacy, accuracy, and consistency too: a holistic solution to contingency table release. In Proceedings of the 26th Symposium on Principles of Database Systems (PODS), pages 273–282, 2007.Google Scholar
  5. 5.
    Michael Ben-Or, Shafi Goldwasser, and Avi Wigderson. Completeness theorems for noncryptographic fault-tolerant distributed computations. In Proceedings of the 20th Symposium on the Theory of Computing (STOC), pages 1–10, 1988.Google Scholar
  6. 6.
    Avrim Blum, Cynthia Dwork, Frank McSherry, and Kobbi Nissim. Practical privacy: The SULQ framework. In Proceedings of the 24th Symposium on Principles of Database Systems (PODS), Pages 128–138, 2005.Google Scholar
  7. 7.
    David Chaum, Claude Crépeau, and Ivan Damgård. Multiparty unconditionally secure protocols. In Proceedings of the 20th Symposium on the Theory of Computing (STOC), pages 11–19, 1988.Google Scholar
  8. 8.
    Shuchi Chawla, Cynthia Dwork, Frank McSherry, Adam Smith, and Hoeteck Wee. Toward privacy in public databases. In Theory of Cryptography Conference (TCC), pages 363–385, 2005.Google Scholar
  9. 9.
    Shuchi Chawla, Cynthia Dwork, Frank McSherry, and Kunal Talwar. On the utility of privacy-preserving histograms. In 21st Conference on Uncertainty in Artificial Intelligence (UAI), 2005.Google Scholar
  10. 10.
    Kamalika Chaudhuri and Nina Mishra When Random Sampling Preserves Privacy. In Proceedings of the 26th Annual International Cryptology Conference (CRYPTO), LNCS 4117, Springer, pages 198–213, 2006.Google Scholar
  11. 11.
    Tore Dalenius. Towards a methodology for statistical disclusure control. In statistik Tidskrift, Vol. 15, pages 429–444, 1997.Google Scholar
  12. 12.
    Irit Dinur and Kobbi Nissim. Revealing information while preserving privacy. In Proceedings of the 22nd Symposium on Principles of Database Systems (PODS), pages 202–210, 2003.Google Scholar
  13. 13.
    Cynthia Dwork. Differential Privacy. In Proceedings of the 33rd International Colloquium on Automata, Languages and Programming (ICALP), LNCS 4052, pages 1–12, 2006.Google Scholar
  14. 14.
    Cynthia Dwork. Ask a Better Question, Get a Better Answer. A New Approach to Private Data Analysis. In Proceedings of the 11th International Conference on Database Theory (ICDT), LNCS 4353, pages 18–27, 2007.Google Scholar
  15. 15.
    Cynthia Dwork, Krishnaram Kenthapadi, Frank McSherry, Ilya Mironov, and Moni Naor. Our data, ourselves: Privacy via distributed noise generation. In 25th Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT), LNCS 4004, pages 486–503, 2006.Google Scholar
  16. 16.
    Cynthia Dwork, Frank McSherry, Kobbi Nissim, and Adam Smith. Calibrating Noise to Sensitivity in Private Data Analysis. In Theory of Cryptography Conference (TCC), pages 265–284, 2006.Google Scholar
  17. 17.
    Cynthia Dwork, Frank McSherry, and Kunal Talwar, The price of privacy and the limits of LP decoding. In Proceedings of the 39th Annual ACM Symposium on Theory of Computing (STOC), pages 85–94, 2007.Google Scholar
  18. 18.
    Cynthia Dwork and Kobbi Nissim. Privacy-preserving datamining on vertically partitioned databases. In Advances in Cryptology - CRYPTO 2004, 24th Annual International Cryptology Conference (CRYPTO) LNCS 3152, pages 528–544, 2004.Google Scholar
  19. 19.
    Alexandre V. Evfimievski, Johannes Gehrke, and Ramakrishnan Srikant. Limiting privacy breaches in privacy preserving data mining. In Proceedings of the 22nd Symposium on Principles of Database Systems (PODS), pages 211–222, 2003.Google Scholar
  20. 20.
    Shafi Goldwasser and Silvio Micali. Probabilistic encryption. In Journal of Computer and System Sciences, Vol. 28, No. 2, pages 270–299, April 1984.MATHCrossRefMathSciNetGoogle Scholar
  21. 21.
    Oded Goldreich, Silvio Micali, and Avi Wigderson. How to play any mental game. A Completeness Theorem for Protocols with Honest Majority. In Proceedings of the 19th Annual ACM Symposium on Theory of Computing (STOC), pages 218–229, 1987.Google Scholar
  22. 22.
    Michael Kearns, Efficient Noise-Tolerant Learning from Statistical Queries, In Journal of the ACM Vol. 45, No. 6, pages 983 – 1006, 1998. See also Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing (STOC), pages 392–401, 1993.Google Scholar
  23. 23.
    Krishnaram Kenthapadi, Nina Mishra, and Kobbi Nissim. Simulatable auditing In Proceedings of the Twenty-fourth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS), Pages 118–127, 2005.Google Scholar
  24. 24.
    Yehuda Lindell and Benny Pinkas. Privacy preserving data mining. In Journal of Cryptology, Vol. 15, No. 3, pages 177–206, 2002.MATHCrossRefMathSciNetGoogle Scholar
  25. 25.
    Kobbi Nissim, Sofya Raskhodnikova, and Adam Smith. Smooth Sensitivity and Sampling in Private Data Analysis. In Proceedings of the 39th Annual ACM Symposium on Theory of Computing (STOC), pages 7584, 2007.Google Scholar
  26. 26.
    Ashwin Machanavajjhala, Johannes Gehrke, Daniel Kifer, and Muthuramakrishnan Venkitasubramaniam. l-Diversity: Privacy Beyond k-Anonymity. In Proceedings of the 22nd International Conference on Data Engineering, (ICDE), page 24, 2006.Google Scholar
  27. 27.
    Nina Mishra and Mark Sandler. Privacy via pseudorandom sketches. In Proceedings of the Twenty-Fifth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS), pages 143–152.Google Scholar
  28. 28.
    Frank McSherry and Kunal Talwar. Mechanism Design via Differential Privacy. To appear, FOCS 2007.Google Scholar
  29. 29.
    Shubha U. Nabar, Bhaskara Marthi, Krishnaram Kenthapadi, Nina Mishra, and Rajeev Motwani. Towards Robustness in Query Auditing. In Proceedings of the 32nd International Conference on Very Large Data Bases (VLDB), pages 151-162, 2006.Google Scholar
  30. 30.
    M. J. O’Connell, Search Program for Significant Variables, In Computer Physics Communications, Vol. 8, No. 1, Pages 49–55, 1974.CrossRefMathSciNetGoogle Scholar
  31. 31.
    Latanya Sweeney. k-anonymity: a model for protecting privacy. In International Journal of Uncertainty, Fuzziness, and Knowledge-Based Systems, 10(5):557–570, 2002.MATHCrossRefMathSciNetGoogle Scholar
  32. 32.
    Latanya Sweeney. Achieving k-anonymity privacy protection using generalization and Suppression. In International Journal of Uncertainty, Fuzziness, and Knowledge-Based Systems, Vol. 10, No. 5, pages 571–588, 2002.MATHCrossRefMathSciNetGoogle Scholar
  33. 33.
    Stanley L. Warner. Randomized response: A survey technique for eliminating evasive answer bias. In Journal of the American Statistical Association, Vol. 60, No. 309, pages 63–69, 1965.CrossRefGoogle Scholar
  34. 34.
    Andrew C. Yao. Protocols for secure computations. In Proceedings of the 23th IEEE Symposium on Foundations of Computer Science (FOCS), pages 160–164, 1982.Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2008

Authors and Affiliations

  • Kobbi Nissim
    • 1
  1. 1.Department of Computer ScienceBen-Gurion University of the NegevIsrael

Personalised recommendations