Quantum protocols for Rabin oblivious transfer

• URL: http://arxiv.org/abs/2507.04015v1
• Date: Sat, 05 Jul 2025 12:01:29 GMT
• Title: Quantum protocols for Rabin oblivious transfer
• Authors: Erika Andersson, Akshay Bansal, James T. Peat, Jamie Sikora, Jiawei Wu,
• Abstract summary: Rabin oblivious transfer is a cryptographic task where Alice wishes to receive a bit from Bob but it may get lost with probability 1/2.<n>We provide protocol designs which yield quantum protocols with improved security.
• Score: 3.9726806016869936
• License: http://creativecommons.org/licenses/by/4.0/
• 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.

Related papers

• Incomplete quantum oblivious transfer with perfect one-sided security [0.0]
  We consider 1 out of 2 oblivious transfer, where a sender sends two bits of information to a receiver. We aim to find the lowest possible cheating probabilities. We show that non-interactive quantum protocols can outperform non-interactive classical protocols.
  arXiv  Detail & Related papers  (2024-09-26T06:35:36Z)
• Decoherence-assisted quantum key distribution [37.69303106863453]
  We show that our method reduces the amount of information that an eavesdropper can obtain in the BB84 protocol under the entangling probe attack. We demonstrate experimentally that Alice and Bob can agree on a scheme to that gives low values of the quantum bit error rate.
  arXiv  Detail & Related papers  (2024-05-30T15:28:07Z)
• Quantum Rabin oblivious transfer using two pure states [0.0]
  In oblivious transfer, the sender Alice holds a bit, and the receiver Bob either obtains the bit, or obtains no information with probability $p_?$. We examine a quantum Rabin oblivious transfer protocol that uses two pure states. Investigating different cheating scenarios for the sender and for the receiver, we determine optimal cheating probabilities in each case.
  arXiv  Detail & Related papers  (2024-05-07T16:54:16Z)
• An Improved Quantum Private Set Intersection Protocol Based on Hadamard Gates [22.0983572289132]
  We find the participant can deduce the other party's private information, which violates the security requirement of private set computation. In order to solve this problem, an improved private set intersection protocol based on Hadamard gate is proposed.
  arXiv  Detail & Related papers  (2023-10-01T16:21:44Z)
• Quantum advantage in a unified scenario and secure detection of resources [49.1574468325115]
  We consider a single communication task to study different approaches of observing quantum advantage.<n>In our task, there are three parties - the Manager, Alice, and Bob.<n>We show that the goal of the task can be achieved when Alice sends a qubit.
  arXiv  Detail & Related papers  (2023-09-22T23:06:20Z)
• Breaking barriers in two-party quantum cryptography via stochastic semidefinite programming [0.0]
  We find a way to switch between bit commitment, weak coin flipping, and oblivious transfer protocols to improve their security.<n>We also use selection to turn trash into treasure yielding the first quantum protocol for Rabin oblivious transfer.
  arXiv  Detail & Related papers  (2023-04-26T00:00:48Z)
• Gaussian conversion protocol for heralded generation of qunaught states [66.81715281131143]
  bosonic codes map qubit-type quantum information onto the larger bosonic Hilbert space. We convert between two instances of these codes GKP qunaught states and four-foldsymmetric binomial states corresponding to a zero-logical encoded qubit. We obtain GKP qunaught states with a fidelity of over 98% and a probability of approximately 3.14%.
  arXiv  Detail & Related papers  (2023-01-24T14:17:07Z)
• Non-interactive XOR quantum oblivious transfer: optimal protocols and their experimental implementations [0.0]
  Oblivious transfer (OT) is an important cryptographic primitive. We present an optimal protocol, which outperforms classical protocols. We optically implement both the unreversed and the reversed protocols, and cheating strategies, noting that the reversed protocol is easier to implement.
  arXiv  Detail & Related papers  (2022-09-22T20:28:39Z)
• Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
  "Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation. We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
  arXiv  Detail & Related papers  (2021-12-09T19:00:00Z)
• Device-Independent-Quantum-Randomness-Enhanced Zero-Knowledge Proof [25.758352536166502]
  Zero-knowledge proof (ZKP) is a fundamental cryptographic primitive that allows a prover to convince a verifier of the validity of a statement. As an efficient variant of ZKP, non-interactive zero-knowledge proof (NIZKP) adopting the Fiat-Shamir is essential to a wide spectrum of applications.
  arXiv  Detail & Related papers  (2021-11-12T13:36:43Z)
• Counterfactual Concealed Telecomputation [22.577469136318836]
  We devise a distributed blind quantum computation protocol to perform a universal two-qubit controlled unitary operation. It is shown that the protocol is valid for general input states and that single-qubit unitary teleportation is a special case of CCT. The protocol becomes deterministic with simplified circuit implementation if the initial composite state of Alice and Bob is a Bell-type state.
  arXiv  Detail & Related papers  (2020-12-09T10:07:58Z)
• Oblivious Transfer is in MiniQCrypt [20.72168448608258]
  MiniQCrypt is a world where quantum-secure one-way functions exist, and quantum communication is possible. We construct an oblivious transfer protocol in MiniQCrypt that achieves simulation-security in the plain model against malicious quantum-time adversaries.
  arXiv  Detail & Related papers  (2020-11-30T16:51:17Z)
• Imperfect 1-out-of-2 quantum oblivious transfer: bounds, a protocol, and its experimental implementation [0.0]
  We introduce a theoretical framework for studying semirandom quantum oblivious transfer. We then use it to derive bounds on cheating. We show that a lower bound of 2/3 on the minimum achievable cheating probability can be directly derived for semirandom protocols.
  arXiv  Detail & Related papers  (2020-07-09T11:17:27Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.