The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Unconditionally Secure Quantum Bit Commitment is Impossible
Open accessAbstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Quantum cryptography: Public key distribution and coin tossing
Bennett, C. H., & Brassard, G. (2014) · Theoretical Computer Science · doi:10.1016/j.tcs.2014.05.025 · Cited by 8,299
Fidelity for Mixed Quantum States
Jozsa, R. (1994) · Journal of Modern Optics · doi:10.1080/09500349414552171 · Cited by 1,911
Experimental quantum cryptography
Bennett, C. H., Bessette, F., Brassard, G., Salvail, L., & Smolin, J. (1992) · Journal of Cryptology · doi:10.1007/bf00191318 · Cited by 1,614
Schmidt, E. (1907) · Mathematische Annalen · doi:10.1007/bf01449770 · Cited by 973
Proceedings. 45th Annual IEEE Symposium on Foundations of Computer Science
(2004) · 45th Annual IEEE Symposium on Foundations of Computer Science · doi:10.1109/focs.2004.4 · Cited by 805
A complete classification of quantum ensembles having a given density matrix
Hughston, L. P., Jozsa, R., & Wootters, W. K. (1993) · Physics Letters A · doi:10.1016/0375-9601(93)90880-9 · Cited by 649
Is Quantum Bit Commitment Really Possible?
Lo, H.-K., & Chau, H. F. (1997) · Physical Review Letters · doi:10.1103/physrevlett.78.3410 · Cited by 606
Limits on the provable consequences of one-way permutations
Impagliazzo, R., & Rudich, S. (1989) · Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89 · doi:10.1145/73007.73012 · Cited by 575
Advances in Cryptology: Proceedings of Crypto 84
Blakley, G. R., & Chaum, D. (1985) · Medical Entomology and Zoology · Cited by 502
A quantum bit commitment scheme provably unbreakable by both parties
Gilles Brassard, A., Crépeau, C., Jozsa, R., & Langlois, D. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1993.366851 · Cited by 148
Proceedings of the 44th symposium on Theory of Computing
Karloff, H. J., & Pitassi, T. (2012) · Cited by 130
The Trouble with Quantum Bit CommitmentPreprint
Mayers, D. (1996) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/9603015 · Cited by 83
Self-citation25 years of quantum cryptography
Brassard, G., & Crépeau, C. (1996) · ACM SIGACT News · doi:10.1145/235666.235669 · Cited by 51
Cited by
Horodecki, R., Horodecki, P., Horodecki, M., & Horodecki, K. (2009) · Reviews of Modern Physics · doi:10.1103/revmodphys.81.865 · Cited by 10,118
Gisin, N., Ribordy, G., Tittel, W., & Zbinden, H. (2002) · Reviews of Modern Physics · doi:10.1103/revmodphys.74.145 · Cited by 8,515
The security of practical quantum key distribution
Scarani, V., Bechmann-Pasquinucci, H., Cerf, N. J., Dušek, M., Lütkenhaus, N., & Peev, M. (2009) · Reviews of Modern Physics · doi:10.1103/revmodphys.81.1301 · Cited by 3,726
Quantum information and computation
Bennett, C. H., & DiVincenzo, D. P. (2000) · Nature · doi:10.1038/35005001 · Cited by 3,263
Quantum internet: a vision for the road ahead
Wehner, S., Elkouss, D., & Hanson, R. (2018) · Science · doi:10.1126/science.aam9288 · Cited by 2,467
Metadata
- Authors
- Mayers, D.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 1997-04-28
- Volume
- 78
- Issue
- 17
- Pages
- 3414-3417
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W2075695434
- Cited by
- 748
- References
- 13
- FWCI
- 22.82
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.