{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:14:33Z","timestamp":1763468073431,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":34,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,5,19]],"date-time":"2012-05-19T00:00:00Z","timestamp":1337385600000},"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":[[2012,5,19]]},"DOI":"10.1145\/2213977.2214089","type":"proceedings-article","created":{"date-parts":[[2012,5,21]],"date-time":"2012-05-21T15:20:35Z","timestamp":1337613635000},"page":"1269-1284","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":20,"title":["Unconditional differentially private mechanisms for linear queries"],"prefix":"10.1145","author":[{"given":"Aditya","family":"Bhaskara","sequence":"first","affiliation":[{"name":"Princeton University, Princeton, NJ, USA"}]},{"given":"Daniel","family":"Dadush","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology, Atlanta, GA, USA"}]},{"given":"Ravishankar","family":"Krishnaswamy","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}]},{"given":"Kunal","family":"Talwar","sequence":"additional","affiliation":[{"name":"Microsoft Research SVC, Mountain View, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2012,5,19]]},"reference":[{"key":"e_1_3_2_2_1_1","first-page":"69","article-title":"Logarithmically concave functions and sections of convex sets","volume":"1988","author":"Ball Keith M.","journal-title":"Rn. Studia Mathematica"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1265530.1265569"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374464"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.13"},{"key":"e_1_3_2_2_5_1","unstructured":"Anindya De. Lower bounds in differential privacy. CoRR abs\/1107.2183 2011.  Anindya De. Lower bounds in differential privacy. CoRR abs\/1107.2183 2011."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/102782.102783"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01160335"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/11681878_14"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250804"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/773153.773173"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536467"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"crossref","unstructured":"Daniel Dadush Chris Peikert and Santosh Vempala. Enumerative algorithms for the shortest and closest lattice vector problems in any norm via m-ellipsoid coverings. CoRR abs\/1011.5666 2010.  Daniel Dadush Chris Peikert and Santosh Vempala. Enumerative algorithms for the shortest and closest lattice vector problems in any norm via m-ellipsoid coverings. CoRR abs\/1011.5666 2010.","DOI":"10.1109\/FOCS.2011.31"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.12"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85174-5_26"},{"key":"e_1_3_2_2_15_1","unstructured":"Apostolos Giannopoulos. Notes on isotropic convex bodies. 2003.  Apostolos Giannopoulos. Notes on isotropic convex bodies. 2003."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536464"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807085.1807105"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.85"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806786"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jfa.2004.05.003"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00039-006-0588-1"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10711-004-2462-3"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806795"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807085.1807104"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240040402"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2005.08.004"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557090"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0090049"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0090049"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2007.41"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250803"},{"key":"e_1_3_2_2_32_1","unstructured":"Vibhor Rastogi Sungho Hong and Dan Suciu. The boundary between privacy and utility in data publishing. In Christoph Koch Johannes Gehrke Minos N. Garofalakis Divesh Srivastava Karl Aberer Anand Deshpande Daniela Florescu Chee Yong Chan Venkatesh Ganti Carl-Christian Kanne Wolfgang Klas and Erich J. Neuhold editors VLDB pages 531--542. ACM 2007.   Vibhor Rastogi Sungho Hong and Dan Suciu. The boundary between privacy and utility in data publishing. In Christoph Koch Johannes Gehrke Minos N. Garofalakis Divesh Srivastava Karl Aberer Anand Deshpande Daniela Florescu Chee Yong Chan Venkatesh Ganti Carl-Christian Kanne Wolfgang Klas and Erich J. Neuhold editors VLDB pages 531--542. ACM 2007."},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806794"},{"key":"e_1_3_2_2_34_1","unstructured":"Santosh Vempala. Geometric random walks: a survey. MSRI Volume on Combinatorial and Computational Geometry 52:577--616 2005.  Santosh Vempala. Geometric random walks: a survey. MSRI Volume on Combinatorial and Computational Geometry 52:577--616 2005."}],"event":{"name":"STOC'12: Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"New York New York USA","acronym":"STOC'12"},"container-title":["Proceedings of the forty-fourth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2213977.2214089","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2213977.2214089","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:20:57Z","timestamp":1750238457000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2213977.2214089"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5,19]]},"references-count":34,"alternative-id":["10.1145\/2213977.2214089","10.1145\/2213977"],"URL":"https:\/\/doi.org\/10.1145\/2213977.2214089","relation":{},"subject":[],"published":{"date-parts":[[2012,5,19]]},"assertion":[{"value":"2012-05-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}