Wiretapped Oblivious Transfer
Manoj Mishra, Bikash Kumar Dey, Vinod M. Prabhakaran, Suhas Diggavi

TL;DR
This paper investigates the capacity and schemes for oblivious transfer over noisy broadcast channels in the presence of eavesdroppers, providing new capacity results, schemes, and bounds for various privacy and channel configurations.
Contribution
It derives the OT capacity for binary erasure channels under different privacy settings and introduces optimal schemes for malicious participants and multiple OT scenarios.
Findings
OT capacity for binary erasure channels with privacy constraints
Optimal schemes for malicious participants using interactive hashing
Matching bounds for multiple simultaneous OTs
Abstract
In this paper, we study the problem of obtaining -of- string oblivious transfer (OT) between users Alice and Bob, in the presence of a passive eavesdropper Eve. The resource enabling OT in our setup is a noisy broadcast channel from Alice to Bob and Eve. Apart from the OT requirements between the users, Eve is not allowed to learn anything about the users' inputs. When Alice and Bob are honest-but-curious and the noisy broadcast channel is made up of two independent binary erasure channels (connecting Alice-Bob and Alice-Eve), we derive the -of- string OT capacity for both -privacy (when Eve can collude with either Alice or Bob) and -privacy (when no such collusion is allowed). We generalize these capacity results to -of- string OT and study other variants of this problem. When Alice and/or Bob are malicious, we present a different scheme based on interactive…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
