{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:30:12Z","timestamp":1750307412277,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,6,7]],"date-time":"2010-06-07T00:00:00Z","timestamp":1275868800000},"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":[[2010,6,7]]},"DOI":"10.1145\/1807342.1807369","type":"proceedings-article","created":{"date-parts":[[2010,6,8]],"date-time":"2010-06-08T12:37:34Z","timestamp":1276000654000},"page":"167-178","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":23,"title":["Approximate privacy"],"prefix":"10.1145","author":[{"given":"Joan","family":"Feigenbaum","sequence":"first","affiliation":[{"name":"Yale University, New Haven, CT, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aaron D.","family":"Jaggard","sequence":"additional","affiliation":[{"name":"Rutgers University, Piscataway, NJ, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Schapira","sequence":"additional","affiliation":[{"name":"Yale University, New Haven, CT, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2010,6,7]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1386790.1386807"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.265501"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132533"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/645413.652183"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1330332.1330338"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/0404004"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/11787006_1"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1159892.1159900"},{"key":"e_1_3_2_1_9_1","volume-title":"Approximate privacy: Foundations and quantification. DIMACS technical report 2009-14 and arXiv:0910.5714","author":"Feigenbaum Joan","year":"2009","unstructured":"Joan Feigenbaum , Aaron D. Jaggard , and Michael Schapira . Approximate privacy: Foundations and quantification. DIMACS technical report 2009-14 and arXiv:0910.5714 , 2009 . Joan Feigenbaum, Aaron D. Jaggard, and Michael Schapira. Approximate privacy: Foundations and quantification. DIMACS technical report 2009-14 and arXiv:0910.5714, 2009."},{"key":"e_1_3_2_1_10_1","volume-title":"Approximate privacy: PARs for set problems. DIMACS technical report 2010-01 and arXiv:1001.3388","author":"Feigenbaum Joan","year":"2010","unstructured":"Joan Feigenbaum , Aaron D. Jaggard , and Michael Schapira . Approximate privacy: PARs for set problems. DIMACS technical report 2010-01 and arXiv:1001.3388 , 2010 . Joan Feigenbaum, Aaron D. Jaggard, and Michael Schapira. Approximate privacy: PARs for set problems. DIMACS technical report 2010-01 and arXiv:1001.3388, 2010."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536464"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2005.07.011"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00199-005-0032-z"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380850"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/0405021"},{"key":"e_1_3_2_1_16_1","volume-title":"Communication Complexity","author":"Kushilevitz Eyal","year":"1997","unstructured":"Eyal Kushilevitz and Noam Nisan . Communication Complexity . Cambridge University Press , 1997 . Eyal Kushilevitz and Noam Nisan. Communication Complexity. Cambridge University Press, 1997."},{"key":"e_1_3_2_1_17_1","volume-title":"Challenges in Designing Ad Exchanges. Talk at the NSF Workshop on Research Issues at the Interface of Computer Science and Economics","author":"Muthukrishnan S.","year":"2009","unstructured":"S. Muthukrishnan . Challenges in Designing Ad Exchanges. Talk at the NSF Workshop on Research Issues at the Interface of Computer Science and Economics , Cornell University , September 2009 . S. Muthukrishnan. Challenges in Designing Ad Exchanges. Talk at the NSF Workshop on Research Issues at the Interface of Computer Science and Economics, Cornell University, September 2009."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/336992.337028"},{"key":"e_1_3_2_1_19_1","volume-title":"Noam Nisan, Tim Roughgarden, \u00c9va Tardos, and Vijay V","author":"Nisan Noam","year":"2007","unstructured":"Noam Nisan . Introduction to mechanism design (for computer scientists) . In Noam Nisan, Tim Roughgarden, \u00c9va Tardos, and Vijay V . Vazirani, editors, Algorithmic Game Theory, chapter 9. Cambridge University Press , 2007 . Noam Nisan. Introduction to mechanism design (for computer scientists). In Noam Nisan, Tim Roughgarden, \u00c9va Tardos, and Vijay V. Vazirani, editors, Algorithmic Game Theory, chapter 9. Cambridge University Press, 2007."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1540-6261.1961.tb02789.x"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/800135.804414"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/1382436.1382751"}],"event":{"name":"EC '10: ACM Conference on Electronic Commerce","sponsor":["SIGecom Special Interest Group on Economics and Computation"],"location":"Cambridge Massachusetts USA","acronym":"EC '10"},"container-title":["Proceedings of the 11th ACM conference on Electronic commerce"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1807342.1807369","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1807342.1807369","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:39:34Z","timestamp":1750246774000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1807342.1807369"}},"subtitle":["foundations and quantification (extended abstract)"],"short-title":[],"issued":{"date-parts":[[2010,6,7]]},"references-count":22,"alternative-id":["10.1145\/1807342.1807369","10.1145\/1807342"],"URL":"https:\/\/doi.org\/10.1145\/1807342.1807369","relation":{},"subject":[],"published":{"date-parts":[[2010,6,7]]},"assertion":[{"value":"2010-06-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}