Coding Constructions for Efficient Oblivious Transfer From Noisy Channels

This is the authors' abstract. We don't add key points for this paper.

We consider oblivious transfer protocols performed over binary symmetric channels in a malicious setting where parties will actively cheat if they can. We provide constructions purely based on coding theory that achieve an explicit positive rate, the essential ingredient being the existence of linear codes whose Schur products are asymptotically good.