{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T07:47:24Z","timestamp":1730274444417,"version":"3.28.0"},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,6]]},"DOI":"10.1109\/isit.2010.5513725","type":"proceedings-article","created":{"date-parts":[[2010,8,19]],"date-time":"2010-08-19T15:57:25Z","timestamp":1282233445000},"page":"2617-2621","source":"Crossref","is-referenced-by-count":2,"title":["On unconditionally secure oblivious transfer from continuous channels"],"prefix":"10.1109","author":[{"given":"Motohiko","family":"Isaka","sequence":"first","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/18.133243"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1587\/transfun.E92.A.525"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/18.476316"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.921686"},{"journal-title":"Information Theory and Reliable Communications","year":"1968","author":"gallager","key":"ref14"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/18.923716"},{"key":"ref16","first-page":"590","article-title":"On strictly geometrically uniform codes: Construction and new codes","volume":"e80 a","author":"takeshita","year":"1997","journal-title":"IEICE Trans on Fundamentals"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1968.tb02486.x"},{"key":"ref4","first-page":"47","article-title":"Efficient unconditional oblivious transfer from almost any noisy channels","volume":"3352","author":"cr\u00e9peau","year":"0","journal-title":"Proc SCN '04 LNCS"},{"key":"ref3","first-page":"306","article-title":"Efficient cryptographic protocols based on noisy channels","volume":"1233","author":"cr\u00e9peau","year":"0","journal-title":"Proc of LNCS EUROCRYPT"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.262082"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.921856"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205944"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557524"},{"key":"ref2","first-page":"20","article-title":"Founding cryptography on oblivious transfer","author":"kilian","year":"0","journal-title":"Proceedings of the 20th ACM Symposium on Theory of Computing"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/3812.3818"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00457-5_20"}],"event":{"name":"2010 IEEE International Symposium on Information Theory - ISIT","start":{"date-parts":[[2010,6,13]]},"location":"Austin, TX, USA","end":{"date-parts":[[2010,6,18]]}},"container-title":["2010 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5508195\/5513230\/05513725.pdf?arnumber=5513725","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,18]],"date-time":"2017-03-18T15:12:38Z","timestamp":1489849958000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5513725\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/isit.2010.5513725","relation":{},"subject":[],"published":{"date-parts":[[2010,6]]}}}