{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T09:55:05Z","timestamp":1740131705595,"version":"3.37.3"},"reference-count":66,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2018,8,1]],"date-time":"2018-08-01T00:00:00Z","timestamp":1533081600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.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":[[2018,8]]},"DOI":"10.1109\/tit.2018.2796128","type":"journal-article","created":{"date-parts":[[2018,1,22]],"date-time":"2018-01-22T22:32:23Z","timestamp":1516660343000},"page":"5970-5984","source":"Crossref","is-referenced-by-count":2,"title":["Commitment and Oblivious Transfer in the Bounded Storage Model With Errors"],"prefix":"10.1109","volume":"64","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":"Felipe","family":"Lacerda","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":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36178-2_9"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44647-8_9"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30598-9_4"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2002.1023565"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-69053-0_21"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1988.21920"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1998.743500"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.921864"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0052243"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/BF00191321"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1007\/11761679_13"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1007\/s001459900037"},{"article-title":"Interactive Hashing and reductions between oblivious transfer variants","year":"2007","author":"savvides","key":"ref61"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(79)90044-8"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2158898"},{"journal-title":"The Probabilistic Method","year":"2004","author":"alon","key":"ref64"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.921856"},{"article-title":"Techniques for computing with low-independence randomness","year":"1990","author":"rompel","key":"ref65"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1007\/11761679_14"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2735423"},{"key":"ref2","first-page":"186","article-title":"How to prove yourself: Practical solutions to identification and signature problems","volume":"263","author":"fiat","year":"1987","journal-title":"Adv Cryptology"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875108"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1587\/transfun.E95.A.567"},{"article-title":"A framework for efficient adaptively secure composable oblivious transfer in the ROM","year":"2017","author":"barreto","key":"ref22"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-12280-9_10"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-40974-8_4"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48910-X_5"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557524"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.262082"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-003-0237-x"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365687"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-9323-8_31"},{"key":"ref58","first-page":"739","article-title":"Estimate of the number of signals in error correcting codes","volume":"117","author":"varshamov","year":"1957","journal-title":"Doklady Akademii Nauk SSSR"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24676-3_7"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-01001-9_12"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1007\/11535218_29"},{"key":"ref54","first-page":"1057","article-title":"Near-independence of permutations and an almost sure polynomial bound on the diameter of the symmetric group","author":"babai","year":"2005","journal-title":"Proc 16th Annu ACM-SIAM Symp Discrete Algorithms"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-2418(199712)11:4<345::AID-RSA4>3.0.CO;2-Z"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(94)00171-T"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.78.3414"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/BF00196774"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24638-1_25"},{"key":"ref12","first-page":"148","article-title":"Protocol for signing contracts","author":"even","year":"1981"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46766-1_9"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24638-1_22"},{"article-title":"How to exchange secrets with oblivious transfer","year":"1981","author":"rabin","key":"ref15"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-34805-0_48"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/11426639_5"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85174-5_31"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85093-9_11"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/116825.116852"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3812.3818"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28420"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1008908.1008911"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62215"},{"key":"ref7","first-page":"87","article-title":"Multiparty computations ensuring privacy of each party&#x2019;s input and correctness of the result","volume":"293","author":"chaum","year":"1988","journal-title":"Adv Cryptology"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-006-0438-1"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85174-5_32"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/509907.510023"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24676-3_31"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1007\/11593447_11"},{"key":"ref47","first-page":"5","article-title":"An estimate of the complexity of constructing binary linear cascade codes","volume":"7","author":"zyablov","year":"1971","journal-title":"Problemy Peredachi Inf"},{"article-title":"Protocolo de comprometimento de bit eficiente com seguran&#x00E7;a sequencial baseado no modelo de mem&#x00F3;ria limitada","year":"2010","author":"alves","key":"ref42"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25516-8_8"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30576-7_31"},{"article-title":"Provable everlasting security in the bounded storage model","year":"2001","author":"ding","key":"ref43"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/8410392\/08265610.pdf?arnumber=8265610","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:23:03Z","timestamp":1642004583000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8265610\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8]]},"references-count":66,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tit.2018.2796128","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2018,8]]}}}