{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T04:21:07Z","timestamp":1729657267415,"version":"3.28.0"},"reference-count":20,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,10]]},"DOI":"10.1109\/acssc.2017.8335644","type":"proceedings-article","created":{"date-parts":[[2018,4,18]],"date-time":"2018-04-18T18:21:42Z","timestamp":1524075702000},"page":"1672-1676","source":"Crossref","is-referenced-by-count":3,"title":["Function computation with privacy constraints"],"prefix":"10.1109","author":[{"given":"Wenwen","family":"Tu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lifeng","family":"Lai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2251412"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.adhoc.2012.02.016"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.clsr.2009.11.008"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2006.890823"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2161916"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.838380"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-55220-5_21"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2457926"},{"journal-title":"Elements of Information Theory","year":"2006","author":"cover","key":"ref18"},{"key":"ref19","first-page":"609","article-title":"Conditional independence and markov properties in possibility theory","author":"vejnarov\u00e1","year":"2000","journal-title":"Proceedings of the Sixteenth Conference on Uncertainty in Artificial Intelligence"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2188883"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"3498","DOI":"10.1109\/TIT.2007.904785","article-title":"Computation over multiple-access channels","volume":"53","author":"nazer","year":"2007","journal-title":"IEEE Trans Inform Theory"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1975.1055469"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1975.1055374"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"903","DOI":"10.1109\/18.915643","article-title":"Coding for computing","volume":"47","author":"orlitsky","year":"2001","journal-title":"IEEE Trans Inform Theory"},{"journal-title":"Distributed Source Coding","year":"2006","author":"xiong","key":"ref7"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2165807"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2080850"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2192094"},{"key":"ref20","article-title":"On function computation with privacy and secrecy constraints","author":"tu","year":"2017","journal-title":"IEEE Trans Inform Theory"}],"event":{"name":"2017 51st Asilomar Conference on Signals, Systems, and Computers","start":{"date-parts":[[2017,10,29]]},"location":"Pacific Grove, CA, USA","end":{"date-parts":[[2017,11,1]]}},"container-title":["2017 51st Asilomar Conference on Signals, Systems, and Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8330843\/8335116\/08335644.pdf?arnumber=8335644","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,16]],"date-time":"2019-10-16T00:55:59Z","timestamp":1571187359000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8335644\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/acssc.2017.8335644","relation":{},"subject":[],"published":{"date-parts":[[2017,10]]}}}