{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T08:08:46Z","timestamp":1761293326061,"version":"3.28.0"},"reference-count":23,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1109\/isit.2015.7282595","type":"proceedings-article","created":{"date-parts":[[2015,10,1]],"date-time":"2015-10-01T18:09:52Z","timestamp":1443722992000},"page":"949-953","source":"Crossref","is-referenced-by-count":9,"title":["Common randomness for secure computing"],"prefix":"10.1109","author":[{"given":"Prakash","family":"Narayan","sequence":"first","affiliation":[]},{"given":"Himanshu","family":"Tyagi","sequence":"additional","affiliation":[]},{"given":"Shun","family":"Watanabe","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","first-page":"149","article-title":"Common information is far less than mutual information","volume":"2","author":"gacs","year":"1973","journal-title":"Problems of Control and Information Theory"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/0405021"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2046253"},{"key":"ref13","first-page":"256","article-title":"Complexity of multiparty computation problems: The case of 2-party symmetric secure function evaluation","volume":"5444","author":"maji","year":"2009","journal-title":"TCC of LNCS"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-34931-7_4"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/18.256484"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2012.6404773"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2316011"},{"key":"ref18","article-title":"How to exchange secrets with oblivious transfer","author":"rabin","year":"2005","journal-title":"Cryptology ePrint Archive Report 2005\/146"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/73007.73014"},{"key":"ref4","first-page":"1","article-title":"Completeness theorems for non-cryptographic fault-tolerant distribution computation","author":"ben-or","year":"1988","journal-title":"STOC"},{"key":"ref3","article-title":"Perfect privacy for two party protocols","author":"beaver","year":"1989","journal-title":"Technical Report TR-11–89 Harvard University"},{"key":"ref6","first-page":"11","article-title":"Multiparty unconditionally secure protocols","author":"chaum","year":"1988","journal-title":"STOC"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1008908.1008911"},{"key":"ref8","first-page":"199","article-title":"On the communication complexity of secure computation","volume":"8617","author":"data","year":"2014","journal-title":"LNCS J CRYPTOL"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.921705"},{"key":"ref2","first-page":"560","article-title":"Multiparty protocols tolerating half faulty processors","volume":"435","author":"beaver","year":"1989","journal-title":"LNCS J CRYPTOL"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.243431"},{"key":"ref9","first-page":"42","article-title":"Lower bound for oblivious transfer reductions","volume":"1592","author":"dodis","year":"1999","journal-title":"Eurocrypt LNCS"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2165807"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.921674"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620808"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1982.38"}],"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\/07282595.pdf?arnumber=7282595","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,24]],"date-time":"2017-03-24T17:03:04Z","timestamp":1490374984000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7282595\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/isit.2015.7282595","relation":{},"subject":[],"published":{"date-parts":[[2015,6]]}}}