ARTÍCULO
TITULO

Practical Quantum Bit Commitment Protocol Based on Quantum Oblivious Transfer

Yaqi Song and Li Yang    

Resumen

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.

 Artículos similares

       
 
Dinara Akhmetsadyk, Arkady Ilyin, Nazim Guseinov and Gary Beall    
SO2 (sulfur dioxide) is a toxic substance emitted into the environment due to burning sulfur-containing fossil fuels in cars, factories, power plants, and homes. This issue is of grave concern because of its negative effects on the environment and human ... ver más
Revista: Computation

 
S.A. Bukashkin,M.A. Cherepnev     Pág. 104 - 108
Recently, many papers have appeared where it is proposed to use the quantum mechanical properties of interatomic interaction to solve cryptographic problems. In fact, we are talking about transferring the solution of the problem of the stability of infor... ver más

 
Phillip Kerger, David E. Bernal Neira, Zoe Gonzalez Izquierdo and Eleanor G. Rieffel    
We present two algorithms in the quantum CONGEST-CLIQUE model of distributed computation that succeed with high probability: one for producing an approximately optimal Steiner tree, and one for producing an exact directed minimum spanning tree, each of w... ver más
Revista: Algorithms

 
Yunyang Zhang, Shiyu Du and Quan Zhang    
The slime mold algorithm (SMA) is a swarm-based metaheuristic algorithm inspired by the natural oscillatory patterns of slime molds. Compared with other algorithms, the SMA is competitive but still suffers from unbalanced development and exploration and ... ver más
Revista: Algorithms

 
Franz Georg Fuchs, Kjetil Olsen Lye, Halvor Møll Nilsen, Alexander Johannes Stasik and Giorgio Sartor    
The quantum approximate optimization algorithm/quantum alternating operator ansatz (QAOA) is a heuristic to find approximate solutions of combinatorial optimization problems. Most of the literature is limited to quadratic problems without constraints. Ho... ver más
Revista: Algorithms