Quantum protocol for cheat-sensitive weak coin flipping

被引:51
作者
Spekkens, RW
Rudolph, T
机构
[1] Univ Toronto, Toronto, ON M5S 1A7, Canada
[2] Bell Labs, Murray Hill, NJ 07974 USA
[3] Univ Vienna, Inst Expt Phys, A-1090 Vienna, Austria
关键词
D O I
10.1103/PhysRevLett.89.227901
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
We present a quantum protocol for the task of weak coin flipping. We find that, for one choice of parameters in the protocol, the maximum probability of a dishonest party winning the coin flip if the other party is honest is 1/root2. We also show that if parties restrict themselves to strategies wherein they cannot be caught cheating, their maximum probability of winning can be even smaller. As such, the protocol offers additional security in the form of cheat sensitivity.
引用
收藏
页数:4
相关论文
共 12 条
[1]  
Aharonov D., 2000, Proceedings of the Thirty Second Annual ACM Symposium on Theory of Computing, P705, DOI 10.1145/335305.335404
[2]  
AMBAINIS A, QUANTPH020463
[3]  
AMBAINIS A, COMMUNICATION
[4]  
[Anonymous], 2001, P 33 ANN ACM S THEOR, DOI DOI 10.1145/380752.380788.8
[5]  
BLUM M, 1982, P IEEE SPRING COMPCO, P133
[6]  
HARDY L, QUANTPH9911043
[7]   FIDELITY FOR MIXED QUANTUM STATES [J].
JOZSA, R .
JOURNAL OF MODERN OPTICS, 1994, 41 (12) :2315-2323
[8]  
Kilian J., 1988, Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, P20, DOI 10.1145/62212.62215
[9]  
Kitaev A, UNPUB
[10]   Why quantum bit commitment and ideal quantum coin tossing are impossible [J].
Lo, HK ;
Chau, HF .
PHYSICA D-NONLINEAR PHENOMENA, 1998, 120 (1-2) :177-187