Related papers: A device-independent protocol for XOR oblivious transfer

A device-independent protocol for XOR oblivious transfer

URL: http://arxiv.org/abs/2006.06671v3
Date: Wed, 18 May 2022 01:56:31 GMT
Title: A device-independent protocol for XOR oblivious transfer
Authors: Srijita Kundu and Jamie Sikora and Ernest Y.-Z. Tan
Abstract summary: 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.
Score: 0.0
License: http://creativecommons.org/licenses/by/4.0/
Abstract: Oblivious transfer is a cryptographic primitive where Alice has two bits and Bob wishes to learn some function of them. Ideally, Alice should not learn Bob's desired function choice and Bob should not learn any more than what is logically implied by the function value. While decent quantum protocols for this task are known, many become completely insecure if an adversary were to control the quantum devices used in the implementation of the protocol. In this work we give a fully device-independent quantum protocol for XOR oblivious transfer.

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)
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)
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)
Oblivious Quantum Computation and Delegated Multiparty Quantum Computation [61.12008553173672]
We propose a new concept, oblivious computation quantum computation, where secrecy of the input qubits and the program to identify the quantum gates are required. Exploiting quantum teleportation, we propose a two-server protocol for this task. Also, we discuss delegated multiparty quantum computation, in which, several users ask multiparty quantum computation to server(s) only using classical communications.
arXiv Detail & Related papers (2022-11-02T09:01:33Z)
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)
A constant lower bound for any quantum protocol for secure function evaluation [0.0]
We show that perfect (or near perfect) security is impossible, even for quantum protocols. Constant lower bounds are of practical interest since they imply the impossibility to arbitrarily amplify the security of quantum protocols.
arXiv Detail & Related papers (2022-03-15T21:40:48Z)
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)
Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms [87.04438831673063]
We present an efficient read-out protocol that yields the classical vector form of the generated state. Our protocol suits the case that the output state lies in the row space of the input matrix. One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
arXiv Detail & Related papers (2020-04-14T11:05:26Z)

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