The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Quantum Key Distribution with Classical Bob
Open accessAbstract
Secure key distribution among two remote parties is impossible when both are classical, unless some unproven computation-complexity assumptions are made, such as the difficulty of factorizing large numbers. On the other hand, a secure key distribution is possible when both parties are quantum. What is possible when only one party (Alice) is quantum, yet the other (Bob) has only classical capabilities? We present a protocol with this constraint and prove its robustness against attacks: we prove that any attempt of an adversary to obtain information necessarily induces some errors that the legitimate users could notice.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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 information and computation
Bennett, C. H., & DiVincenzo, D. P. (2000) · Nature · doi:10.1038/35005001 · Cited by 3,263
Simple Proof of Security of the BB84 Quantum Key Distribution Protocol
Shor, P. W., & Preskill, J. (2000) · Physical Review Letters · doi:10.1103/physrevlett.85.441 · Cited by 3,047
Quantum cryptography without Bell’s theorem
Bennett, C. H., Brassard, G., & Mermin, N. D. (1992) · Physical Review Letters · doi:10.1103/physrevlett.68.557 · Cited by 2,460
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
Quantum nonlocality without entanglement
Bennett, C. H., DiVincenzo, D. P., Fuchs, C. A., Mor, T., Rains, E., Shor, P. W., Smolin, J. A., & Wootters, W. K. (1999) · Physical Review A · doi:10.1103/physreva.59.1070 · Cited by 1,130
Self-citationUnconditional security in quantum cryptography
Mayers, D. (2001) · Journal of the ACM · doi:10.1145/382780.382781 · Cited by 1,033
On the role of entanglement in quantum-computational speed-up
Jozsa, R., & Linden, N. (2003) · Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.2002.1097 · Cited by 839
Scarani, V., Acín, A., Ribordy, G., & Gisin, N. (2004) · Physical Review Letters · doi:10.1103/physrevlett.92.057901 · Cited by 810
Quantum, classical, and total amount of correlations in a quantum state
Groisman, B., Popescu, S., & Winter, A. (2005) · Physical Review A · doi:10.1103/physreva.72.032317 · Cited by 615
Separability of Very Noisy Mixed States and Implications for NMR Quantum Computing
Braunstein, S. L., Caves, C. M., Jozsa, R., Linden, N., Popescu, S., & Schack, R. (1999) · Physical Review Letters · doi:10.1103/physrevlett.83.1054 · Cited by 566
Cited by
Boyer, M., Gelles, R., Kenigsberg, D., & Mor, T. (2009) · Physical Review A · doi:10.1103/physreva.79.032341 · Cited by 297
Self-citation
Metadata
- Authors
- Boyer, M., Kenigsberg, D., & Mor, T.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2007-10-05
- Volume
- 99
- Issue
- 14
- Pages
- 140501-140501
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W2964033631
- Cited by
- 375
- References
- 16
- FWCI
- 5.52
- 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.