Quantum protocols for Rabin oblivious transfer

TL;DR

This paper introduces quantum protocols for Rabin oblivious transfer that enhance security and establishes a fundamental lower bound, along with a new measure called cheating advantage for asymmetric cryptography.

Contribution

It presents novel quantum protocols with improved security for Rabin oblivious transfer and introduces a lower bound and a new security metric called cheating advantage.

Findings

Quantum protocols with improved security for Rabin oblivious transfer.

A constant lower bound on the security of any quantum protocol for this task.

Introduction of the cheating advantage metric for asymmetric cryptographic primitives.

Abstract

Rabin oblivious transfer is the cryptographic task where Alice wishes to receive a bit from Bob but it may get lost with probability 1/2. In this work, we provide protocol designs which yield quantum protocols with improved security. Moreover, we provide a constant lower bound on any quantum protocol for Rabin oblivious transfer. To quantify the security of this task with asymmetric cheating definitions, we introduce the notion of cheating advantage which may be of independent interest in the study of other asymmetric cryptographic primitives.