{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T23:14:19Z","timestamp":1763507659445},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642289132"},{"type":"electronic","value":"9783642289149"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-28914-9_19","type":"book-chapter","created":{"date-parts":[[2012,3,5]],"date-time":"2012-03-05T16:12:39Z","timestamp":1330963959000},"page":"339-356","source":"Crossref","is-referenced-by-count":84,"title":["Iterative Constructions and Private Data Release"],"prefix":"10.1007","author":[{"given":"Anupam","family":"Gupta","sequence":"first","affiliation":[]},{"given":"Aaron","family":"Roth","sequence":"additional","affiliation":[]},{"given":"Jonathan","family":"Ullman","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"19_CR1","doi-asserted-by":"publisher","first-page":"787","DOI":"10.1137\/S0097539704441629","volume":"35","author":"N. Alon","year":"2006","unstructured":"Alon, N., Naor, A.: Approximating the cut-norm via Grothendieck\u2019s inequality. SIAM J. Comput.\u00a035(4), 787\u2013803 (2006) (electronic)","journal-title":"SIAM J. Comput."},{"key":"19_CR2","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: PODS, pp. 273\u2013282 (2007)","DOI":"10.1145\/1265530.1265569"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Bhaskara, A., Krishnaswamy, R., Talwar, K.: Unconditional differentially private mechanisms for linear queries (2011) (manuscript)","DOI":"10.1145\/2213977.2214089"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Blum, A., Dwork, C., McSherry, F., Nissim, K.: Practical privacy: the SuLQ framework. In: PODS, pp. 128\u2013138 (2005)","DOI":"10.1145\/1065167.1065184"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Blum, A., Ligett, K., Roth, A.: A learning theory approach to non-interactive database privacy. In: STOC, pp. 609\u2013618 (2008)","DOI":"10.1145\/1374376.1374464"},{"key":"19_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/978-3-540-30576-7_20","volume-title":"Theory of Cryptography","author":"S. Chawla","year":"2005","unstructured":"Chawla, S., Dwork, C., McSherry, F., Smith, A., Wee, H.: Toward Privacy in Public Databases. In: Kilian, J. (ed.) TCC 2005. LNCS, vol.\u00a03378, pp. 363\u2013385. Springer, Heidelberg (2005)"},{"key":"19_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":"19_CR8","doi-asserted-by":"crossref","unstructured":"Dwork, C., Naor, M., Reingold, O., Rothblum, G., Vadhan, S.: On the complexity of differentially private data release: efficient algorithms and hardness results. In: STOC, pp. 381\u2013390 (2009)","DOI":"10.1145\/1536414.1536467"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Dwork, C., Rothblum, G., Vadhan, S.: Boosting and differential privacy. In: FOCS, pp. 51\u201360 (2010)","DOI":"10.1109\/FOCS.2010.12"},{"issue":"2","key":"19_CR10","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/s004930050052","volume":"19","author":"A. Frieze","year":"1999","unstructured":"Frieze, A., Kannan, R.: Quick approximation to matrices and applications. Combinatorica\u00a019(2), 175\u2013220 (1999)","journal-title":"Combinatorica"},{"key":"19_CR11","first-page":"7","volume":"17","author":"A. Frieze","year":"1999","unstructured":"Frieze, A., Kannan, R.: A simple algorithm for constructing Szemer\u00e9di\u2019s regularity partition. Electron. J. Combin.\u00a06, Research Paper 17, 7 (1999)","journal-title":"Electron. J. Combin. 6, Research Paper"},{"key":"19_CR12","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. ACM, New York (2011)"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"Gupta, A., Roth, A., Ullman, J.: Iterative constructions and private data release, Arxiv preprint arXiv:1107.3731 (2011)","DOI":"10.1007\/978-3-642-28914-9_19"},{"key":"19_CR14","unstructured":"Hardt, M., Ligett, K., McSherry, F.: A simple and practical algorithm for differentially private data release, Arxiv preprint arXiv:1012.4763 (2011)"},{"key":"19_CR15","doi-asserted-by":"crossref","unstructured":"Hardt, M., Rothblum, G.: A multiplicative weights mechanism for privacy-preserving data analysis. In: FOCS, pp. 61\u201370 (2010)","DOI":"10.1109\/FOCS.2010.85"},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"Hardt, M., Talwar, K.: On the Geometry of Differential Privacy. In: STOC (2010)","DOI":"10.1145\/1806689.1806786"},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"Kasiviswanathan, S., Lee, H., Nissim, K., Raskhodnikova, S., Smith, A.: What Can We Learn Privately? In: FOCS, pp. 531\u2013540 (2008)","DOI":"10.1109\/FOCS.2008.27"},{"key":"19_CR18","doi-asserted-by":"crossref","unstructured":"McSherry, F., Talwar, K.: Mechanism design via differential privacy. In: FOCS (2007)","DOI":"10.1109\/FOCS.2007.4389483"},{"key":"19_CR19","doi-asserted-by":"crossref","unstructured":"Roth, A., Roughgarden, T.: Interactive Privacy via the Median Mechanism. In: STOC (2010)","DOI":"10.1145\/1806689.1806794"},{"key":"19_CR20","doi-asserted-by":"crossref","unstructured":"Trevisan, L., Tulsiani, M., Vadhan, S.P.: Regularity, boosting, and efficiently simulating every high-entropy distribution. In: CCC (2009)","DOI":"10.1109\/CCC.2009.41"},{"key":"19_CR21","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","Theory of Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-28914-9_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T20:50:47Z","timestamp":1558299047000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-28914-9_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642289132","9783642289149"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-28914-9_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}