{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T09:01:41Z","timestamp":1730278901226,"version":"3.28.0"},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,10]]},"DOI":"10.1109\/itw.2011.6089575","type":"proceedings-article","created":{"date-parts":[[2011,12,6]],"date-time":"2011-12-06T20:58:48Z","timestamp":1323205128000},"page":"638-642","source":"Crossref","is-referenced-by-count":2,"title":["Efficient fully simulatable oblivious transfer from the McEliece assumptions"],"prefix":"10.1109","author":[{"given":"Bernardo M.","family":"David","sequence":"first","affiliation":[]},{"given":"Anderson C. A.","family":"Nascimento","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","article-title":"A distinguisher for high rate mceliece cryptosystems","author":"faugere","year":"2010","journal-title":"Cryptology EPrint Archive Report 2010\/499"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539703427975"},{"key":"ref12","first-page":"19","article-title":"Universally composable commitments","author":"canetti","year":"2001","journal-title":"Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology Ser CRYPTO '01"},{"key":"ref13","first-page":"56","article-title":"On the (im)possibility of basing oblivious transfer and bit commitment on weakened security assumptions","author":"damgard","year":"1999","journal-title":"EUROCRYPT'99 Proceedings of the 17th International Conference on Theory and Application of Cryptographic Techniques"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055873"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s001459900010"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511813603"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28420"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62215"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85093-9_11"},{"key":"ref5","first-page":"110","article-title":"Committed oblivious transfer and private multi-party computation","volume":"963","author":"crepeau","year":"1995"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-008-9175-9"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-79263-5_4"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3812.3818"},{"key":"ref1","article-title":"How to exchange secrets by oblivious transfer","author":"rabin","year":"1981","journal-title":"Technical Memo TR-81 Aiken Computation Laboratory Harvard University"},{"key":"ref9","first-page":"42","article-title":"A public-key cryptosystem based on algebraic coding theory. dsn progress report","author":"mceliece","year":"1978","journal-title":"Jet Propulsion Laboratories"}],"event":{"name":"2011 IEEE Information Theory Workshop (ITW)","start":{"date-parts":[[2011,10,16]]},"location":"Paraty, Brazil","end":{"date-parts":[[2011,10,20]]}},"container-title":["2011 IEEE Information Theory Workshop"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6081149\/6089351\/06089575.pdf?arnumber=6089575","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T14:04:59Z","timestamp":1490105099000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6089575\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,10]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/itw.2011.6089575","relation":{},"subject":[],"published":{"date-parts":[[2011,10]]}}}