{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:15:53Z","timestamp":1763468153343,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,6,16]],"date-time":"2013-06-16T00:00:00Z","timestamp":1371340800000},"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":[[2013,6,16]]},"DOI":"10.1145\/2492002.2482549","type":"proceedings-article","created":{"date-parts":[[2013,6,11]],"date-time":"2013-06-11T16:03:50Z","timestamp":1370966630000},"page":"215-232","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":34,"title":["Truthful mechanisms for agents that value privacy"],"prefix":"10.1145","author":[{"given":"Yiling","family":"Chen","sequence":"first","affiliation":[{"name":"Harvard University, Cambridge, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephen","family":"Chong","sequence":"additional","affiliation":[{"name":"Harvard University, Cambridge, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ian A.","family":"Kash","sequence":"additional","affiliation":[{"name":"Microsoft Research Cambridge, Cambridge, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tal","family":"Moran","sequence":"additional","affiliation":[{"name":"IDC Herzliya, Herzliya, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Salil","family":"Vadhan","sequence":"additional","affiliation":[{"name":"Harvard University, Cambridge, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,6,16]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065167.1065184"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Cover T. M. and Thomas J. A. 1991. Elements of Information Theory 2nd Ed. Wiley Series in Telecommunications. John Wiley & Sons Inc.  Cover T. M. and Thomas J. A. 1991. Elements of Information Theory 2nd Ed. Wiley Series in Telecommunications. John Wiley & Sons Inc.","DOI":"10.1002\/0471200611"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/773153.773173"},{"key":"e_1_3_2_1_4_1","volume-title":"Ed. LNCS Series","volume":"1880","author":"Dodis Y.","unstructured":"Dodis , Y. , Halevi , S. , and Rabin , T . 2000. A cryptographic solution to a game theoretic problem. In CRYPTO, M. Bellare , Ed. LNCS Series , vol. 1880 . Springer, 112--130. Dodis, Y., Halevi, S., and Rabin, T. 2000. A cryptographic solution to a game theoretic problem. In CRYPTO, M. Bellare, Ed. LNCS Series, vol. 1880. Springer, 112--130."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/11681878_14"},{"key":"e_1_3_2_1_6_1","volume-title":"Ed. LNCS Series","volume":"3152","author":"Dwork C.","unstructured":"Dwork , C. and Nissim , K . 2004. Privacy-preserving datamining on vertically partitioned databases. In CRYPTO, M. K. Franklin , Ed. LNCS Series , vol. 3152 . Springer, 528--544. Dwork, C. and Nissim, K. 2004. Privacy-preserving datamining on vertically partitioned databases. In CRYPTO, M. K. Franklin, Ed. LNCS Series, vol. 3152. Springer, 528--544."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.12"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807342.1807369"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993574.1993605"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2012.36"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.64"},{"key":"e_1_3_2_1_12_1","unstructured":"Kasiviswanathan S. P. and Smith A. 2008. A note on differential privacy: Defining resistance to arbitrary side information. CoRR abs\/0803.3946.  Kasiviswanathan S. P. and Smith A. 2008. A note on differential privacy: Defining resistance to arbitrary side information. CoRR abs\/0803.3946."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2007.41"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/336992.337028"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2229012.2229073"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090254"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.elerap.2008.04.006"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2422436.2422448"}],"event":{"name":"EC '13: ACM Conference on Electronic Commerce","sponsor":["SIGecom Special Interest Group on Economics and Computation"],"location":"Philadelphia Pennsylvania USA","acronym":"EC '13"},"container-title":["Proceedings of the fourteenth ACM conference on Electronic commerce"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2492002.2482549","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2492002.2482549","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:39:10Z","timestamp":1750235950000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2492002.2482549"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6,16]]},"references-count":18,"alternative-id":["10.1145\/2492002.2482549","10.1145\/2492002"],"URL":"https:\/\/doi.org\/10.1145\/2492002.2482549","relation":{},"subject":[],"published":{"date-parts":[[2013,6,16]]},"assertion":[{"value":"2013-06-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}