Capacity Results for the Wiretapped Oblivious Transfer

TL;DR

This paper investigates the capacity of wiretapped oblivious transfer over channels with dependent erasures, providing bounds and protocols that improve upon previous results in secure communication.

Contribution

It introduces new capacity bounds and protocols for wiretapped OT in channels with dependent erasures, extending prior work and covering broader channel classes.

Findings

Bounds on wiretapped OT capacity when erasure probabilities meet certain conditions

A protocol achieving capacity bounds for binary erasure symmetric broadcast channels

Lower bounds for a larger class of wiretapped channels

Abstract

In this paper, we study the problem of the 1-of-2 string oblivious transfer (OT) between Alice and Bob in the presence of a passive eavesdropper Eve. The eavesdropper Eve is not allowed to get any information about the private data of Alice or Bob. When Alice and Bob are honest-but-curious users, we propose a protocol that satisfies $1$-private (neither Alice nor Bob colludes with Eve) OT requirements for the binary erasure symmetric broadcast channel, in which the channel provides dependent erasure patterns to Bob and Eve. We find that when the erasure probabilities satisfy certain conditions, the derived lower and upper bounds on the wiretapped OT capacity meet. Our results generalize and improve upon the results on wiretapped OT capacity by Mishra et al. Finally, we propose a protocol for a larger class of wiretapped channels and derive a lower bound on the wiretapped OT capacity.