{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T19:15:52Z","timestamp":1776453352201,"version":"3.51.2"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662439470","type":"print"},{"value":"9783662439487","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-43948-7_51","type":"book-chapter","created":{"date-parts":[[2014,6,11]],"date-time":"2014-06-11T16:10:36Z","timestamp":1402503036000},"page":"612-624","source":"Crossref","is-referenced-by-count":16,"title":["Privately Solving Linear Programs"],"prefix":"10.1007","author":[{"given":"Justin","family":"Hsu","sequence":"first","affiliation":[]},{"given":"Aaron","family":"Roth","sequence":"additional","affiliation":[]},{"given":"Tim","family":"Roughgarden","sequence":"additional","affiliation":[]},{"given":"Jonathan","family":"Ullman","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"51_CR1","doi-asserted-by":"publisher","first-page":"121","DOI":"10.4086\/toc.2012.v008a006","volume":"8","author":"S. Arora","year":"2012","unstructured":"Arora, S., Hazan, E., Kale, S.: The multiplicative weights update method: a meta-algorithm and applications. Theory of Computing\u00a08(1), 121\u2013164 (2012)","journal-title":"Theory of Computing"},{"key":"51_CR2","doi-asserted-by":"crossref","unstructured":"Blum, A., Dwork, C., McSherry, F., Nissim, K.: Practical privacy: the sulq framework. In: ACM SIGACTSIGMODSIGART Symposium on Principles of Database Systems (PODS), Baltimore, Maryland (2005)","DOI":"10.1145\/1065167.1065184"},{"issue":"2","key":"51_CR3","doi-asserted-by":"publisher","first-page":"12","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. Journal of the ACM\u00a060(2), 12 (2013)","journal-title":"Journal of the ACM"},{"key":"51_CR4","first-page":"1","volume-title":"ACM SIGACT Symposium on Theory of Computing (STOC)","author":"M. Bun","year":"2014","unstructured":"Bun, M., Ullman, J., Vadhan, S.P.: Fingerprinting codes and the price of approximate di erential privacy. In: ACM SIGACT Symposium on Theory of Computing (STOC), pp. 1\u20133. ACM, New York (2014)"},{"key":"51_CR5","first-page":"1069","volume":"12","author":"K. Chaudhuri","year":"2011","unstructured":"Chaudhuri, K., Monteleoni, C., Sarwate, A.D.: Differentially private empirical risk minimization. Journal of Machine Learning Research\u00a012, 1069\u20131109 (2011)","journal-title":"Journal of Machine Learning Research"},{"key":"51_CR6","doi-asserted-by":"crossref","unstructured":"Dinur, I., Nissim, K.: Revealing information while preserving privacy. In: ACM SIGACT SIGMOD SIGART Symposium on Principles of Database Systems (PODS), San Diego, California, pp. 202\u2013210 (2003)","DOI":"10.1145\/773153.773173"},{"key":"51_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-79228-4_1","volume-title":"Theory and Applications of Models of Computation","author":"C. Dwork","year":"2008","unstructured":"Dwork, C.: Differential privacy: A survey of results. In: Agrawal, M., Du, D.-Z., Duan, Z., Li, A. (eds.) TAMC 2008. LNCS, vol.\u00a04978, pp. 1\u201319. Springer, Heidelberg (2008)"},{"key":"51_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":"51_CR9","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: ACM SIGACT Symposium on Theory of Computing (STOC), Bethesda, Maryland, pp. 381\u2013390 (2009)","DOI":"10.1145\/1536414.1536467"},{"key":"51_CR10","doi-asserted-by":"crossref","unstructured":"Dwork, C., Rothblum, G.N., Vadhan, S.: Boosting and di erential privacy. In: IEEE Symposium on Foundations of Computer Science (FOCS), Las Vegas, Nevada, pp. 51\u201360 (2010)","DOI":"10.1109\/FOCS.2010.12"},{"key":"51_CR11","doi-asserted-by":"crossref","unstructured":"Gupta, A., Ligett, K., McSherry, F., Roth, A., Talwar, K.: Differentially private combinatorial optimization. In: ACM SIAM Symposium on Discrete Algorithms (SODA), Austin, Texas, pp. 1106\u20131125 (2010)","DOI":"10.1137\/1.9781611973075.90"},{"key":"51_CR12","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":"51_CR13","doi-asserted-by":"crossref","unstructured":"Hardt, M., Rothblum, G.N.: A multiplicative weights mechanism for privacy-preserving data analysis. In: IEEE Symposium on Foundations of Computer Science (FOCS), Las Vegas, Nevada, pp. 61\u201370 (2010)","DOI":"10.1109\/FOCS.2010.85"},{"key":"51_CR14","unstructured":"Hardt, M., Ligett, K., McSherry, F.: A simple and practical algorithm for differentially private data release. In: Conference on Neural Information Processing Systems (NIPS), Lake Tahoe, California, pp. 2348\u20132356 (2012)"},{"key":"51_CR15","first-page":"281","volume":"1","author":"M. Herbster","year":"2001","unstructured":"Herbster, M., Warmuth, M.K.: Tracking the best linear predictor. Journal of Machine Learning Research\u00a01, 281\u2013309 (2001)","journal-title":"Journal of Machine Learning Research"},{"key":"51_CR16","doi-asserted-by":"crossref","unstructured":"Hsu, J., Roth, A., Ullman, J.: Differential privacy for the analyst via private equilibrium computation. In: ACM SIGACT Symposium on Theory of Computing (STOC), Palo Alto, California, pp. 341\u2013350 (2013)","DOI":"10.1145\/2488608.2488651"},{"issue":"3","key":"51_CR17","doi-asserted-by":"publisher","first-page":"793","DOI":"10.1137\/090756090","volume":"40","author":"S.P. Kasiviswanathan","year":"2011","unstructured":"Kasiviswanathan, S.P., Lee, H.K., Nissim, K., Raskhodnikova, S., Smith, A.: What can we learn privately? SIAM Journal on Computing\u00a040(3), 793\u2013826 (2011)","journal-title":"SIAM Journal on Computing"},{"key":"51_CR18","first-page":"41","volume":"1","author":"D. Kifer","year":"2012","unstructured":"Kifer, D., Smith, A., Thakurta, A.: Private convex empirical risk minimization and high-dimensional regression. Journal of Machine Learning Research\u00a01, 41 (2012)","journal-title":"Journal of Machine Learning Research"},{"key":"51_CR19","doi-asserted-by":"crossref","unstructured":"McSherry, F., Talwar, K.: Mechanism design via differential privacy. In: IEEE Symposium on Foundations of Computer Science (FOCS), Providence, Rhode Island (2007)","DOI":"10.1109\/FOCS.2007.66"},{"key":"51_CR20","doi-asserted-by":"crossref","unstructured":"Nissim, K., Raskhodnikova, S., Smith, A.: Smooth sensitivity and sampling in private data analysis. In: ACM SIGACT Symposium on Theory of Computing (STOC), San Diego, Illinois, pp. 75\u201384 (2007)","DOI":"10.1145\/1250790.1250803"},{"issue":"2","key":"51_CR21","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1287\/moor.20.2.257","volume":"20","author":"S.A. Plotkin","year":"1995","unstructured":"Plotkin, S.A., Shmoys, D.B., Tardos, \u00c9.: Fast approximation algorithms for fractional packing and covering problems. Mathematics of Operations Research\u00a020(2), 257\u2013301 (1995)","journal-title":"Mathematics of Operations Research"},{"key":"51_CR22","doi-asserted-by":"crossref","unstructured":"Roth, A., Roughgarden, T.: Interactive privacy via the median mechanism. In: ACM SIGACT Symposium on Theory of Computing (STOC), Cambridge, Massachusetts, pp. 765\u2013774","DOI":"10.1145\/1806689.1806794"},{"key":"51_CR23","doi-asserted-by":"crossref","unstructured":"Ullman, J.: Answering n 2\u2009+\u2009o(1) counting queries with differential privacy is hard. In: ACM SIGACT Symposium on Theory of Computing (STOC), Palo Alto, California, pp. 361\u2013370 (2013)","DOI":"10.1145\/2488608.2488653"},{"key":"51_CR24","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","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-43948-7_51","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T09:31:09Z","timestamp":1746264669000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-43948-7_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662439470","9783662439487"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43948-7_51","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}