{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T18:12:11Z","timestamp":1771611131534,"version":"3.50.1"},"reference-count":34,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2011,8,1]],"date-time":"2011-08-01T00:00:00Z","timestamp":1312156800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2011,8]]},"DOI":"10.1109\/tit.2011.2158898","type":"journal-article","created":{"date-parts":[[2011,8,4]],"date-time":"2011-08-04T01:26:02Z","timestamp":1312421162000},"page":"5566-5571","source":"Crossref","is-referenced-by-count":21,"title":["Achieving Oblivious Transfer Capacity of Generalized Erasure Channels in the Malicious Model"],"prefix":"10.1109","volume":"57","author":[{"given":"Adriana C. B.","family":"Pinto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rafael","family":"Dowsley","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kirill","family":"Morozov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anderson C. A.","family":"Nascimento","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/1008908.1008920"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2002.1023565"},{"key":"ref31","author":"savvides","year":"2007","journal-title":"Interactive hashing and reductions between oblivious transfer variants"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480197329508"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1975.tb02040.x"},{"key":"ref10","first-page":"306","article-title":"Efficient cryptographic protocols based on noisy channels","author":"crpeau","year":"0","journal-title":"Proc Eurocrypt 1997"},{"key":"ref11","first-page":"42","article-title":"Achieving oblivious transfer using weakened security assumptions (extended abstract)","author":"crpeau","year":"0","journal-title":"Proc FOCS 1988"},{"key":"ref12","first-page":"110","article-title":"A. tapp. Committed oblivious transfer and private multi-party computation","author":"crpeau","year":"0","journal-title":"Proc CRYPTO 1995"},{"key":"ref13","first-page":"47","article-title":"S. wolf. Efficient unconditional oblivious transfer from almost any noisy channel","volume":"3352","author":"crpeau","year":"0","journal-title":"Proceedings of SC'2004"},{"key":"ref14","first-page":"201","article-title":"Optimal reductions between oblivious transfers using interactive hashing","volume":"4004","author":"crpeau","year":"0","journal-title":"Proc Eurocrypt 2006"},{"key":"ref15","first-page":"86","article-title":"Statistical security conditions for two-party secure function evaluation","volume":"5155","author":"crpeau","year":"0","journal-title":"Proc ICITS 2008"},{"key":"ref16","author":"csiszr","year":"1981","journal-title":"Information Theory Coding Theorems for Discrete Memoryless Channels"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-006-0438-1"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1137\/060651380"},{"key":"ref19","first-page":"20","article-title":"How to play any mental game, or: A completeness theorem for protocols with honest majority","author":"goldreich","year":"1997","journal-title":"Proc 19th ACM STOC"},{"key":"ref28","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1090\/dimacs\/013\/09","author":"ostrovsky","year":"1993","journal-title":"AMS DIMACS Series in Discrete Mathematics and Theoretical Computer Science"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1137\/0217014"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1996.0004"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/18.476316"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(79)90044-8"},{"key":"ref29","author":"rabin","year":"1981","journal-title":"How to exchange secrets by oblivious transfer"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1998.743500"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1973.1054929"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177729330"},{"key":"ref2","first-page":"97","article-title":"Precomputing oblivious transfer","volume":"963","author":"beaver","year":"1995","journal-title":"Proc Crypto"},{"key":"ref9","first-page":"350","article-title":"Equivalence between two flavours of oblivious transfers","volume":"293","author":"crpeau","year":"0","journal-title":"Proc CRYPTO '87"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557524"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793244708"},{"key":"ref22","first-page":"35","article-title":"Commitment capacity of discrete memoryless channels","author":"imai","year":"0","journal-title":"Proc IMA Int Conf 2003"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.262082"},{"key":"ref24","first-page":"20","article-title":"Founding cryptography on oblivious transfer","author":"kilian","year":"0","journal-title":"Proc STOC 1988"},{"key":"ref23","first-page":"12","article-title":"Pseudo-random generation from one-way functions (extended abstracts)","author":"impagliazzo","year":"0","journal-title":"Proc STOC 1989"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.921856"},{"key":"ref25","first-page":"219","article-title":"Generalized oblivious transfer protocols based on noisy channels","volume":"2052","author":"korjik","year":"0","journal-title":"Proc MMM ACNS 2001"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/5961798\/05961837.pdf?arnumber=5961837","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:52:46Z","timestamp":1642006366000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5961837\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,8]]},"references-count":34,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tit.2011.2158898","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,8]]}}}