{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:12:36Z","timestamp":1763467956146,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642117985"},{"type":"electronic","value":"9783642117992"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11799-2_26","type":"book-chapter","created":{"date-parts":[[2010,2,2]],"date-time":"2010-02-02T08:55:48Z","timestamp":1265100948000},"page":"437-454","source":"Crossref","is-referenced-by-count":42,"title":["Bounds on the Sample Complexity for Private Learning and Private Data Release"],"prefix":"10.1007","author":[{"given":"Amos","family":"Beimel","sequence":"first","affiliation":[]},{"given":"Shiva Prasad","family":"Kasiviswanathan","sequence":"additional","affiliation":[]},{"given":"Kobbi","family":"Nissim","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"crossref","unstructured":"Beimel, A., Kasiviswanathan, S., Nissim, K.: Bounds on the Sample Complexity for Private Learning and Private Data Release (Full version) (2009)","DOI":"10.1007\/978-3-642-11799-2_26"},{"key":"26_CR2","first-page":"128","volume-title":"PODS","author":"A. Blum","year":"2005","unstructured":"Blum, A., Dwork, C., McSherry, F., Nissim, K.: Practical privacy: The SuLQ framework. In: PODS, pp. 128\u2013138. ACM, New York (2005)"},{"key":"26_CR3","first-page":"609","volume-title":"STOC","author":"A. Blum","year":"2008","unstructured":"Blum, A., Ligett, K., Roth, A.: A learning theory approach to non-interactive database privacy. In: STOC, pp. 609\u2013618. ACM, New York (2008)"},{"key":"26_CR4","unstructured":"Blum, A., Ligett, K., Roth, A.: Private communication (2008)"},{"issue":"4","key":"26_CR5","doi-asserted-by":"publisher","first-page":"929","DOI":"10.1145\/76359.76371","volume":"36","author":"A. Blumer","year":"1989","unstructured":"Blumer, A., Ehrenfeucht, A., Haussler, D., Warmuth, M.K.: Learnability and the Vapnik-Chervonenkis dimension. Journal of the Association for Computing Machinery\u00a036(4), 929\u2013965 (1989)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"26_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"496","DOI":"10.1007\/978-3-642-00457-5_29","volume-title":"TCC 2009","author":"C. Dwork","year":"2009","unstructured":"Dwork, C.: The differential privacy frontier (extended abstract). In: Reingold, O. (ed.) TCC 2009. LNCS, vol.\u00a05444, pp. 496\u2013502. Springer, Heidelberg (2009)"},{"key":"26_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/11681878_14","volume-title":"Theory of Cryptography","author":"C. Dwork","year":"2006","unstructured":"Dwork, C., McSherry, F., Nissim, K., Smith, A.: Calibrating noise to sensitivity in private data analysis. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol.\u00a03876, pp. 265\u2013284. Springer, Heidelberg (2006)"},{"key":"26_CR8","first-page":"381","volume-title":"STOC","author":"C. Dwork","year":"2009","unstructured":"Dwork, C., Naor, M., Reingold, O., Rothblum, G., Vadhan, S.: On the complexity of differentially private data release. In: STOC, pp. 381\u2013390. ACM, New York (2009)"},{"issue":"3","key":"26_CR9","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/0890-5401(89)90002-3","volume":"82","author":"A. Ehrenfeucht","year":"1989","unstructured":"Ehrenfeucht, A., Haussler, D., Kearns, M.J., Valiant, L.G.: A general lower bound on the number of examples needed for learning. Inf. Comput.\u00a082(3), 247\u2013261 (1989)","journal-title":"Inf. Comput."},{"key":"26_CR10","first-page":"531","volume-title":"FOCS","author":"S.P. Kasiviswanathan","year":"2008","unstructured":"Kasiviswanathan, S.P., Lee, H.K., Nissim, K., Raskhodnikova, S., Smith, A.: What can we learn privately? In: FOCS, pp. 531\u2013540. IEEE Computer Society, Los Alamitos (2008)"},{"key":"26_CR11","unstructured":"Kasiviswanathan, S.P., Smith, A.: A note on differential privacy: Defining resistance to arbitrary side information. CoRR, arXiv:0803.39461 [cs.CR] (2008)"},{"issue":"6","key":"26_CR12","doi-asserted-by":"publisher","first-page":"983","DOI":"10.1145\/293347.293351","volume":"45","author":"M.J. Kearns","year":"1998","unstructured":"Kearns, M.J.: Efficient noise-tolerant learning from statistical queries. Journal of the ACM\u00a045(6), 983\u20131006 (1998); Preliminary version in Proceedings of STOC 1993","journal-title":"Journal of the ACM"},{"key":"26_CR13","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/3897.001.0001","volume-title":"An Introduction to Computational Learning Theory","author":"M.J. Kearns","year":"1994","unstructured":"Kearns, M.J., Vazirani, U.V.: An Introduction to Computational Learning Theory. MIT Press, Cambridge (1994)"},{"key":"26_CR14","first-page":"94","volume-title":"FOCS","author":"F. McSherry","year":"2007","unstructured":"McSherry, F., Talwar, K.: Mechanism design via differential privacy. In: FOCS, pp. 94\u2013103. IEEE, Los Alamitos (2007)"},{"key":"26_CR15","first-page":"143","volume-title":"PODS","author":"N. Mishra","year":"2006","unstructured":"Mishra, N., Sandler, M.: Privacy via pseudorandom sketches. In: PODS, pp. 143\u2013152. ACM, New York (2006)"},{"issue":"4","key":"26_CR16","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1145\/48014.63140","volume":"35","author":"L. Pitt","year":"1988","unstructured":"Pitt, L., Valiant, L.G.: Computational limitations on learning from examples. Journal of the ACM\u00a035(4), 965\u2013984 (1988)","journal-title":"Journal of the ACM"},{"key":"26_CR17","doi-asserted-by":"publisher","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"L.G. Valiant","year":"1984","unstructured":"Valiant, L.G.: A theory of the learnable. Communications of the ACM\u00a027, 1134\u20131142 (1984)","journal-title":"Communications of the ACM"},{"key":"26_CR18","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1137\/1116025","volume":"16","author":"V.N. Vapnik","year":"1971","unstructured":"Vapnik, V.N., Chervonenkis, A.Y.: On the uniform convergence of relative frequencies of events to their probabilities. Theory of Probability and its Applications\u00a016, 264 (1971)","journal-title":"Theory of Probability and its Applications"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11799-2_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,25]],"date-time":"2019-05-25T10:29:11Z","timestamp":1558780151000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11799-2_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642117985","9783642117992"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11799-2_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}