Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Noninteractive xor Quantum Oblivious Transfer: Optimal Protocols and Their Experimental Implementations

L Stroh, N Horova, R Starek, Ittoop Vergheese Puthoor, M Micuda, M Dusek, E Andersson

Published May 4, 2023• 0 citations
Publisher
DOI
10.25405/ncl.34498839

Related papers

Imperfect 1-Out-of-2 Quantum Oblivious Transfer: Bounds, a Protocol, and its Experimental Implementation

R Amiri, R Starek, D Reichmuth +6 more

•Mar 1, 2021•0 citations

Noninteractive xor Quantum Oblivious Transfer: Optimal Protocols and Their Experimental Implementations

Lara Stroh, Nikola Horová, Robert Stárek +4 more

Oblivious transfer (OT) is an important cryptographic primitive.Any multiparty computation can be realized with OT as building block.XOR oblivious transfer (XOT) is a variant where the sender Alice has two bits and a receiver Bob obtains either the first bit, the second bit, or their XOR.Bob should not learn anything more than this and Alice should not learn what Bob has learnt.Perfect quantum OT with information-theoretic security is known to be impossible.We determine the smallest possible cheating probabilities for unrestricted dishonest parties in noninteractive quantum XOT protocols using symmetric pure states and present an optimal protocol, which outperforms classical protocols.We also "reverse" this protocol, so that Bob becomes sender of a quantum state and Alice the receiver who measures it, while still implementing oblivious transfer from Alice to Bob.Cheating probabilities for both parties stay the same as for the unreversed protocol.We optically implement both the unreversed and the reversed protocols, and cheating strategies, noting that the reversed protocol is easier to implement.

arXiv:2209.11300•PRX Quantum•May 4, 2023•16 citations

An efficient quantum oblivious transfer protocol

Sushmita Sarkar, Vikas Srivastava, Tapaswini Mohanty +2 more

Cluster Computing•Jul 8, 2024•6 citations

Experimental realization of quantum oblivious transfer

David A. Fattal, Marco Fiorentino B, Anthony Chefles +1 more

Conference on Lasers and Electro-Optics•Jan 1, 2008•1 citation

Quantum cryptography beyond quantum key distribution: variants of quantum oblivious transfer

Erika Andersson, Lara Stroh, Ittoop Vergheese Puthoor +6 more

Modern cryptography is more than sending secret messages, and quantum cryptography is more than quantum key distribution. One example is oblivious transfer, which is interesting partly because it can be used to implement secure multiparty computation. We discuss a protocol for quantum XOR oblivious transfer, and how non-interactive quantum oblivious transfer protocols can be “reversed”, so that oblivious transfer is still implemented from a sender to a receiver, but so that it is the receiver who sends a quantum state to the sender, who measures it, instead of the other way round. This is useful when one party can only prepare and send quantum states, and the other party can only measure them, which is often the case in practical quantum communication systems. Both the “original” XOR oblivious transfer protocol and its reversed version have been implemented optically. We also discuss how quantum random access codes can be connected with quantum oblivious transfer.

Quantum Computing, Communication, and Simulation•Mar 8, 2023•1 citation

A device-independent protocol for XOR oblivious transfer

Srijita Kundu, Jamie Sikora, Ernest Y.-Z. Tan

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.

arXiv:2006.06671•Quantum•May 30, 2022•26 citations
Oblivious transfer (OT) is an important cryptographic primitive.Any multiparty computation can be realized with OT as building block.XOR oblivious transfer (XOT) is a variant where the sender Alice has two bits and a receiver Bob obtains either the first bit, the second bit, or their XOR.Bob should not learn anything more than this and Alice should not learn what Bob has learnt.Perfect quantum OT with information-theoretic security is known to be impossible.We determine the smallest possible cheating probabilities for unrestricted dishonest parties in noninteractive quantum XOT protocols using symmetric pure states and present an optimal protocol, which outperforms classical protocols.We also "reverse" this protocol, so that Bob becomes sender of a quantum state and Alice the receiver who measures it, while still implementing oblivious transfer from Alice to Bob.Cheating probabilities for both parties stay the same as for the unreversed protocol.We optically implement both the unreversed and the reversed protocols, and cheating strategies, noting that the reversed protocol is easier to implement.
Modern cryptography is more than sending secret messages, and quantum cryptography is more than quantum key distribution. One example is oblivious transfer, which is interesting partly because it can be used to implement secure multiparty computation. We discuss a protocol for quantum XOR oblivious transfer, and how non-interactive quantum oblivious transfer protocols can be “reversed”, so that oblivious transfer is still implemented from a sender to a receiver, but so that it is the receiver who sends a quantum state to the sender, who measures it, instead of the other way round. This is useful when one party can only prepare and send quantum states, and the other party can only measure them, which is often the case in practical quantum communication systems. Both the “original” XOR oblivious transfer protocol and its reversed version have been implemented optically. We also discuss how quantum random access codes can be connected with quantum oblivious transfer.
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.