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

Optik

Quantum oblivious transfer with an untrusted third party

Yu‐Guang Yang, Peng Xu, Ju Tian, Hua Zhang

Published Aug 4, 2014• 21 citations
Publisher
DOI
10.1016/j.ijleo.2014.06.023

Related papers

Quantum Rabin oblivious transfer using two pure states

Lara Stroh, James T. Peat, Mats Kroneberg +2 more

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 ? . Published by the American Physical Society 2024

arXiv:2405.04486•Physical Review Research•Oct 2, 2024•2 citations

Quantum Oblivious Transfer: a secure practical implementation

Marius Nagy, Naya Nagy

Quantum Information Processing•Sep 19, 2016•3 citations

Practical Quantum Oblivious Transfer

Charles H. Bennett, Gilles Brassard, Claude Crépeau +1 more

Springer eBooks•Aug 11, 2007•230 citations

Simple Adaptive Oblivious Transfer Without Random Oracle.

Kaoru Kurosawa, Ryo Nojima

Abstract. Adaptive oblivious transfer (adaptive OT) schemes have wide applications such as oblivious database searches, secure multiparty computation and etc. It is a two-party protocol which simulates an ideal world such that the sender sends M1, · · · , Mn to the trusted third party (TTP) first, and then the receiver receives Mσi from TTP adaptively for i = 1, 2, · · · k. In the standard model, however, the fully simulatable schemes known so far had to rely on dynamic assumptions such as q-strong DH assumption, q-PDDH assumption and q-hidden LRSW assumption. This paper shows two fully simulatable adaptive OT schemes which do not rely on dynamic assumptions in the standard model. Our first scheme holds under the DDH assumption and our second scheme holds under the Paillier’s decisional Nth residuosity assumption, respectively.

•Jan 1, 2009•0 citations

consideration of quantum Oblivious Transfer

Atsushi Waseda, Takayuki TAKAGI, Masakazu Soshi +1 more

IEICE Technical Report; IEICE Tech. Rep.•May 11, 2007•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•8 citations
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 ? . Published by the American Physical Society 2024
Abstract. Adaptive oblivious transfer (adaptive OT) schemes have wide applications such as oblivious database searches, secure multiparty computation and etc. It is a two-party protocol which simulates an ideal world such that the sender sends M1, · · · , Mn to the trusted third party (TTP) first, and then the receiver receives Mσi from TTP adaptively for i = 1, 2, · · · k. In the standard model, however, the fully simulatable schemes known so far had to rely on dynamic assumptions such as q-strong DH assumption, q-PDDH assumption and q-hidden LRSW assumption. This paper shows two fully simulatable adaptive OT schemes which do not rely on dynamic assumptions in the standard model. Our first scheme holds under the DDH assumption and our second scheme holds under the Paillier’s decisional Nth residuosity assumption, respectively.
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.