{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T05:59:44Z","timestamp":1729663184405,"version":"3.28.0"},"reference-count":36,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1109\/isit.2015.7282955","type":"proceedings-article","created":{"date-parts":[[2015,10,1]],"date-time":"2015-10-01T18:09:52Z","timestamp":1443722992000},"page":"2742-2746","source":"Crossref","is-referenced-by-count":0,"title":["Impossibility bounds for secure computing"],"prefix":"10.1109","author":[{"given":"Himanshu","family":"Tyagi","sequence":"first","affiliation":[]},{"given":"Shun","family":"Watanabe","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/978-3-540-40974-8_4","article-title":"Commitment capacity of discrete memoryless channels","author":"winter","year":"2003","journal-title":"Proc Cryptography and Coding"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2314467"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.108.200501"},{"key":"ref30","article-title":"Converses for secret key agreement and secure computing","volume":"abs 1404 5715","year":"2014","journal-title":"CoRR"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1982.38"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.921674"},{"key":"ref34","first-page":"222","article-title":"Oblivious transfer is symmetric","author":"wolf","year":"2006","journal-title":"Proc EUROCRYPT"},{"key":"ref10","first-page":"149","article-title":"Common information is far less than mutual information","volume":"2","author":"g\u00e1cs","year":"1973","journal-title":"Problems of Control and Information Theory"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2000.892121"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.813556"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2014.7028449"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.262083"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2010.5707069"},{"journal-title":"Information Theory and Statistics","year":"1968","author":"kullback","key":"ref16"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/18.256484"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.921856"},{"article-title":"Channel coding: non-asymptotic fundamental limits","year":"2010","author":"polyanskiy","key":"ref19"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282767"},{"key":"ref4","first-page":"97","article-title":"Precomputing oblivious transfer","author":"beaver","year":"1995","journal-title":"Advances in Cryptology-CRYPTO"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6034101"},{"key":"ref3","first-page":"145","article-title":"On oblivious transfer capacity","year":"2013","journal-title":"Information Theory Combinatorics Search Theory"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.838380"},{"key":"ref29","first-page":"369","article-title":"A bound for multiparty secret key agreement and implications for a problem of secure computing","author":"tyagi","year":"2014","journal-title":"Proc EUROCRYPT"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1008908.1008911"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3812.3818"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.921705"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/18.243431"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-28628-8_34"},{"journal-title":"A V Williams building","article-title":"Discussions in 2353","year":"0","key":"ref1"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2043769"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25385-0_28"},{"key":"ref21","article-title":"How to exchange secrets with oblivious transfer","author":"rabin","year":"2005","journal-title":"Cryptology ePrint Archive Report 2005\/146"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-984-2"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2014.6970787"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2262496"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2264355"}],"event":{"name":"2015 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2015,6,14]]},"location":"Hong Kong, Hong Kong","end":{"date-parts":[[2015,6,19]]}},"container-title":["2015 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7270906\/7282397\/07282955.pdf?arnumber=7282955","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,23]],"date-time":"2017-06-23T16:37:49Z","timestamp":1498235869000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7282955\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6]]},"references-count":36,"URL":"https:\/\/doi.org\/10.1109\/isit.2015.7282955","relation":{},"subject":[],"published":{"date-parts":[[2015,6]]}}}