{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T21:34:55Z","timestamp":1725744895154},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642404498"},{"type":"electronic","value":"9783642404504"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40450-4_38","type":"book-chapter","created":{"date-parts":[[2013,8,15]],"date-time":"2013-08-15T23:22:47Z","timestamp":1376608967000},"page":"445-456","source":"Crossref","is-referenced-by-count":2,"title":["Nearly Optimal Private Convolution"],"prefix":"10.1007","author":[{"given":"Nadia","family":"Fawaz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Muthukrishnan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aleksandar","family":"Nikolov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"38_CR1","doi-asserted-by":"crossref","unstructured":"Barak, B., Chaudhuri, K., Dwork, C., Kale, S., McSherry, F., Talwar, K.: Privacy, accuracy, and consistency too: a holistic solution to contingency table release. In: Proceedings of the Twenty-Sixth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 273\u2013282. ACM (2007)","DOI":"10.1145\/1265530.1265569"},{"key":"38_CR2","doi-asserted-by":"publisher","first-page":"1269","DOI":"10.1145\/2213977.2214089","volume-title":"Proceedings of the 44th Symposium on Theory of Computing, STOC 2012","author":"A. Bhaskara","year":"2012","unstructured":"Bhaskara, A., Dadush, D., Krishnaswamy, R., Talwar, K.: Unconditional differentially private mechanisms for linear queries. In: Proceedings of the 44th Symposium on Theory of Computing, STOC 2012, pp. 1269\u20131284. ACM, New York (2012)"},{"key":"38_CR3","first-page":"609","volume-title":"STOC 2008: Proceedings of the 40th Annual ACM Symposium on Theory of Computing","author":"A. Blum","year":"2008","unstructured":"Blum, A., Ligett, K., Roth, A.: A learning theory approach to non-interactive database privacy. In: STOC 2008: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, pp. 609\u2013618. ACM, New York (2008)"},{"key":"38_CR4","first-page":"1108","volume":"arXiv","author":"J. Bolot","year":"2011","unstructured":"Bolot, J., Fawaz, N., Muthukrishnan, S., Nikolov, A., Taft, N.: Private decayed sum estimation under continual observation. Arxiv preprint arXiv:1108.6123 (2011)","journal-title":"Arxiv preprint"},{"key":"38_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/978-3-642-14162-1_34","volume-title":"Automata, Languages and Programming","author":"T.-H. Hubert Chan","year":"2010","unstructured":"Hubert Chan, T.-H., Shi, E., Song, D.: Private and continual release of statistics. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol.\u00a06199, pp. 405\u2013417. Springer, Heidelberg (2010)"},{"key":"38_CR6","first-page":"1304","volume":"arXiv","author":"K. Chandrasekaran","year":"2013","unstructured":"Chandrasekaran, K., Thaler, J., Ullman, J., Wan, A.: Faster private release of marginals on small databases. arXiv preprint arXiv:1304.3754 (2013)","journal-title":"arXiv preprint"},{"key":"38_CR7","doi-asserted-by":"crossref","unstructured":"Cheraghchi, M., Klivans, A., Kothari, P., Lee, H.: 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":"38_CR8","unstructured":"Cormode, G., Procopiuc, C.M., Srivastava, D., Yaroslavtsev, G.: Accurate and efficient private release of datacubes and contingency tables"},{"key":"38_CR9","doi-asserted-by":"crossref","unstructured":"Dinur, I., Nissim, K.: Revealing information while preserving privacy. In: Proceedings of the Twenty-Second ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 202\u2013210. ACM (2003)","DOI":"10.1145\/773153.773173"},{"key":"38_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/11681878_14","volume-title":"Calibrating noise to sensitivity in","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":"38_CR11","doi-asserted-by":"crossref","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 Theory of Computing, pp. 381\u2013390. ACM (2009)","DOI":"10.1145\/1536414.1536467"},{"key":"38_CR12","doi-asserted-by":"crossref","unstructured":"Dwork, C., Pitassi, T., Naor, M., Rothblum, G.: Differential privacy under continual observation. In: STOC (2010)","DOI":"10.1145\/1806689.1806787"},{"key":"38_CR13","doi-asserted-by":"crossref","unstructured":"Gen\u00e7ay, R., Sel\u00e7uk, F., Whitcher, B.: An Introduction to Wavelets and Other Filtering Methods in Finance and Economics. Elsevier Academic Press (2002)","DOI":"10.1016\/B978-012279670-8.50004-5"},{"issue":"3","key":"38_CR14","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1561\/0100000006","volume":"2","author":"R.M. Gray","year":"2006","unstructured":"Gray, R.M.: Toeplitz and circulant matrices: a review. Foundations and Trends in Communications and Information Theory\u00a02(3), 155\u2013239 (2006)","journal-title":"Foundations and Trends in Communications and Information Theory"},{"key":"38_CR15","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 Theory of Computing, pp. 803\u2013812. ACM (2011)","DOI":"10.1145\/1993636.1993742"},{"key":"38_CR16","doi-asserted-by":"crossref","unstructured":"Hardt, M., Rothblum, G.: A multiplicative weights mechanism for privacy-preserving data analysis. In: Proc. 51st Foundations of Computer Science (FOCS). IEEE (2010)","DOI":"10.1109\/FOCS.2010.85"},{"key":"38_CR17","doi-asserted-by":"crossref","unstructured":"Hardt, M., Rothblum, G., Servedio, R.: 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":"38_CR18","doi-asserted-by":"crossref","unstructured":"Hardt, M., Talwar, K.: On the geometry of differential privacy. In: Proceedings of the 42nd ACM Symposium on Theory of Computing (2010)","DOI":"10.1145\/1806689.1806786"},{"key":"38_CR19","doi-asserted-by":"crossref","unstructured":"Kasiviswanathan, S., Rudelson, M., Smith, A., Ullman, J.: The price of privately releasing contingency tables and the spectra of random matrices with correlated rows. In: Proceedings of the 42nd ACM Symposium on Theory of Computing, pp. 775\u2013784. ACM (2010)","DOI":"10.1145\/1806689.1806795"},{"key":"38_CR20","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1145\/1807085.1807104","volume-title":"Proceedings of the Twenty-Ninth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2010","author":"C. Li","year":"2010","unstructured":"Li, C., Hay, M., Rastogi, V., Miklau, G., McGregor, A.: Optimizing linear counting queries under differential privacy. In: Proceedings of the Twenty-Ninth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2010, pp. 123\u2013134. ACM, New York (2010)"},{"issue":"6","key":"38_CR21","first-page":"514","volume":"5","author":"C. Li","year":"2012","unstructured":"Li, C., Miklau, G.: An adaptive mechanism for accurate query answering under differential privacy. PVLDB\u00a05(6), 514\u2013525 (2012)","journal-title":"PVLDB"},{"key":"38_CR22","unstructured":"Li, C., Miklau, G.: Measuring the achievable error of query sets under differential privacy. CoRR abs\/1202.3399 (2012)"},{"issue":"2","key":"38_CR23","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/S0195-6698(86)80041-5","volume":"7","author":"L. Lov\u00e1sz","year":"1986","unstructured":"Lov\u00e1sz, L., Spencer, J., Vesztergombi, K.: Discrepancy of set-systems and matrices. European Journal of Combinatorics\u00a07(2), 151\u2013160 (1986)","journal-title":"European Journal of Combinatorics"},{"key":"38_CR24","doi-asserted-by":"crossref","unstructured":"Muthukrishnan, S., Nikolov, A.: Optimal private halfspace counting via discrepancy. In: Proceedings of the 44th ACM Symposium on Theory of Computing (2012)","DOI":"10.1145\/2213977.2214090"},{"key":"38_CR25","doi-asserted-by":"crossref","unstructured":"Narayanan, A., Shi, E., Rubinstein, B.: Link prediction by de-anonymization: How we won the kaggle social network challenge. In: The 2011 International Joint Conference on Neural Networks (IJCNN), pp. 1825\u20131834. IEEE (2011)","DOI":"10.1109\/IJCNN.2011.6033446"},{"key":"38_CR26","doi-asserted-by":"crossref","unstructured":"Narayanan, A., Shmatikov, V.: Robust de-anonymization of large sparse datasets. In: IEEE Symposium on Security and Privacy, SP 2008, pp. 111\u2013125. IEEE (2008)","DOI":"10.1109\/SP.2008.33"},{"key":"38_CR27","doi-asserted-by":"crossref","unstructured":"Narayanan, A., Shmatikov, V.: De-anonymizing social networks. In: 2009 30th IEEE Symposium on Security and Privacy, pp. 173\u2013187. IEEE (2009)","DOI":"10.1109\/SP.2009.22"},{"key":"38_CR28","unstructured":"Nikolov, A., Talwar, K., Zhang, L.: The geometry of differential privacy: the sparse and approximate cases"},{"key":"38_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"810","DOI":"10.1007\/978-3-642-31594-7_68","volume-title":"Automata, Languages, and Programming","author":"J. Thaler","year":"2012","unstructured":"Thaler, J., Ullman, J., Vadhan, S.: Faster algorithms for privately releasing marginals. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012, Part I. LNCS, vol.\u00a07391, pp. 810\u2013821. Springer, Heidelberg (2012)"},{"key":"38_CR30","unstructured":"Xiao, X., Wang, G., Gehrke, J.: Differential privacy via wavelet transforms"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2013"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40450-4_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T12:54:08Z","timestamp":1558011248000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40450-4_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642404498","9783642404504"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40450-4_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}