A Computationally Secure Quantum Oblivious Transfer Scheme

Author(s):  
Xin Lu ◽  
Zhi Ma ◽  
Deng-Guo Feng
1994 ◽  
Vol 41 (12) ◽  
pp. 2445-2454 ◽  
Author(s):  
Claude Crépeau

Optik ◽  
2015 ◽  
Vol 126 (23) ◽  
pp. 3838-3843 ◽  
Author(s):  
Yu-Guang Yang ◽  
Si-Jia Sun ◽  
Qing-Xiang Pan ◽  
Peng Xu

2018 ◽  
Vol 8 (1) ◽  
Author(s):  
Yao-Hsin Chou ◽  
Guo-Jyun Zeng ◽  
Shu-Yu Kuo

2012 ◽  
Vol 263-266 ◽  
pp. 3079-3082
Author(s):  
Xiao Qiang Guo ◽  
Yan Yan ◽  
Hong Wang ◽  
Yi Shuo Shi

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.


Sign in / Sign up

Export Citation Format

Share Document