Unconditionally secure quantum bit commitment is impossible

被引:490
作者
Mayers, D
机构
[1] Département IRO, Université de Montréal, C.P. 6128, Montréal, QC, H3C 3J7, Succursale Centre-Ville
关键词
D O I
10.1103/PhysRevLett.78.3414
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
The claim of quantum cryptography has always been that it can provide protocols that are unconditionally secure, that is, for which the security does not depend on any restriction on the time, space, or technology available to the cheaters. We show that this claim does not hold For any quantum bit commitment protocol. Since many cryptographic tasks use bit commitment as a basic primitive, this result implies a severe setback for quantum cryptography. The model used encompasses all reasonable implementations of quantum bit commitment protocols in which the participants have not met before, including those that make use of the theory of special relativity.
引用
收藏
页码:3414 / 3417
页数:4
相关论文
共 15 条
[1]  
Bennett C. H., 1992, Journal of Cryptology, V5, P3, DOI 10.1007/BF00191318
[2]  
BENNETT CH, 1992, LECT NOTES COMPUT SC, V576, P351
[3]  
BENNETT CH, 1984, DEC IEEE INT C COMP, P175
[4]  
Brassard G., 1996, SIGACT News, V27, P13, DOI 10.1145/235666.235669
[5]  
BRASSARD G, 1993, AN S FDN CO, P362
[6]  
BRASSARD G, COMMUNICATION
[7]  
CREPEAU C, 1995, ADV CRYPTOLOGY P CRY, V963, P110
[8]   A COMPLETE CLASSIFICATION OF QUANTUM ENSEMBLES HAVING A GIVEN DENSITY-MATRIX [J].
HUGHSTON, LP ;
JOZSA, R ;
WOOTTERS, WK .
PHYSICS LETTERS A, 1993, 183 (01) :14-18
[9]   FIDELITY FOR MIXED QUANTUM STATES [J].
JOZSA, R .
JOURNAL OF MODERN OPTICS, 1994, 41 (12) :2315-2323
[10]  
KILIAN J, 1988, 20TH P STOC, P20