{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,16]],"date-time":"2024-08-16T09:03:05Z","timestamp":1723798985818},"reference-count":26,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,6]]},"DOI":"10.1109\/isit.2014.6875092","type":"proceedings-article","created":{"date-parts":[[2014,8,19]],"date-time":"2014-08-19T21:50:30Z","timestamp":1408485030000},"source":"Crossref","is-referenced-by-count":10,"title":["Single-use ot combiners with near-optimal resilience"],"prefix":"10.1109","author":[{"given":"Yuval","family":"Ishai","sequence":"first","affiliation":[]},{"given":"Hemanta K.","family":"Maji","sequence":"additional","affiliation":[]},{"given":"Amit","family":"Sahai","sequence":"additional","affiliation":[]},{"given":"Jurg","family":"Wullschleger","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","article-title":"Asymptotically good ideal linear secret sharing with strong multiplication over any fixed finite field","author":"pueyo","year":"2009","journal-title":"Crypto"},{"key":"17","article-title":"Secure computation from random error correcting codes","author":"chen","year":"2007","journal-title":"Eurocrypt"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70583-3_38"},{"key":"15","article-title":"How to protect yourself without perfect shredding","author":"canetti","year":"2008","journal-title":"ICALP"},{"key":"16","article-title":"General secure multi-party computation from any linear secret-sharing scheme","author":"cramer","year":"2000","journal-title":"Eurocrypt"},{"key":"13","author":"prabhakaran","year":"2013","journal-title":"Secure Multi-Party Computation"},{"key":"14","article-title":"Constant-round multiparty computation using a black-box pseudorandom generator","author":"damgard","year":"2005","journal-title":"Crypto"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1007\/s001459910006"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721656"},{"key":"21","article-title":"Oblivious-transfer amplification","author":"wullschleger","year":"2007","journal-title":"Eurocrypt"},{"key":"20","article-title":"Bounds on the threshold gap in secret sharing and its applications","author":"pueyo","year":"2013","journal-title":"IEEE Transactions on Information Theory"},{"key":"22","author":"wullschleger","year":"2007","journal-title":"Oblivious-Transfer Amplification"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2009.56"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1007\/11818175_33"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70936-7_22"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875092"},{"key":"3","article-title":"How to play any mental game or a completeness theorem for protocols with honest majority","author":"goldreich","year":"1987","journal-title":"STOC"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1986.25"},{"key":"10","article-title":"A randomized protocol for signing contracts","author":"even","year":"1982","journal-title":"Crypto"},{"key":"1","article-title":"On the (im)possibility of basing oblivious transfer and bit commitment on weakened security assumptions","author":"damgard","year":"1999","journal-title":"Eurocrypt"},{"key":"7","article-title":"One-time programs","author":"goldwasser","year":"2008","journal-title":"Crypto"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1988.21920"},{"key":"5","article-title":"Founding cryptography on oblivious transfer - efficiently","author":"ishai","year":"2008","journal-title":"Crypto"},{"key":"4","article-title":"Founding cryptography on oblivious transfer","author":"kilian","year":"1988","journal-title":"STOC"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78524-8_22"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1007\/11426639_6"}],"event":{"name":"2014 IEEE International Symposium on Information Theory (ISIT)","location":"Honolulu, HI, USA","start":{"date-parts":[[2014,6,29]]},"end":{"date-parts":[[2014,7,4]]}},"container-title":["2014 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6867217\/6874773\/06875092.pdf?arnumber=6875092","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,14]],"date-time":"2020-10-14T15:21:52Z","timestamp":1602688912000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/6875092"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/isit.2014.6875092","relation":{},"subject":[],"published":{"date-parts":[[2014,6]]}}}