The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Quantum cryptography with imperfect apparatus
Open accessAbstract
Quantum key distribution, first proposed by C.H. Bennett and G. Brassard (1984), provides a possible key distribution scheme whose security depends only on the quantum laws of physics. So far the protocol has been proved secure even under channel noise and detector faults of the receiver but is vulnerable if the photon source used is imperfect. In this paper we propose and give a concrete design for a new concept, self-checking source, which requires the manufacturer of the photon source to provide certain tests; these tests are designed such that, if passed, the source is guaranteed to be adequate for the security of the quantum key distribution protocol, even though the testing devices may not be built to the original specification. The main mathematical result is a structural theorem which states that, for any state in a Hilbert space, if certain EPR-type equations are satisfied, the state must be essentially the orthogonal sum of EPR pairs.
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 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
Muller, A., Breguet, J., & Gisin, N. (1993) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/23/6/001 · Cited by 215
Research works printed but not linked: 28
- 10.1016/0375-9601(93)90880-9 · DOI · Paper page
- schmidt, 1906, Math Ann, 63, 433, 10.1007/BF01449770 · DOI · Paper page
- 10.1103/PhysRevLett.76.722 · DOI · Paper page
- 10.1103/PhysRevLett.77.2818 · DOI · Paper page
- 10.1103/PhysRevLett.68.3121 · DOI · Paper page
- 10.1109/PHYCMP.1994.363696 · doi:10.1109/phycmp.1994.363696
- 10.1080/09500349414552301 · DOI
- 10.1103/PhysRevA.50.1047 · DOI
- 10.1103/PhysRevA.54.97 · DOI
- 10.1103/PhysRevLett.76.722 · DOI · Paper page
- 10.1103/PhysRevLett.77.2818 · DOI · Paper page
- 10.1103/PhysRevA.54.2675 · DOI
- mayers, 1998, Unconditional security in quantum cryptography
- hughes, 0, Quantum cryptography over underground optical fibers, proceeding of Advances in Cryptology - CRYPTO
- lo, 1998, Security of quantum key distribution
- 10.1364/AO.33.002949 · DOI
- 10.1103/PhysRevA.57.2379 · DOI
- aspect, 1986, Quantum Concepts in Space and Time, 1
- 10.1364/OL.21.001854 · DOI
- 10.1007/BF00191318 · DOI · Paper page
- 10.1049/el:19930862 · DOI
- 10.1145/225058.225085 · DOI
- mayers, 1996, Quantum key distribution and string oblivious transfer in noisy channel, Advances in Cryptology Proceedings of CRYPTO'96, 1109, 343
- 10.1007/3-540-44750-4_10 · doi:10.1007/3-540-44750-4_10
- biham, 1998, Security of quantum key distribution against all collective attacks
- 10.1103/PhysRevLett.79.4034 · DOI
- 10.1103/PhysRevA.56.1173 · DOI
- 10.1103/PhysRevA.56.1163 · DOI · Paper page
Cited by
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1999) · SIAM Review · doi:10.1137/s0036144598347011 · Cited by 3,904
Random numbers certified by Bell’s theorem
Pironio, S., Acín, A., Massar, S., de la Giroday, A. B., Matsukevich, D. N., Maunz, P., Olmschenk, S., Hayes, D., Luo, L., Manning, T. A., et al. (2010) · Nature · doi:10.1038/nature09008 · Cited by 1,420
Quantum random number generation
Ma, X., Yuan, X., Cao, Z., Qi, B., & Zhang, Z. (2016) · npj Quantum Information · doi:10.1038/npjqi.2016.21 · Cited by 445
Self-testing of quantum systems: a review
Šupić, I., & Bowles, J. (2020) · Quantum · doi:10.22331/q-2020-09-30-337 · Cited by 365
A device-independent quantum key distribution system for distant users
Zhang, W., van Leent, T., Redeker, K., Garthoff, R., Schwonnek, R., Fertig, F., Eppelt, S., Rosenfeld, W., Scarani, V., Lim, C. C.-W., et al. (2022) · Nature · doi:10.1038/s41586-022-04891-y · Cited by 303
Metadata
- Authors
- Mayers, D., & Yao, A.
- Venue
- Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)
- Publisher
- IEEE Comput. Soc
- Published
- 2002-11-27
- Pages
- 503-509
- ISSN
- 0272-5428 (ISSN-L)
- OpenAlex
- W2170184539
- Cited by
- 381
- References
- 3
- FWCI
- 4.08
- Type
- conference paper
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Quantum cryptography with imperfect apparatus. https://app.cochat.ai/papers/10.1109/sfcs.1998.743501
- The paper
- Mayers, D., & Yao, A. (2002). Quantum cryptography with imperfect apparatus. Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280). https://doi.org/10.1109/sfcs.1998.743501
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.
