CoChat

Private Entanglement over Arbitrary Distances, Even Using Noisy Apparatus

Aschauer, Hans, Briegel, Hans J. · 2002 · Physical Review Letters
Cited by 35

The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.

Abstract

We give a security proof of quantum cryptography based entirely on entanglement purification. Our proof applies to all possible attacks (individual and coherent). It implies the security of cryptographic keys distributed with the help of entanglement-based quantum repeaters. We prove the security of the obtained quantum channel which may not be used only for quantum key distribution, but also for secure, albeit noisy, transmission of quantum information.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1103/physrevlett.88.047902

Cites

5 of 5 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 5 references

Research works printed but not linked: 11

  1. C. H. Bennett, 1985, Proceedings of IEEE International Conference on Computers, Systems and Signal Processing, Bangalore, India
  2. A. Ekert, 1991, Phys. Rev. Lett., 67, 661, 10.1103/PhysRevLett.67.661 · DOI · Paper page
  3. D. Mayers, 1996, Advances in Cryptology-Proceedings of Crypto '96
  4. E. Biham, 2000, Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing
  5. A. M. Steane, 1996, Phys. Rev. Lett., 77, 793, 10.1103/PhysRevLett.77.793 · DOI · Paper page
  6. C. H. Bennett, 1996, Phys. Rev. Lett., 76, 722, 10.1103/PhysRevLett.76.722 · DOI · Paper page
  7. C. H. Bennett, 1996, Phys. Rev. A, 54, 3824, 10.1103/PhysRevA.54.3824 · DOI · Paper page
  8. G. Giedke, 1999, Phys. Rev. A, 59, 2641, 10.1103/PhysRevA.59.2641 · DOI
  9. H.-K. Lo, 1999, Science, 283, 2050, 10.1126/science.283.5410.2050 · DOI · Paper page
  10. J. I. Cirac, 1997, Phys. Lett. A, 229, 1, 10.1016/S0375-9601(97)00176-X · DOI · Paper page
  11. J.-W. Pan, 2001, Nature (London), 410, 1067, 10.1038/35074041 · DOI · Paper page

Cited by

Metadata

Authors
Aschauer, H., & Briegel, H. J.
Venue
Physical Review Letters
Published
2002-01-09
Volume
88
Issue
4
Pages
047902-047902
ISSN
  • 0031-9007 (ISSN-L)
  • 1079-7114
OpenAlex
W1976294956
Cited by
35
References
5
FWCI
5.02
Type
journal article
Language
en
Open access
closed

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.