The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Is Quantum Bit Commitment Really Possible?
Open accessAbstract
We show that all proposed quantum bit commitment schemes are insecure because the sender, Alice, can almost always cheat successfully by using an Einstein-Podolsky-Rosen--type of attack and delaying her measurement until she opens her commitment.
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
Can Quantum-Mechanical Description of Physical Reality Be Considered Complete?
Einstein, A., Podolsky, B., & Rosen, N. (1935) · Physical Review · doi:10.1103/physrev.47.777 · Cited by 16,654
Quantum cryptography based on Bell’s theorem
Ekert, A. K. (1991) · Physical Review Letters · doi:10.1103/physrevlett.67.661 · Cited by 10,777
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
Wiesner, S. (1983) · ACM SIGACT News · doi:10.1145/1008908.1008920 · Cited by 1,520
Unconditionally Secure Quantum Bit Commitment is Impossible
Mayers, D. (1997) · Physical Review Letters · doi:10.1103/physrevlett.78.3414 · Cited by 748
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
Advances in Cryptology: Proceedings of Crypto 84
Blakley, G. R., & Chaum, D. (1985) · Medical Entomology and Zoology · Cited by 502
Insecurity of quantum secure computations
Lo, H.-K. (1997) · Physical Review A · doi:10.1103/physreva.56.1154 · Cited by 479
Self-citationBennett, C. H., Brassard, G., & Ekert, A. K. (1992) · Scientific American · doi:10.1038/scientificamerican1092-50 · Cited by 322
A New Proof of the Quantum Noiseless Coding Theorem
Jozsa, R., & Schumacher, B. (1994) · Journal of Modern Optics · doi:10.1080/09500349414552191 · Cited by 304
Practical Quantum Oblivious Transfer
Bennett, C. H., Brassard, G., Crépeau, C., & Skubiszewska, M.-H. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-46766-1_29 · Cited by 224
Why Quantum Bit Commitment And Ideal Quantum Coin Tossing Are ImpossiblePreprint
Lo, H.-K., & Chau, H. F. (1998) · Cited by 177
Self-citationA 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
Quantum Bit Commitment and Coin Tossing Protocols
Brassard, G., & Crépeau, C. (2007) · Springer eBooks · doi:10.1007/3-540-38424-3_4 · Cited by 89
The Trouble with Quantum Bit CommitmentPreprint
Mayers, D. (1996) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/9603015 · Cited by 83
Proceedings of the fourth workshop on Physics and computation
Toffoli, T., & Biafore, M. (1998) · Cited by 56
25 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
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
Unconditional Security of Quantum Key Distribution over Arbitrarily Long Distances
Lo, H.-K., & Chau, H. F. (1999) · Science · doi:10.1126/science.283.5410.2050 · Cited by 1,858
Self-citation
Metadata
- Authors
- Lo, H.-K., & Chau, H. F.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 1997-04-28
- Volume
- 78
- Issue
- 17
- Pages
- 3410-3413
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W1782172301
- Cited by
- 606
- References
- 18
- FWCI
- 23.30
- 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.