{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,14]],"date-time":"2024-09-14T16:44:06Z","timestamp":1726332246393},"reference-count":19,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,11]]},"DOI":"10.1109\/itw.2014.6970881","type":"proceedings-article","created":{"date-parts":[[2014,12,8]],"date-time":"2014-12-08T22:35:43Z","timestamp":1418078143000},"page":"496-500","source":"Crossref","is-referenced-by-count":9,"title":["How to securely compute the modulo-two sum of binary sources"],"prefix":"10.1109","author":[{"given":"Deepesh","family":"Data","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bikash K.","family":"Dey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manoj","family":"Mishra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vinod M.","family":"Prabhakaran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","first-page":"554","article-title":"A minimal model for secure computation","author":"feige","year":"1994","journal-title":"26th Annual ACM Symposium on Theory of Computing"},{"key":"ref11","first-page":"699","article-title":"Communication complexity of secure computation","author":"franklin","year":"1992","journal-title":"Proceedings of the 24th Annual ACM Symposium on the Theory of Computing"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539703432785"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1056022"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480196306130"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1989.63512"},{"journal-title":"A Shannon approach to secure multi-party computations","year":"2014","author":"lee","key":"ref16"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2161916"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2192094"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/18.915643"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(93)90120-X"},{"key":"ref3","first-page":"11","author":"chaum","year":"1988","journal-title":"Multiparty unconditionally secure protocols 20th Annual ACM Symposium on Theory of Computing"},{"journal-title":"Secure Multiparty Computation and Secret Sharing - An Information Theoretic Approach","year":"0","author":"cramer","key":"ref6"},{"journal-title":"Elements of Information Theory","year":"2006","author":"cover","key":"ref5"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2014.6970881"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1988.21920"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s000370050025"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44381-1_12"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62213"}],"event":{"name":"2014 IEEE Information Theory Workshop (ITW)","start":{"date-parts":[[2014,11,2]]},"location":"Hobart, Australia","end":{"date-parts":[[2014,11,5]]}},"container-title":["2014 IEEE Information Theory Workshop (ITW 2014)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6963754\/6970773\/06970881.pdf?arnumber=6970881","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,24]],"date-time":"2017-03-24T06:14:09Z","timestamp":1490336049000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6970881\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,11]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/itw.2014.6970881","relation":{},"subject":[],"published":{"date-parts":[[2014,11]]}}}