Unconditionally secure bit commitment

被引：125

作者：

Kent, A ^{[1
]}

机构：

[1] Univ Cambridge, Dept Appl Math & Theoret Phys, Cambridge CB3 9EW, England

来源：

PHYSICAL REVIEW LETTERS | 1999年 / 83卷 / 07期

关键词：

D O I：

10.1103/PhysRevLett.83.1447

中图分类号：

O4 [物理学];

学科分类号：

0702 ;

摘要：

We describe a new classical bit commitment protocol based on cryptographic constraints imposed by special relativity. The protocol is unconditionally secure against classical or quantum attacks. It evades the no-go results of Mayers, Lo, and Chau by requiring from Alice a sequence of communications, including a postrevelation verification, each of which is guaranteed to be independent of its predecessor.

引用

页码：1447 / 1450

页数：4

共 17 条

[1]

ARDEHALI M, QUANTPH9505019

[2]

Bennett C. H., 1984, PROC IEEE INT C COMP, P175, DOI [DOI 10.1016/J.TCS.2014.05.025, 10.1016/j.tcs.2014.05.025]

[3]

BENOR M, 1991, P 20 ANN ACM S THEOR, P113

[4]

BLUM M, 1982, P IEEE SPRING COMPCO, P133

[5]

BRASSARD G, 1991, LECT NOTES COMPUT SC, V537, P49

[6]

Brassard G., 1993, Proceedings. 34th Annual Symposium on Foundations of Computer Science (Cat. No.93CH3368-8), P362, DOI 10.1109/SFCS.1993.366851

[7]

BRASSARD G, QUANTPH9806031

[8]

BRASSARD G, 1988, LECT NOTES COMPUTER, V325

[9]

KILIAN J, 1991, P 20 ANN ACM S THEOR, P20

[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

← 1 2 →