{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T22:50:36Z","timestamp":1775515836325,"version":"3.50.1"},"reference-count":24,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2011,10,1]],"date-time":"2011-10-01T00:00:00Z","timestamp":1317427200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2011,10,1]],"date-time":"2011-10-01T00:00:00Z","timestamp":1317427200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2011,10,1]],"date-time":"2011-10-01T00:00:00Z","timestamp":1317427200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2011,10]]},"DOI":"10.1109\/tit.2011.2165807","type":"journal-article","created":{"date-parts":[[2011,10,12]],"date-time":"2011-10-12T10:34:17Z","timestamp":1318415657000},"page":"6337-6350","source":"Crossref","is-referenced-by-count":46,"title":["When Is a Function Securely Computable?"],"prefix":"10.1109","volume":"57","author":[{"given":"Himanshu","family":"Tyagi","sequence":"first","affiliation":[{"name":"Department of Electrical and Computer Engineering and the Institute for Systems Research, University of Maryland, College Park, MD, USA"}]},{"given":"Prakash","family":"Narayan","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering and the Institute for Systems Research, University of Maryland, College Park, MD, USA"}]},{"given":"Piyush","family":"Gupta","sequence":"additional","affiliation":[{"name":"Bell Labs, Alcatel-Lucent, NJ, USA"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2050832"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2005.843543"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1056022"},{"key":"ref13","first-page":"157, 28","author":"loeve","year":"1955","journal-title":"Probability Theory"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205926"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/18.256484"},{"key":"ref16","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/978-1-4615-2694-0_27","author":"maurer","year":"1994","journal-title":"Communications and Cryptography Two Sides of One Tapestry"},{"key":"ref17","first-page":"1871","article-title":"On the oblivious transfer capacity of noisy correlations","author":"nascimento","year":"2009","journal-title":"Proc IEEE Int Symp Inf Theory (ISIT)"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/800057.808684"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/18.915643"},{"key":"ref4","first-page":"48","article-title":"Almost independence and secrecy capacity","volume":"32","author":"csiszr","year":"1996","journal-title":"Probl Pered Informat"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511921889"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.838380"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/18.825796"},{"key":"ref8","first-page":"149","article-title":"Common information is far less than mutual information","volume":"2","author":"gcs","year":"1973","journal-title":"Probl Contr Inf Theory"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.921705"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557524"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.243431"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/18.2626"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1974.1055171"},{"key":"ref22","author":"ye","year":"2005","journal-title":"Information Theoretic Generation of Multiple Secret Keys"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/800135.804414"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2173731"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2173731"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/6034704\/06034733.pdf?arnumber=6034733","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,9]],"date-time":"2025-12-09T18:32:35Z","timestamp":1765305155000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/6034733\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,10]]},"references-count":24,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/tit.2011.2165807","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,10]]}}}