{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:14:27Z","timestamp":1763468067736},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642325113"},{"type":"electronic","value":"9783642325120"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32512-0_49","type":"book-chapter","created":{"date-parts":[[2012,7,20]],"date-time":"2012-07-20T22:21:08Z","timestamp":1342822868000},"page":"579-590","source":"Crossref","is-referenced-by-count":4,"title":["Mirror Descent Based Database Privacy"],"prefix":"10.1007","author":[{"given":"Prateek","family":"Jain","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abhradeep","family":"Thakurta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"49_CR1","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/S0167-6377(02)00231-6","volume":"31","author":"A. Beck","year":"2003","unstructured":"Beck, A., Teboulle, M.: Mirror descent and nonlinear projected subgradient methods for convex optimization. Oper. Res. Lett.\u00a031(3), 167\u2013175 (2003)","journal-title":"Oper. Res. Lett."},{"key":"49_CR2","doi-asserted-by":"crossref","unstructured":"Blum, A., Ligett, K., Roth, A.: A learning theory approach to non-interactive database privacy. In: STOC (2008)","DOI":"10.1145\/1374376.1374464"},{"key":"49_CR3","doi-asserted-by":"crossref","unstructured":"Candes, E.J., Tao, T.: Near-optimal signal recovery from random projections: universal encoding strategies? IEEE Transactions on Information Theory (2006)","DOI":"10.1109\/TIT.2006.885507"},{"key":"49_CR4","unstructured":"Dinur, I., Dwork, C., Nissim, K.: Revealing information while preserving privacy, full version of [5] (2010) (in preparation)"},{"key":"49_CR5","doi-asserted-by":"crossref","unstructured":"Dinur, I., Nissim, K.: Revealing information while preserving privacy. In: PODS, pp. 202\u2013210. ACM (2003)","DOI":"10.1145\/773153.773173"},{"key":"49_CR6","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":"49_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":"49_CR8","doi-asserted-by":"crossref","unstructured":"Dwork, C., McSherry, F., Talwar, K.: The price of privacy and the limits of LP decoding. In: STOC, pp. 85\u201394. ACM (2007)","DOI":"10.1145\/1250790.1250804"},{"key":"49_CR9","doi-asserted-by":"crossref","unstructured":"Dwork, C., Rothblum, G.N., Vadhan, S.P.: Boosting and differential privacy. In: FOCS (2010)","DOI":"10.1109\/FOCS.2010.12"},{"key":"49_CR10","doi-asserted-by":"crossref","unstructured":"Frieze, A.M., Kannan, R.: A simple algorithm for constructing szemere\u2019di\u2019s regularity partition. Electr. J. Comb. (1999)","DOI":"10.37236\/1449"},{"key":"49_CR11","doi-asserted-by":"crossref","unstructured":"Ganta, S.R., Kasiviswanathan, S.P., Smith, A.: Composition attacks and auxiliary information in data privacy. In: KDD 2008: Proceeding of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 265\u2013273. ACM (2008)","DOI":"10.1145\/1401890.1401926"},{"key":"49_CR12","doi-asserted-by":"crossref","unstructured":"Gupta, A., Hardt, M., Roth, A., Ullman, J.: Privately releasing conjunctions and the statistical query barrier. In: STOC (2011)","DOI":"10.1145\/1993636.1993742"},{"key":"49_CR13","unstructured":"Gupta, A., Roth, A., Ullman, J.: Iterative constructions and private data release. CoRR, abs\/1107.3731 (2011)"},{"key":"49_CR14","unstructured":"Hardt, M., Ligett, K., McSherry, F.: A simple and practical algorithm for differentially private data release. CoRR, abs\/1012.4763 (2010)"},{"key":"49_CR15","doi-asserted-by":"crossref","unstructured":"Hardt, M., Rothblum, G.N.: A multiplicative weights mechanism for privacy-preserving data analysis. In: FOCS (2010)","DOI":"10.1109\/FOCS.2010.85"},{"key":"49_CR16","doi-asserted-by":"crossref","unstructured":"Jain, P., Thakurta, A.: Mirror descent based database privacy. Technical Report NAS-TR-0159-2012, Pennsylvania State University (April 2012)","DOI":"10.1007\/978-3-642-32512-0_49"},{"key":"49_CR17","unstructured":"Kakade, S.M., Shalev-Shwartz, S., Tewari, A.: On the duality of strong convexity and strong smoothness: Learning applications and matrix regularization. Informal Publication (2009)"},{"key":"49_CR18","doi-asserted-by":"crossref","unstructured":"Kasiviswanathan, S.P., Lee, H.K., Nissim, K., Raskhodnikova, S., Smith, A.: What can we learn privately? In: FOCS (2008)","DOI":"10.1109\/FOCS.2008.27"},{"key":"49_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":"49_CR20","unstructured":"Srebro, N., Sridharan, K., Tewari, A.: On the universality of online mirror descent. CoRR, abs\/1107.4080 (2011)"},{"key":"49_CR21","unstructured":"Vershynin, R.: Introduction to the non-asymptotic analysis of random matrices. CoRR, abs\/1011.3027 (2010)"},{"key":"49_CR22","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1111\/j.1467-9868.2005.00532.x","volume":"68","author":"M. Yuan","year":"2007","unstructured":"Yuan, M., Lin, Y.: Model selection and estimation in regression with grouped variables. Journal of the Royal Statistical Society, Series B\u00a068, 49\u201367 (2007)","journal-title":"Journal of the Royal Statistical Society, Series B"}],"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-32512-0_49.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T12:05:38Z","timestamp":1620129938000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32512-0_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642325113","9783642325120"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32512-0_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}