Quantum Rabin oblivious transfer using two pure states

• URL: http://arxiv.org/abs/2405.04486v2
• Date: Mon, 07 Oct 2024 16:12:44 GMT
• Title: Quantum Rabin oblivious transfer using two pure states
• Authors: Lara Stroh, James T. Peat, Mats Kroneberg, Ittoop V. Puthoor, Erika Andersson,
• Abstract summary: 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.
• Score: 0.0
• License:
• Abstract: Oblivious transfer between two untrusting parties is an important primitive in cryptography. There are different variants of oblivious transfer. In Rabin oblivious transfer, the sender Alice holds a bit, and the receiver Bob either obtains the bit, or obtains no information with probability $p_?$. Alice should not know whether or not Bob obtained the bit. We examine a quantum Rabin oblivious transfer (OT) 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. Comparing the quantum Rabin oblivious transfer protocol to classical Rabin oblivious transfer protocols, we show that the quantum protocol outperforms classical protocols, which do not use a third party, for some values of $p_?$. We find that quantum Rabin OT protocols that use mixed states can outperform quantum Rabin OT protocols that use pure states for some values of $p_?$.

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)
• Cheating in quantum Rabin oblivious transfer using delayed measurements [0.0]
  We explore a variant known as Rabin oblivious transfer. For a previously suggested protocol, we show a possible attack using a delayed measurement. We show how this attack allows perfect cheating, unless the protocol is modified, and suggest changes which lower the cheating probability for the examined cheating strategies.
  arXiv  Detail & Related papers  (2024-08-22T13:31:16Z)
• Quantum advantage in a unified scenario and secure detection of resources [55.2480439325792]
  We consider a single task to study different approaches of having quantum advantage. We show that the optimal success probability in the overall process for a qubit communication might be higher than that for a cbit communication.
  arXiv  Detail & Related papers  (2023-09-22T23:06:20Z)
• Two-Server Oblivious Transfer for Quantum Messages [71.78056556634196]
  We propose two-server oblivious transfer protocols for quantum messages. Oblivious transfer is considered as a cryptographic primitive task for quantum information processing over quantum network.
  arXiv  Detail & Related papers  (2022-11-07T05:12:24Z)
• 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)
• Efficient Bipartite Entanglement Detection Scheme with a Quantum Adversarial Solver [89.80359585967642]
  Proposal reformulates the bipartite entanglement detection as a two-player zero-sum game completed by parameterized quantum circuits. We experimentally implement our protocol on a linear optical network and exhibit its effectiveness to accomplish the bipartite entanglement detection for 5-qubit quantum pure states and 2-qubit quantum mixed states.
  arXiv  Detail & Related papers  (2022-03-15T09:46:45Z)
• Quantum cryptography with classical communication: parallel remote state preparation for copy-protection, verification, and more [125.99533416395765]
  Many cryptographic primitives are two-party protocols, where one party, Bob, has full quantum computational capabilities, and the other party, Alice, is only required to send random BB84 states to Bob. We show how such protocols can generically be converted to ones where Alice is fully classical, assuming that Bob cannot efficiently solve the LWE problem. This means that all communication between (classical) Alice and (quantum) Bob is classical, yet they can still make use of cryptographic primitives that would be impossible if both parties were classical.
  arXiv  Detail & Related papers  (2022-01-31T18:56:31Z)
• Secure Two-Party Quantum Computation Over Classical Channels [63.97763079214294]
  We consider the setting where the two parties (a classical Alice and a quantum Bob) can communicate only via a classical channel. We show that it is in general impossible to realize a two-party quantum functionality with black-box simulation in the case of malicious quantum adversaries. We provide a compiler that takes as input a classical proof of quantum knowledge (PoQK) protocol for a QMA relation R and outputs a zero-knowledge PoQK for R that can be verified by classical parties.
  arXiv  Detail & Related papers  (2020-10-15T17:55:31Z)
• 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)
• Gaussian conversion protocols for cubic phase state generation [104.23865519192793]
  Universal quantum computing with continuous variables requires non-Gaussian resources. The cubic phase state is a non-Gaussian state whose experimental implementation has so far remained elusive. We introduce two protocols that allow for the conversion of a non-Gaussian state to a cubic phase state.
  arXiv  Detail & Related papers  (2020-07-07T09:19:49Z)
• A device-independent protocol for XOR oblivious transfer [0.0]
  Oblivious transfer is a cryptographic primitive where Alice has two bits and Bob wishes to learn some function of them. In this work we give a fully device-independent quantum protocol for XOR oblivious transfer.
  arXiv  Detail & Related papers  (2020-06-11T17:59:46Z)

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.