Open Access
ARTICLE
Quantum Oblivious Transfer with Reusable Bell State
1 Department of Computer Science and Engineering, National Chung Hsing University, Taichung, 40227, Taiwan
2 Department of Physics, National Taiwan University, Taipei, 106216, Taiwan
3 Department of Computer Science and Information Engineering, National Chi Nan University, Puli, 54561, Taiwan
4 Department of Computer Science and Information Engineering, National Cheng Kung University, Tainan, 701401, Taiwan
* Corresponding Author: Fan-Hsun Tseng. Email:
Computers, Materials & Continua 2023, 74(1), 915-932. https://doi.org/10.32604/cmc.2023.032320
Received 13 May 2022; Accepted 24 June 2022; Issue published 22 September 2022
Abstract
In cryptography, oblivious transfer (OT) is an important multi-party cryptographic primitive and protocol, that is suitable for many upper-layer applications, such as secure computation, remote coin-flipping, electrical contract signing and exchanging secrets simultaneously. However, some no-go theorems have been established, indicating that one-out-of-two quantum oblivious transfer (QOT) protocols with unconditional security are impossible. Fortunately, some one-out-of-two QOT protocols using the concept of Crépeau’s reduction have been demonstrated not to conform to Lo’s no-go theorem, but these protocols require more quantum resources to generate classical keys using all-or-nothing QOT to construct one-out-of-two QOT. This paper proposes a novel and efficient one-out-of-two QOT which uses quantum resources directly instead of wasting unnecessary resources to generate classical keys. The proposed protocol is not covered by Lo’s no-go theorem, and it is able to check the sender’s loyalty and avoid the attack from the receiver. Moreover, the entangled state of the proposed protocol is reusable, so it can provide more services for the participants when necessary. Compared with other QOT protocols, the proposed protocol is more secure, efficient, and flexible, which not only can prevent external and internal attacks, but also reduce the required resources and resource distribution time.Keywords
Cite This Article
This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.