Coding Constructions for Efficient Oblivious Transfer from Noisy Channels

TL;DR

This paper introduces coding-based constructions for efficient oblivious transfer over noisy channels, ensuring positive rates even in malicious settings by leveraging linear codes with good Schur product properties.

Contribution

It presents novel coding constructions for oblivious transfer over noisy channels that operate securely in malicious environments, based on properties of linear codes.

Findings

Achieves explicit positive rate for oblivious transfer

Uses linear codes with asymptotically good Schur products

Provides constructions suitable for malicious adversaries

Abstract

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.