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

Amos Beimel, Shiva Prasad Kasiviswanathan, Kobbi Nissim

Theory of Cryptography, 7th Theory of Cryptography Conference, TCC 2010, Zurich, Switzerland, February 9-11, 2010. Proceedings — 2010

DOI Link

BibTeX

@inproceedings{DBLP:conf/tcc/BeimelKN10,
  author = {Beimel, Amos and Kasiviswanathan, Shiva Prasad and Nissim, Kobbi},
  editor = {Micciancio, Daniele},
  title = {Bounds on the Sample Complexity for Private Learning and Private Data
                    Release},
  booktitle = {Theory of Cryptography, 7th Theory of Cryptography Conference, {TCC}
                    2010, Zurich, Switzerland, February 9-11, 2010. Proceedings},
  series = {Lecture Notes in Computer Science},
  volume = {5978},
  pages = {437--454},
  publisher = {Springer},
  year = {2010},
  url = {https://doi.org/10.1007/978-3-642-11799-2\_26},
  doi = {10.1007/978-3-642-11799-2\_26},
  timestamp = {Tue, 14 May 2019 10:00:47 +0200},
  biburl = {https://dblp.org/rec/conf/tcc/BeimelKN10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}