{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:16:00Z","timestamp":1763468160436},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642403279"},{"type":"electronic","value":"9783642403286"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40328-6_26","type":"book-chapter","created":{"date-parts":[[2013,8,16]],"date-time":"2013-08-16T09:17:34Z","timestamp":1376644654000},"page":"363-378","source":"Crossref","is-referenced-by-count":36,"title":["Private Learning and Sanitization: Pure vs. Approximate Differential Privacy"],"prefix":"10.1007","author":[{"given":"Amos","family":"Beimel","sequence":"first","affiliation":[]},{"given":"Kobbi","family":"Nissim","sequence":"additional","affiliation":[]},{"given":"Uri","family":"Stemmer","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"26_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/978-3-642-11799-2_26","volume-title":"Theory of Cryptography","author":"A. Beimel","year":"2010","unstructured":"Beimel, A., Kasiviswanathan, S.P., Nissim, K.: Bounds on the sample complexity for private learning and private data release. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol.\u00a05978, pp. 437\u2013454. Springer, Heidelberg (2010)"},{"doi-asserted-by":"crossref","unstructured":"Beimel, A., Nissim, K., Stemmer, U.: Characterizing the sample complexity of private learners. In: ITCS, pp. 97\u2013110 (2013)","key":"26_CR2","DOI":"10.1145\/2422436.2422450"},{"doi-asserted-by":"crossref","unstructured":"Blum, A., Dwork, C., McSherry, F., Nissim, K.: Practical privacy: The SuLQ framework. In: PODS, pp. 128\u2013138. ACM (2005)","key":"26_CR3","DOI":"10.1145\/1065167.1065184"},{"issue":"2","key":"26_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2450142.2450148","volume":"60","author":"A. Blum","year":"2013","unstructured":"Blum, A., Ligett, K., Roth, A.: A learning theory approach to noninteractive database privacy. J. ACM\u00a060(2), 12:1\u201312:25 (2013)","journal-title":"J. ACM"},{"unstructured":"Chaudhuri, K., Hsu, D.: Sample complexity bounds for differentially private learning. In: COLT, vol.\u00a019, pp. 155\u2013186 (2011)","key":"26_CR5"},{"key":"26_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/978-3-642-28914-9_18","volume-title":"Theory of Cryptography","author":"A. De","year":"2012","unstructured":"De, A.: Lower bounds in differential privacy. In: Cramer, R. (ed.) TCC 2012. LNCS, vol.\u00a07194, pp. 321\u2013338. Springer, Heidelberg (2012)"},{"key":"26_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1007\/11761679_29","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"C. Dwork","year":"2006","unstructured":"Dwork, C., Kenthapadi, K., McSherry, F., Mironov, I., Naor, M.: Our data, ourselves: Privacy via distributed noise generation. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol.\u00a04004, pp. 486\u2013503. Springer, Heidelberg (2006)"},{"key":"26_CR8","first-page":"371","volume-title":"STOC 2009","author":"C. Dwork","year":"2009","unstructured":"Dwork, C., Lei, J.: Differential privacy and robust statistics. In: STOC 2009, pp. 371\u2013380. ACM, New York (2009)"},{"key":"26_CR9","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)"},{"doi-asserted-by":"crossref","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 (2009)","key":"26_CR10","DOI":"10.1145\/1536414.1536467"},{"key":"26_CR11","first-page":"803","volume-title":"STOC","author":"A. Gupta","year":"2011","unstructured":"Gupta, A., Hardt, M., Roth, A., Ullman, J.: Privately releasing conjunctions and the statistical query barrier. In: STOC, pp. 803\u2013812. ACM, New York (2011)"},{"doi-asserted-by":"crossref","unstructured":"Hardt, M., Talwar, K.: On the geometry of differential privacy. In: STOC, pp. 705\u2013714 (2010)","key":"26_CR12","DOI":"10.1145\/1806689.1806786"},{"unstructured":"Hardt, M.A.W.: A Study of Privacy and Fairness in Sensitive Data Analysis. PhD thesis, Princeton University (2011)","key":"26_CR13"},{"doi-asserted-by":"crossref","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 (2008)","key":"26_CR14","DOI":"10.1109\/FOCS.2008.27"},{"issue":"6","key":"26_CR15","doi-asserted-by":"crossref","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"},{"doi-asserted-by":"crossref","unstructured":"McSherry, F., Talwar, K.: Mechanism design via differential privacy. In: FOCS, pp. 94\u2013103. IEEE (2007)","key":"26_CR16","DOI":"10.1109\/FOCS.2007.66"},{"key":"26_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1007\/978-3-642-15369-3_51","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"A. Roth","year":"2010","unstructured":"Roth, A.: Differential privacy and the fat-shattering dimension of linear queries. In: Serna, M., Shaltiel, R., Jansen, K., Rolim, J. (eds.) APPROX and RANDOM 2010. LNCS, vol.\u00a06302, pp. 683\u2013695. Springer, Heidelberg (2010)"},{"unstructured":"Smith, A., Thakurta, A.: Differentially private feature selection via stability arguments, and the robustness of the lasso. Manuscript (2012)","key":"26_CR18"},{"doi-asserted-by":"crossref","unstructured":"Ullman, J.: Answering n2\u2009+\u2009o(1) counting queries with differential privacy is hard. CoRR, abs\/1207.6945 (2012)","key":"26_CR19","DOI":"10.1145\/2488608.2488653"},{"key":"26_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1007\/978-3-642-19571-6_24","volume-title":"Theory of Cryptography","author":"J. Ullman","year":"2011","unstructured":"Ullman, J., Vadhan, S.: PCPs and the hardness of generating private synthetic data. In: Ishai, Y. (ed.) TCC 2011. LNCS, vol.\u00a06597, pp. 400\u2013416. Springer, Heidelberg (2011)"},{"key":"26_CR21","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"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40328-6_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T13:48:34Z","timestamp":1558014514000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40328-6_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642403279","9783642403286"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40328-6_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}