quantum oblivious transfer
Recently Published Documents


TOTAL DOCUMENTS

32
(FIVE YEARS 6)

H-INDEX

7
(FIVE YEARS 1)

2021 ◽  
pp. 2100125
Author(s):  
Ping Wang ◽  
Rui Zhang ◽  
Guohao Jiang ◽  
Zhiwei Sun

PRX Quantum ◽  
2021 ◽  
Vol 2 (1) ◽  
Author(s):  
Ryan Amiri ◽  
Robert Stárek ◽  
David Reichmuth ◽  
Ittoop V. Puthoor ◽  
Michal Mičuda ◽  
...  

2019 ◽  
Vol 58 (10) ◽  
pp. 3333-3341
Author(s):  
MeiLing Zhang ◽  
Jin Li ◽  
Sha Shi ◽  
YuanHua Liu ◽  
QingJi Zheng

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

2018 ◽  
Vol 8 (10) ◽  
pp. 1990 ◽  
Author(s):  
Yaqi Song ◽  
Li Yang

Oblivious transfer (OT) and bit commitment (BC) are two-party cryptographic protocols which play crucial roles in the construction of various cryptographic protocols. We propose three practical quantum cryptographic protocols in this paper. We first construct a practical quantum random oblivious transfer (R-OT) protocol based on the fact that non-orthogonal states cannot be reliably distinguished. Then, we construct a fault-tolerant one-out-of-two oblivious transfer ( O T 1 2 ) protocol based on the quantum R-OT protocol. Afterwards, we propose a quantum bit commitment (QBC) protocol which executes the fault-tolerant O T 1 2 several times. Mayers, Lo and Chau (MLC) no-go theorem proves that QBC protocol cannot be unconditionally secure. However, we find that computing the unitary transformation of no-go theorem attack needs so many resources that it is not realistically implementable. We give a definition of physical security for QBC protocols and prove that the practical QBC we proposed is physically secure and can be implemented in the real world.


2018 ◽  
Vol 16 (04) ◽  
pp. 1850039 ◽  
Author(s):  
Xiaogang Cheng ◽  
Ren Guo ◽  
Yonghong Chen

OT (Oblivious transfer) is a fundamental primitive in cryptography. But it is well known that in quantum cryptography, unconditionally secure OT is impossible. A variant of OT, i.e. randomized OT, is presented. We then show how to realize this variant in quantum cryptography with some security relaxations, which is inevitable because of the well-known impossible result in quantum cryptography. We also present a new secure computational model, namely HRC (Hacker-Resistant Computation) model. Since on today’s Internet there are more and more hackers and increased cyber threat, knowing how to protect the information and privacy stored on our computer and on cloud servers is very important, even when the computer or server has been breached by hackers. Finally, some interesting applications of the randomized OT variant to HRC are discussed.


Sign in / Sign up

Export Citation Format

Share Document