Quantum protocols for Rabin oblivious transfer

2025/07/05 by Andersson, Erika, Bansal, Akshay, Peat, James T. +2
#Cryptography and Security (cs.CR) #FOS: Computer and information sciences #FOS: Physical sciences #Quantum Physics (quant-ph)

paper · doi:10.48550/arxiv.2507.04015

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.

Citations

• Cheating in quantum Rabin oblivious transfer using delayed measurements
• Protocols for Quantum Weak Coin Flipping
• On the composable security of weak coin flipping
• A constant lower bound for any quantum protocol for secure function\n evaluation
• A simpler proof of existence of quantum weak coin flipping with arbitrarily small bias
• Optimal bounds for quantum bit commitment
• Optimal quantum strong coin flipping
• Quantum weak coin flipping with arbitrarily small bias
• Founding crytpography on oblivious transfer

Related

• Cheating in quantum Rabin oblivious transfer using delayed measurements
• Incomplete quantum oblivious transfer with perfect one-sided security
• Using quantum oblivious transfer to cheat sensitive quantum bit commitment
• Using Quantum Oblivious Transfer to Cheat Sensitive Quantum Bit Commitment
• Asymptotically Secure Quantum Oblivious Transfer