{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T06:21:44Z","timestamp":1761718904196,"version":"3.37.3"},"reference-count":53,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"BIU Center for Research in Applied Cryptography and Cyber Security in conjunction with the Israel National Cyber Bureau in the Prime Minister\u2019s Office"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1109\/tit.2020.2967048","type":"journal-article","created":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T21:23:42Z","timestamp":1579296222000},"page":"3745-3752","source":"Crossref","is-referenced-by-count":14,"title":["On the Commitment Capacity of Unfair Noisy Channels"],"prefix":"10.1109","volume":"66","author":[{"given":"Claude","family":"Crepeau","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7588-2410","authenticated-orcid":false,"given":"Rafael","family":"Dowsley","sequence":"additional","affiliation":[]},{"given":"Anderson C. A.","family":"Nascimento","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/11593447_11","article-title":"Simple and tight bounds for information reconciliation and privacy amplification","volume":"3788","author":"renner","year":"2005","journal-title":"Advances in Cryptology—CRYPTO 2005"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2735423"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2158487"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2111750"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2009.5054708"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2032814"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2158898"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557524"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.262082"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.921856"},{"key":"ref28","article-title":"Secrecy capacity of the wiretap channel with noisy feedback","author":"lai","year":"2007","journal-title":"Proc 45th Annu Allerton Conf Commun Control Comput"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.928990"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.921705"},{"key":"ref2","first-page":"218","article-title":"How to play any mental game, or a completeness theorem for protocols with honest majority","author":"goldreich","year":"1987","journal-title":"Proc 19th Annu ACM Symp Theory Comput"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1008908.1008911"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055917"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.838380"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-39757-4_5"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261613"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523727"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557401"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-1385-2"},{"key":"ref50","first-page":"509","article-title":"On the composability of statistically secure bit commitments","volume":"14","author":"dowsley","year":"2013","journal-title":"J Internet Technol"},{"key":"ref51","first-page":"103","article-title":"On possibility of universally composable commitments based on noisy channels","author":"dowsley","year":"2008","journal-title":"Anais do VIII Simpósio Brasileiro em Segurança da Informação e de Sistemas Computacionais SBSEG 2008"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00457-5_20"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/18.669255"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055892"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/18.256484"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1996.0004"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/18.243431"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1988.21920"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-69053-0_21"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48910-X_5"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49896-5_7"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53641-4_9"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-40974-8_4"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.921686"},{"key":"ref4","first-page":"11","article-title":"Multiparty unconditionally secure protocols (extended abstract)","author":"chaum","year":"1988","journal-title":"Proc 20th Annu ACM Symp Theory Comput"},{"key":"ref3","first-page":"87","article-title":"Multiparty computations ensuring privacy of each party’s input and correctness of the result","volume":"293","author":"chaum","year":"1988","journal-title":"Adv Cryptology"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/116825.116852"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3812.3818"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(88)90005-0"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546891"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2001.959888"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1975.tb02040.x"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1137\/0217014"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793244708"},{"article-title":"Techniques for computing with low-independence randomness","year":"1990","author":"rompel","key":"ref48"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/18.476316"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480197329508"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1137\/060651380"},{"key":"ref44","first-page":"12","article-title":"Pseudo-random generation from one-way functions (extended abstracts)","author":"impagliazzo","year":"1989","journal-title":"Proc 21st Annu ACM Symp Theory Comput"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/800105.803400"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/9098132\/08961975.pdf?arnumber=8961975","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T17:32:23Z","timestamp":1651080743000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8961975\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6]]},"references-count":53,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tit.2020.2967048","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2020,6]]}}}