@inproceedings{conf/tcc/BeimelKN10,
  added-at = {2010-02-08T00:00:00.000+0100},
  author = {Beimel, Amos and Kasiviswanathan, Shiva Prasad and Nissim, Kobbi},
  biburl = {http://www.bibsonomy.org/bibtex/235b3e1e70a4ce6df4745bf3b809eaa4b/dblp},
  booktitle = {TCC},
  crossref = {conf/tcc/2010},
  date = {2010-02-08},
  description = {dblp},
  editor = {Micciancio, Daniele},
  ee = {http://dx.doi.org/10.1007/978-3-642-11799-2_26},
  interhash = {1d3d99c75ae0773fbe2e275f2df83d98},
  intrahash = {35b3e1e70a4ce6df4745bf3b809eaa4b},
  isbn = {978-3-642-11798-5},
  keywords = {dblp},
  pages = {437-454},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  timestamp = {2010-02-08T00:00:00.000+0100},
  title = {Bounds on the Sample Complexity for Private Learning and Private Data Release.},
  url = {http://dblp.uni-trier.de/db/conf/tcc/tcc2010.html#BeimelKN10},
  volume = 5978,
  year = 2010
}