{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,15]],"date-time":"2024-06-15T23:14:34Z","timestamp":1718493274180},"reference-count":32,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2015,10,1]],"date-time":"2015-10-01T00:00:00Z","timestamp":1443657600000},"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":[[2015,10]]},"DOI":"10.1109\/tit.2015.2450732","type":"journal-article","created":{"date-parts":[[2015,9,11]],"date-time":"2015-09-11T18:36:08Z","timestamp":1441996568000},"page":"5623-5635","source":"Crossref","is-referenced-by-count":3,"title":["Information-Theoretic Interactive Hashing and Oblivious Transfer to a Storage-Bounded Receiver"],"prefix":"10.1109","volume":"61","author":[{"given":"Christian","family":"Cachin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Claude","family":"Crepeau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Julien","family":"Marcil","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"George","family":"Savvides","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1986.25"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/1008908.1008920"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-003-0237-x"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/11761679_32"},{"key":"ref11","author":"kilian","year":"1992"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44647-8_9"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-006-0438-1"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3812.3818"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721656"},{"key":"ref16","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 of the 19th Annual ACM Symposium on Theory of Computing (STOC)"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1137\/080725404"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2007.3"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/73007.73012"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795293172"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1986.26"},{"key":"ref27","article-title":"How to exchange secrets by oblivious transfer","author":"rabin","year":"1981"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/18.476316"},{"key":"ref6","first-page":"306","article-title":"Efficient cryptographic protocols based on noisy channels","volume":"1233","author":"cr\u00e9peau","year":"1997","journal-title":"Advances in Cryptology"},{"key":"ref29","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-540-24638-1_1","article-title":"Notions of reducibility between cryptographic primitives","volume":"2951","author":"reingold","year":"2004","journal-title":"Proc Theory of Cryptography Conf (TCC)"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1998.743500"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/978-3-540-30598-9_4","article-title":"Efficient unconditional oblivious transfer from almost any noisy channel","volume":"3352","author":"cr\u00e9peau","year":"2005","journal-title":"Proc 4th Conf Secur Commun Netw (SCN)"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1988.21920"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-34805-0_48"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/11761679_13"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.1003845"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62215"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/BF00191321"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-003-0217-1"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-9323-8_31"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s001459900037"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48285-7_23"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-55210-3_203"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/7258415\/07258461.pdf?arnumber=7258461","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:46:31Z","timestamp":1642005991000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7258461\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10]]},"references-count":32,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/tit.2015.2450732","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,10]]}}}