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

Chinese Journal of Physics

Two-server quantum message oblivious transfer based on entanglement swapping

Rui‐Chen Huang, Yu‐Guang Yang, Guang‐Bao Xu, Dong‐Huan Jiang, Yi‐Hua Zhou, Wei‐Min Shi

Published Aug 6, 2026• 1 citation
Publisher
DOI
10.1016/j.cjph.2026.08.005

Related papers

Quantum Oblivious Transfer Based on Entanglement Swapping

Xinglan Zhang, Fei Chen, Yankun Guo +2 more

International Journal of Theoretical Physics•Aug 18, 2023•5 citations

Quantum oblivious transfer for quantum messages

Yu‐Guang Yang, Shi Qiu, Yan Chang +3 more

Oblivious transfer (OT) is an essential building block for secure multiparty computation. Up to now, one- and two-server OT protocols have been investigated. It has been proven that unconditionally secure one-server OT is impossible even with the quantum system. Recently, Hayashi and Song proposed the first two-server OT protocol for quantum messages [Adv. Quantum Technol. 7, 2300184 (2024)], which is the only one for two-server OT for quantum messages to our knowledge. This protocol has the assumption that two quantum servers do not communicate with each other. However, it is unrealistic to make such an assumption. In addition, an equation error occurs in the protocol description. To tackle these issues, we first point out the equation error existent in the protocol of Hayashi and Song and correct it. Then, we propose a two-server OT protocol for quantum messages by using entanglement swapping. Security analysis shows that the user privacy holds even if the two quantum servers communicate mutually.

Physical Review A•Sep 8, 2025•6 citations

Two‐Server Oblivious Transfer for Quantum Messages

Masahito Hayashi, Seunghoan Song

Abstract Oblivious transfer is considered as a cryptographic primitive task for quantum information processing over a quantum network. It is an essential building block for secure multiparty computation. It is known that one‐server oblivious transfer is impossible. When the task is the transmission of classical messages, protocols for two‐server oblivious transfer exist, i.e., existing protocols work under the assumption that two servers do not communicate with each other. However, when the task is the transmission of a quantum state, no existing method works even under the above two‐server assumption. Two‐server oblivious transfer protocols for quantum messages are proposed for the first time.

arXiv:2211.03308•Advanced Quantum Technologies•Feb 8, 2024•2 citations

Quantum message exchanging network using entanglement swapping and decoy photons

Negin Fatahi

Scientific Research and Essays•Mar 9, 2012•0 citations

Capacity of K-out-of-N Oblivious Transfer over the Binary Erasure Channel

Amirhossein Shekofteh, Rémi A. Chou

We study K-out-of-N oblivious transfer (OT) over a binary erasure channel (BEC) and a public noiseless channel, under an honest-but-curious model. In this setting, a client retrieves K out of N messages stored by a server; the protocol must guarantee that the unselected messages remain private to the server and that the client’s choices remain hidden from the server. We show that the K-out-of-N OT capacity over a BEC with erasure probability ϵ is $C = \min \left({\frac{{K\varepsilon }}{{N - K}},1 - \varepsilon }\right).$ This characterization recovers the known capacity for 1-out-of-2 OT and, for 1-out-of-N OT, recovers the established capacity when $\frac{{N - 1}}{N} \leq \varepsilon $ while further establishing the capacity for all ϵ ∈ [0,1]. We also show that the naive K-out-of-N OT construction obtained by repeating an optimal 1-out-of-N OT protocol K times is suboptimal.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2026•1 citation

Two Way Quantum Direct Communication Protocol Using Entanglement Swapping

Hyung-Jin Yang, Changho Hong, Jong In Lim +1 more

Journal of the Korean Physical Society•Jun 14, 2010•11 citations
Oblivious transfer (OT) is an essential building block for secure multiparty computation. Up to now, one- and two-server OT protocols have been investigated. It has been proven that unconditionally secure one-server OT is impossible even with the quantum system. Recently, Hayashi and Song proposed the first two-server OT protocol for quantum messages [Adv. Quantum Technol. 7, 2300184 (2024)], which is the only one for two-server OT for quantum messages to our knowledge. This protocol has the assumption that two quantum servers do not communicate with each other. However, it is unrealistic to make such an assumption. In addition, an equation error occurs in the protocol description. To tackle these issues, we first point out the equation error existent in the protocol of Hayashi and Song and correct it. Then, we propose a two-server OT protocol for quantum messages by using entanglement swapping. Security analysis shows that the user privacy holds even if the two quantum servers communicate mutually.
Abstract Oblivious transfer is considered as a cryptographic primitive task for quantum information processing over a quantum network. It is an essential building block for secure multiparty computation. It is known that one‐server oblivious transfer is impossible. When the task is the transmission of classical messages, protocols for two‐server oblivious transfer exist, i.e., existing protocols work under the assumption that two servers do not communicate with each other. However, when the task is the transmission of a quantum state, no existing method works even under the above two‐server assumption. Two‐server oblivious transfer protocols for quantum messages are proposed for the first time.
We study K-out-of-N oblivious transfer (OT) over a binary erasure channel (BEC) and a public noiseless channel, under an honest-but-curious model. In this setting, a client retrieves K out of N messages stored by a server; the protocol must guarantee that the unselected messages remain private to the server and that the client’s choices remain hidden from the server. We show that the K-out-of-N OT capacity over a BEC with erasure probability ϵ is C=min⁡(KεN−K,1−ε).C = \min \left({\frac{{K\varepsilon }}{{N - K}},1 - \varepsilon }\right).C=min(N−KKε​,1−ε). This characterization recovers the known capacity for 1-out-of-2 OT and, for 1-out-of-N OT, recovers the established capacity when $\frac{{N - 1}}{N} \leq \varepsilon $ while further establishing the capacity for all ϵ ∈ [0,1]. We also show that the naive K-out-of-N OT construction obtained by repeating an optimal 1-out-of-N OT protocol K times is suboptimal.