Information-Theoretic Description of No-go Theorem of a Bit Commitment
| dc.creator | Nambu, Yoshihiro | |
| dc.creator | Chiba-Kohno, Yoshie | |
| dc.date | 2000-11-16 | |
| dc.date | 2000-11-21 | |
| dc.date.accessioned | 2026-07-07T06:01:12Z | |
| dc.date.available | 2026-07-07T06:01:12Z | |
| dc.description | We give a comprehensive and constructive proof of the no-go theorem of a bit commitment given by Mayers, Lo, and Chau from the viewpoint of quantum information theory. It is shown that there is a trade-off relation between information acquired by Bob during the commitment phase and the ability to change a commit bit by Alice during the opening phase. It is clarified that a protocol that is unbiased to both Alice and Bob cannot be, at the same time, secure against both parties. Fundamental physical constraints that govern this no-go theorem are also discussed. | |
| dc.description | 8 pages, 1 figure, Revtex; v2: some improvements in explanation, linguistic errors are corrected, changed format | |
| dc.identifier | https://arxiv.org/abs/quant-ph/0011068 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/0011068 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/89182 | |
| dc.subject | Quantum Physics | |
| dc.title | Information-Theoretic Description of No-go Theorem of a Bit Commitment | |
| dc.type | text |