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

Relativistic quantum oblivious transfer

Muhammad Nadeem

Published Jul 25, 2014• 2 citations
OpenAlex

Related papers

Can relativistic bit commitment lead to secure quantum oblivious transfer?

Guang Ping He

arXiv:1210.5681•The European Physical Journal D•Mar 31, 2015•8 citations

Impossibility of composable Oblivious Transfer in relativistic quantum cryptography

Lorenzo Laneve, Lídia del Rio

We study the cryptographic primitive Oblivious Transfer; a composable construction of this resource would allow arbitrary multi-party computation to be carried out in a secure way, i.e. to compute functions in a distributed way while keeping inputs from different parties private. First we review a framework that allows us to analyze composability of classical and quantum cryptographic protocols in special relativity: Abstract Cryptography implemented with Causal Boxes. We then (1) explore and formalize different versions of oblivious transfer found in the literature, (2) prove that their equivalence holds also in relativistic quantum settings, (3) show that it is impossible to composably construct any of these versions of oblivious transfer from only classical or quantum communication among distrusting agents in relativistic settings, (4) prove that the impossibility also extends to multi-party computation, and (5) provide a mutual construction between oblivious transfer and bit commitment.

arXiv:2106.11200•Jun 21, 2021•4 citations

Practical Quantum Oblivious Transfer

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

Springer eBooks•Aug 11, 2007•230 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

Practical and unconditionally secure spacetime-constrained oblivious transfer

Damián Pitalúa-García, Iordanis Kerenidis

Spacetime-constrained oblivious transfer (SCOT) extends the fundamental primitive of oblivious transfer to Minkowski space. SCOT and location-oblivious data transfer (LODT) are the only known cryptographic tasks with classical inputs and outputs for which unconditional security needs both quantum theory and relativity. We give an unconditionally secure SCOT protocol that, contrasting previous SCOT and LODT protocols, is practical to implement with current technology, where distant agents need only communicate classical information, while quantum communication occurs at a single location. We also show that our SCOT protocol can be used to implement unconditionally secure quantum relativistic bit commitment.

arXiv:1811.07410•Physical Review A•Sep 24, 2018•23 citations

Study on Quantum Oblivious Transfer

Xiao Qiang Guo, Yan Yan, Hong Wang +1 more

The Oblivious Transfer (OT) is a typical foundation agreement of secure multi-party computations. It can be used to solve the “ Millionaire” interesting question raised by the winner of the Turing Award in 1982, Mr. Yao , thus to build more complex secure multi-party computation protocol or to solve practical problems,such as electronic voting, elections, e-commerce. Using of the quantum channel and the principles of the quantum mechanics , Quantum Oblivious Transfer (QOT) can be solve the classic oblivious transfer problems. QOT can be achieved higher security and higher efficiency than the Classic Oblivious Transfer, while it also has a unique advantage in found eavesdropping. We had given a very novel QOT scheme based on three-particle entangled states. Although the use more particles , the process is better concise.

Applied Mechanics and Materials•Dec 1, 2012•0 citations
We study the cryptographic primitive Oblivious Transfer; a composable construction of this resource would allow arbitrary multi-party computation to be carried out in a secure way, i.e. to compute functions in a distributed way while keeping inputs from different parties private. First we review a framework that allows us to analyze composability of classical and quantum cryptographic protocols in special relativity: Abstract Cryptography implemented with Causal Boxes. We then (1) explore and formalize different versions of oblivious transfer found in the literature, (2) prove that their equivalence holds also in relativistic quantum settings, (3) show that it is impossible to composably construct any of these versions of oblivious transfer from only classical or quantum communication among distrusting agents in relativistic settings, (4) prove that the impossibility also extends to multi-party computation, and (5) provide a mutual construction between oblivious transfer and bit commitment.
Spacetime-constrained oblivious transfer (SCOT) extends the fundamental primitive of oblivious transfer to Minkowski space. SCOT and location-oblivious data transfer (LODT) are the only known cryptographic tasks with classical inputs and outputs for which unconditional security needs both quantum theory and relativity. We give an unconditionally secure SCOT protocol that, contrasting previous SCOT and LODT protocols, is practical to implement with current technology, where distant agents need only communicate classical information, while quantum communication occurs at a single location. We also show that our SCOT protocol can be used to implement unconditionally secure quantum relativistic bit commitment.
The Oblivious Transfer (OT) is a typical foundation agreement of secure multi-party computations. It can be used to solve the “ Millionaire” interesting question raised by the winner of the Turing Award in 1982, Mr. Yao , thus to build more complex secure multi-party computation protocol or to solve practical problems,such as electronic voting, elections, e-commerce. Using of the quantum channel and the principles of the quantum mechanics , Quantum Oblivious Transfer (QOT) can be solve the classic oblivious transfer problems. QOT can be achieved higher security and higher efficiency than the Classic Oblivious Transfer, while it also has a unique advantage in found eavesdropping. We had given a very novel QOT scheme based on three-particle entangled states. Although the use more particles , the process is better concise.