{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T10:05:42Z","timestamp":1730196342056,"version":"3.28.0"},"reference-count":25,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,10]]},"DOI":"10.1109\/allerton.2012.6483317","type":"proceedings-article","created":{"date-parts":[[2013,3,27]],"date-time":"2013-03-27T20:58:45Z","timestamp":1364417925000},"page":"920-927","source":"Crossref","is-referenced-by-count":9,"title":["The price of privacy in untrusted recommendation engines"],"prefix":"10.1109","author":[{"given":"Siddhartha","family":"Banerjee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nidhi","family":"Hegde","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laurent","family":"Massoulie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536466"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-23082-0_8"},{"key":"18","first-page":"437","article-title":"Bounds on the sample complexity for private learning and private data release","author":"beimel","year":"2010","journal-title":"TCC 2010"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2012.6483317"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.14"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993743"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1965.10480775"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.27"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557090"},{"key":"21","first-page":"2057","article-title":"Matrix completion from noisy entries","volume":"11","author":"keshavan","year":"2010","journal-title":"Journal of Machine Learning Research"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2032816"},{"journal-title":"Distributed User Profiling Via Spectral Methods","year":"2011","author":"tomozei","key":"22"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(83)90021-7"},{"key":"24","article-title":"Information-theoretic limits of selecting binary graphical models in high dimensions","author":"santhanam","year":"2009","journal-title":"CoRR"},{"journal-title":"Elements of Information Theory","year":"2006","author":"cover","key":"25"},{"key":"3","first-page":"1","article-title":"Differential privacy","volume":"4052","author":"dwork","year":"2006","journal-title":"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2011.40"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993742"},{"key":"1","article-title":"How to break anonymity of the netflix prize dataset","author":"narayanan","year":"2006","journal-title":"CoRR"},{"key":"7","first-page":"66","article-title":"Pan-private streaming algorithms","author":"dwork","year":"2010","journal-title":"ICS"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806787"},{"key":"5","first-page":"265","article-title":"Calibrating noise to sensitivity in private data analysis","volume":"3876","author":"dwork","year":"2006","journal-title":"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1145\/1065167.1065184"},{"key":"9","article-title":"Differentially private empirical risk minimization","volume":"12","author":"chaudhuri","year":"2011","journal-title":"Journal of Machine Learning Research"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374464"}],"event":{"name":"2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","start":{"date-parts":[[2012,10,1]]},"location":"Monticello, IL, USA","end":{"date-parts":[[2012,10,5]]}},"container-title":["2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6475439\/6483185\/06483317.pdf?arnumber=6483317","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,23]],"date-time":"2017-03-23T02:29:44Z","timestamp":1490236184000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6483317\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10]]},"references-count":25,"URL":"https:\/\/doi.org\/10.1109\/allerton.2012.6483317","relation":{},"subject":[],"published":{"date-parts":[[2012,10]]}}}