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

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

R Amiri, R Starek, D Reichmuth, Ittoop Vergheese Puthoor, M Micuda, L Mista, M Dusek, P Wallden, E Andersson

Published Mar 1, 2021• 0 citations
Publisher
DOI
10.25405/ncl.34498818

Related papers

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

L Stroh, N Horova, R Starek +4 more

•May 4, 2023•0 citations

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

Ryan Amiri, Robert Stárek, David Reichmuth +6 more

Oblivious transfer is an important primitive in modern cryptography.Applications include secure multiparty computation, oblivious sampling, e-voting, and signatures.Information-theoretically secure perfect 1-out-of 2 oblivious transfer is impossible to achieve.Imperfect variants, where both participants' ability to cheat is still limited, are possible using quantum means while remaining classically impossible.Precisely what security parameters are attainable remains unknown.We introduce a theoretical framework for studying semirandom quantum oblivious transfer, which is shown to be equivalent to regular oblivious transfer in terms of cheating probabilities.We then use it to derive bounds on cheating.We also present a protocol with lower cheating probabilities than previous schemes, together with its optical realization.We show that a lower bound of 2 3 on the minimum achievable cheating probability can be directly derived for semirandom protocols using a different method and definition of cheating than used previously.The lower bound increases from 23 to approximately 0.749 if the states output by the protocol are pure and symmetric.The oblivious transfer scheme we present uses unambiguous state elimination measurements and can be implemented with the same technological requirements as standard quantum cryptography.In particular, it does not require honest participants to prepare or measure entangled states.The cheating probabilities are 3 4 and approximately 0.729 for sender and receiver, respectively, which is lower than in existing protocols.Using a photonic testbed, we have implemented the protocol with honest parties, as well as optimal cheating strategies.Because of the asymmetry of the receiver's and sender's cheating probabilities, the protocol can be combined with a "trivial" protocol to achieve an overall protocol with lower average cheating probabilities of approximately 0.74 for both sender and receiver.This demonstrates that, interestingly, protocols where the final output states are pure and symmetric are not optimal in terms of average cheating probability.

arXiv:2007.04712•PRX Quantum•Mar 1, 2021•32 citations

Practical efficient 1-out-of-n quantum oblivious transfer protocol

Xue Jun Zhang, Chun‐Yan Wei, Su‐Juan Qin +2 more

Quantum Information Processing•Jan 31, 2023•9 citations

QUANTUM OBLIVIOUS TRANSFER: BOUNDS AND APPLICATIONS

HU YANGLIN

•Sep 12, 2025•0 citations

Error-tolerant oblivious transfer in the noisy-storage model

Cosmo Lupo, James T. Peat, Erika Andersson +1 more

The noisy-storage model of quantum cryptography allows for information-theoretically secure two-party computation based on the assumption that a cheating user has at most access to an imperfect, noisy quantum memory, whereas the honest users do not need a quantum memory at all. In general, the more noisy the quantum memory of the cheating user, the more secure the implementation of oblivious transfer, which is a primitive that allows universal secure two-party and multiparty computation. For experimental implementations of oblivious transfer, one has to consider that also the devices held by the honest users are lossy and noisy, and error correction needs to be applied to correct these trusted errors. The latter are expected to reduce the security of the protocol, since a cheating user may hide themselves in the trusted noise. Here we leverage entropic uncertainty relations to derive tight bounds on the security of oblivious transfer with a trusted and untrusted noise. In particular, we discuss noisy storage and bounded storage, with independent and correlated noise.

arXiv:2302.04236•Physical Review Research•Sep 7, 2023•7 citations

An efficient quantum oblivious transfer protocol

Sushmita Sarkar, Vikas Srivastava, Tapaswini Mohanty +2 more

Cluster Computing•Jul 8, 2024•5 citations
Oblivious transfer is an important primitive in modern cryptography.Applications include secure multiparty computation, oblivious sampling, e-voting, and signatures.Information-theoretically secure perfect 1-out-of 2 oblivious transfer is impossible to achieve.Imperfect variants, where both participants' ability to cheat is still limited, are possible using quantum means while remaining classically impossible.Precisely what security parameters are attainable remains unknown.We introduce a theoretical framework for studying semirandom quantum oblivious transfer, which is shown to be equivalent to regular oblivious transfer in terms of cheating probabilities.We then use it to derive bounds on cheating.We also present a protocol with lower cheating probabilities than previous schemes, together with its optical realization.We show that a lower bound of 2 3 on the minimum achievable cheating probability can be directly derived for semirandom protocols using a different method and definition of cheating than used previously.The lower bound increases from 23 to approximately 0.749 if the states output by the protocol are pure and symmetric.The oblivious transfer scheme we present uses unambiguous state elimination measurements and can be implemented with the same technological requirements as standard quantum cryptography.In particular, it does not require honest participants to prepare or measure entangled states.The cheating probabilities are 3 4 and approximately 0.729 for sender and receiver, respectively, which is lower than in existing protocols.Using a photonic testbed, we have implemented the protocol with honest parties, as well as optimal cheating strategies.Because of the asymmetry of the receiver's and sender's cheating probabilities, the protocol can be combined with a "trivial" protocol to achieve an overall protocol with lower average cheating probabilities of approximately 0.74 for both sender and receiver.This demonstrates that, interestingly, protocols where the final output states are pure and symmetric are not optimal in terms of average cheating probability.
The noisy-storage model of quantum cryptography allows for information-theoretically secure two-party computation based on the assumption that a cheating user has at most access to an imperfect, noisy quantum memory, whereas the honest users do not need a quantum memory at all. In general, the more noisy the quantum memory of the cheating user, the more secure the implementation of oblivious transfer, which is a primitive that allows universal secure two-party and multiparty computation. For experimental implementations of oblivious transfer, one has to consider that also the devices held by the honest users are lossy and noisy, and error correction needs to be applied to correct these trusted errors. The latter are expected to reduce the security of the protocol, since a cheating user may hide themselves in the trusted noise. Here we leverage entropic uncertainty relations to derive tight bounds on the security of oblivious transfer with a trusted and untrusted noise. In particular, we discuss noisy storage and bounded storage, with independent and correlated noise.