Bounds on the Sample Complexity for Private Learning and Private Data Release

Amos Beimel, Shiva Prasad Kasiviswanathan, Kobbi Nissim. Bounds on the Sample Complexity for Private Learning and Private Data Release. In Daniele Micciancio, editor, Theory of Cryptography, 7th Theory of Cryptography Conference, TCC 2010, Zurich, Switzerland, February 9-11, 2010. Proceedings. Volume 5978 of Lecture Notes in Computer Science, pages 437-454, Springer, 2010. [doi]

Abstract

Abstract is missing.