{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T17:05:38Z","timestamp":1769274338793,"version":"3.49.0"},"reference-count":39,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2017,10,1]],"date-time":"2017-10-01T00:00:00Z","timestamp":1506816000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"funder":[{"name":"European Research Council through the European Unions\u2019s Horizon 2020 Research and Innovation Programme","award":["669255"],"award-info":[{"award-number":["669255"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2017,10]]},"DOI":"10.1109\/tit.2017.2735423","type":"journal-article","created":{"date-parts":[[2017,8,3]],"date-time":"2017-08-03T18:18:13Z","timestamp":1501784293000},"page":"6819-6826","source":"Crossref","is-referenced-by-count":8,"title":["On the Oblivious Transfer Capacity of Generalized Erasure Channels Against Malicious Adversaries: The Case of Low Erasure Probability"],"prefix":"10.1109","volume":"63","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7588-2410","authenticated-orcid":false,"given":"Rafael","family":"Dowsley","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anderson C. A.","family":"Nascimento","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1975.tb02040.x"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/1008908.1008920"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2158898"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-9323-8_31"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1996.0004"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.921856"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2002.1023565"},{"key":"ref36","article-title":"Interactive hashing and reductions between oblivious transfer variants","author":"savvides","year":"2007"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480197329508"},{"key":"ref34","article-title":"How to exchange secrets by oblivious transfer","author":"rabin","year":"1981"},{"key":"ref10","article-title":"Equivalence between two flavours of oblivious transfers","volume":"293","author":"cr\u00e9peau","year":"1987","journal-title":"Advances in Cryptology"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-69053-0_21"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1988.21920"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30598-9_4"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/11761679_13"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44750-4_9"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85093-9_9"},{"key":"ref17","author":"csisz\u00e1r","year":"1982","journal-title":"Information Theory Coding Theorems for Discrete Memoryless Systems"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24638-1_25"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-006-0438-1"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62215"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/18.476316"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22792-9_38"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44750-4_8"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1998.743500"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45116-1_22"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/0217014"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177729330"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(79)90044-8"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36899-8_6"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1973.1054929"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557524"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1137\/060651380"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875108"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24676-3_31"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793244708"},{"key":"ref23","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":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/73007.73009"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.262082"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/8036324\/08000673.pdf?arnumber=8000673","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T03:00:04Z","timestamp":1633921204000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8000673\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10]]},"references-count":39,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/tit.2017.2735423","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,10]]}}}