{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:24:01Z","timestamp":1726410241411},"publisher-location":"Berlin, Heidelberg","reference-count":19,"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_28","type":"book-chapter","created":{"date-parts":[[2013,8,16]],"date-time":"2013-08-16T09:17:34Z","timestamp":1376644654000},"page":"395-410","source":"Crossref","is-referenced-by-count":0,"title":["Fast Private Data Release Algorithms for Sparse Queries"],"prefix":"10.1007","author":[{"given":"Avrim","family":"Blum","sequence":"first","affiliation":[]},{"given":"Aaron","family":"Roth","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"Achlioptas, D.: Database-friendly random projections. In: Proceedings of the Twentieth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, p. 281. ACM (2001)","DOI":"10.1145\/375551.375608"},{"issue":"1","key":"28_CR2","first-page":"32","volume":"50","author":"A. Blum","year":"1995","unstructured":"Blum, A., Hellerstein, L., Littlestone, N.: Learning in the presence of finitely or infinitely many irrelevant attributes. JCSS\u00a050(1), 32\u201340 (1995)","journal-title":"JCSS"},{"key":"28_CR3","doi-asserted-by":"crossref","unstructured":"Blum, A., Ligett, K., Roth, A.: A learning theory approach to non-interactive database privacy. In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, pp. 609\u2013618. ACM (2008)","DOI":"10.1145\/1374376.1374464"},{"key":"28_CR4","doi-asserted-by":"crossref","unstructured":"Blum, A.: Learning boolean functions in an infinite attribute space. In: Proceedings of the Twenty-second Annual ACM Symposium on Theory of Computing, pp. 64\u201372. ACM (1990)","DOI":"10.1145\/100216.100224"},{"key":"28_CR5","unstructured":"Blum, A., Roth, A.: Fast private data release algorithms for sparse queries. arXiv preprint arXiv:1111.6842 (2011)"},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"Cheraghchi, M., Klivans, A., Kothari, P., Lee, H.K.: Submodular functions are noise stable. In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1586\u20131592. SIAM (2012)","DOI":"10.1137\/1.9781611973099.126"},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"Clarkson, K.L., Woodruff, D.P.: Numerical linear algebra in the streaming model. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, pp. 205\u2013214. ACM (2009)","DOI":"10.1145\/1536414.1536445"},{"key":"28_CR8","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":"28_CR9","unstructured":"Dwork, C., Naor, M., Pitassi, T., Rothblum, G.N., Yekhanin, S.: Pan-private streaming algorithms. In: Proceedings of ICS (2010)"},{"key":"28_CR10","first-page":"381","volume-title":"Proceedings of the 41st Annual ACM Symposium on the Theory of Computing","author":"C. Dwork","year":"2009","unstructured":"Dwork, C., Naor, M., Reingold, O., Rothblum, G.N., Vadhan, S.: On the complexity of differentially private data release: efficient algorithms and hardness results. In: Proceedings of the 41st Annual ACM Symposium on the Theory of Computing, pp. 381\u2013390. ACM, New York (2009)"},{"key":"28_CR11","doi-asserted-by":"crossref","unstructured":"Dwork, C., Rothblum, G.N., Vadhan, S.: Boosting and differential privacy. In: Proceedings of the 51st Annual IEEE Symposium on Foundations of Computer Science, pp. 51\u201360. IEEE (2010)","DOI":"10.1109\/FOCS.2010.12"},{"key":"28_CR12","doi-asserted-by":"crossref","unstructured":"Gupta, A., Hardt, M., Roth, A., Ullman, J.: Privately Releasing Conjunctions and the Statistical Query Barrier. In: Proceedings of the 43rd Annual ACM Symposium on the Theory of Computing. ACM, New York (2011)","DOI":"10.1145\/1993636.1993742"},{"key":"28_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/978-3-642-28914-9_19","volume-title":"Theory of Cryptography","author":"A. Gupta","year":"2012","unstructured":"Gupta, A., Roth, A., Ullman, J.: Iterative constructions and private data release. In: Cramer, R. (ed.) TCC 2012. LNCS, vol.\u00a07194, pp. 339\u2013356. Springer, Heidelberg (2012)"},{"key":"28_CR14","doi-asserted-by":"crossref","unstructured":"Hardt, M., Rothblum, G.N.: A multiplicative weights mechanism for privacy-preserving data analysis. In: 51st Annual IEEE Symposium on Foundations of Computer Science, pp. 61\u201370. IEEE (2010)","DOI":"10.1109\/FOCS.2010.85"},{"key":"28_CR15","doi-asserted-by":"crossref","unstructured":"Hardt, M., Rothblum, G.N., Servedio, R.A.: Private data release via learning thresholds. In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 168\u2013187. SIAM (2012)","DOI":"10.1137\/1.9781611973099.15"},{"key":"28_CR16","doi-asserted-by":"crossref","unstructured":"Hardt, M., Talwar, K.: On the Geometry of Differential Privacy. In: The 42nd ACM Symposium on the Theory of Computing, STOC 2010 (2010)","DOI":"10.1145\/1806689.1806786"},{"key":"28_CR17","first-page":"1006","volume":"arXiv","author":"D.M. Kane","year":"2010","unstructured":"Kane, D.M., Nelson, J.: A derandomized sparse johnson-lindenstrauss transform. arXiv preprint arXiv:1006.3585 (2010)","journal-title":"arXiv preprint"},{"key":"28_CR18","doi-asserted-by":"crossref","unstructured":"Roth, A., Roughgarden, T.: Interactive Privacy via the Median Mechanism. In: The 42nd ACM Symposium on the Theory of Computing, STOC 2010 (2010)","DOI":"10.1145\/1806689.1806794"},{"key":"28_CR19","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)"}],"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_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T13:45:07Z","timestamp":1558014307000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40328-6_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642403279","9783642403286"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40328-6_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}