{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T13:36:55Z","timestamp":1768916215429,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2007,6,11]],"date-time":"2007-06-11T00:00:00Z","timestamp":1181520000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2007,6,11]]},"DOI":"10.1145\/1250790.1250804","type":"proceedings-article","created":{"date-parts":[[2007,9,14]],"date-time":"2007-09-14T16:07:37Z","timestamp":1189786057000},"page":"85-94","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":107,"title":["The price of privacy and the limits of LP decoding"],"prefix":"10.1145","author":[{"given":"Cynthia","family":"Dwork","sequence":"first","affiliation":[{"name":"Microsoft Research SVC, Mountain View, CA"}]},{"given":"Frank","family":"McSherry","sequence":"additional","affiliation":[{"name":"Microsoft Research SVC, Mountain View, CA"}]},{"given":"Kunal","family":"Talwar","sequence":"additional","affiliation":[{"name":"Microsoft Research SVC, Mountain View, CA"}]}],"member":"320","published-online":{"date-parts":[[2007,6,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(03)00025-4"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065167.1065184"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.5464411"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.858979"},{"key":"e_1_3_2_1_5_1","volume-title":"Error correction via linear programming","author":"Cand\u00e8s E.J.","year":"2005","unstructured":"E.J. Cand\u00e8s and T. Tao . Error correction via linear programming , 2005 . E.J. Cand\u00e8s and T. Tao. Error correction via linear programming, 2005."},{"key":"e_1_3_2_1_6_1","volume-title":"Highly robust error correction by convex programming. Submitted","author":"Cand\u00e8s E.J.","year":"2006","unstructured":"E.J. Cand\u00e8s and PRandall. Highly robust error correction by convex programming. Submitted , 2006 . E.J. Cand\u00e8s and PRandall. Highly robust error correction by convex programming. Submitted, 2006."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827596304010"},{"key":"e_1_3_2_1_8_1","volume-title":"Privacy in public databases: A foundational approach","author":"Dinur I.","year":"2005","unstructured":"I. Dinur , C. Dwork , and K. Nissim . Privacy in public databases: A foundational approach , 2005 . Manuscript . I. Dinur, C. Dwork, and K. Nissim. Privacy in public databases: A foundational approach, 2005. Manuscript."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/773153.773173"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.20131"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.20132"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-005-1220-0"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.959265"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1024691081"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2006.286462"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.871582"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/11681878_14"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"C.\n      Dwork\n     and \n      K.\n      Nissim\n  . \n  Privacy-preserving datamining on vertically partitioned databases\n  . In M.K. Franklin editor CRYPTO volume \n  3152\n   of \n  Lecture Notes in Computer Science pages \n  528\n  --\n  544\n  . \n  Springer 2004\n  .  C. Dwork and K. Nissim. Privacy-preserving datamining on vertically partitioned databases. In M.K. Franklin editor CRYPTO volume 3152 of Lecture Notes in Computer Science pages 528--544. Springer 2004.","DOI":"10.1007\/978-3-540-28628-8_32"},{"key":"e_1_3_2_1_19_1","volume-title":"Decoding error-correcting codes via linear programming. Master's thesis","author":"Feldman J.","year":"2003","unstructured":"J. Feldman . Decoding error-correcting codes via linear programming. Master's thesis , Massachusetts Institute of Technology , 2003 . J. Feldman. Decoding error-correcting codes via linear programming. Master's thesis, Massachusetts Institute of Technology, 2003."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2003.11.005"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.887523"},{"key":"e_1_3_2_1_22_1","first-page":"460","volume-title":"SODA","author":"Feldman J.","year":"2005","unstructured":"J. Feldman and C. Stein . LP decoding achieves capacity . In SODA , pages 460 -- 469 . SIAM , 2005 . J. Feldman and C. Stein. LP decoding achieves capacity. In SODA, pages 460--469. SIAM, 2005."},{"key":"e_1_3_2_1_23_1","volume-title":"Annals of Probability","author":"Goldstein L.","year":"2006","unstructured":"L. Goldstein . l1 bounds in normal approximation . Annals of Probability , 2006 . To Appear. L. Goldstein. l1 bounds in normal approximation. Annals of Probability, 2006. To Appear."},{"key":"e_1_3_2_1_24_1","series-title":"Mathematical Surveys and Monographs","volume-title":"The Concentration of Measure Phenomenon","author":"Ledoux M.","year":"2001","unstructured":"M. Ledoux . The Concentration of Measure Phenomenon , volume 89 of Mathematical Surveys and Monographs . American Mathematical Society , 2001 . M. Ledoux. The Concentration of Measure Phenomenon, volume 89 of Mathematical Surveys and Monographs. American Mathematical Society, 2001."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02699376"}],"event":{"name":"STOC07: Symposium on Theory of Computing","location":"San Diego California USA","acronym":"STOC07","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the thirty-ninth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1250790.1250804","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1250790.1250804","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:52:20Z","timestamp":1750258340000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1250790.1250804"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,6,11]]},"references-count":25,"alternative-id":["10.1145\/1250790.1250804","10.1145\/1250790"],"URL":"https:\/\/doi.org\/10.1145\/1250790.1250804","relation":{},"subject":[],"published":{"date-parts":[[2007,6,11]]},"assertion":[{"value":"2007-06-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}