The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
Unconditional security in quantum cryptography
Open accessAbstract
Basic techniques to prove the unconditional security of quantum crypto graphy are described. They are applied to a quantum key distribution protocol proposed by Bennett and Brassard [1984]. The proof considers a practical variation on the protocol in which the channel is noisy and photos may be lost during the transmission. Each individual signal sent into the channel must contain a single photon or any two-dimensional system in the exact state described in the protocol. No restriction is imposed on the detector used at the receiving side of the channel, except that whether or not the received system is detected must be independent of the basis used to measure this system.
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
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
Quantum cryptography based on Bell’s theorem
Ekert, A. K. (1991) · Physical Review Letters · doi:10.1103/physrevlett.67.661 · Cited by 10,777
The Theory of Error-Correcting Codes
(1977) · North-Holland Mathematical Library · doi:10.1016/s0924-6509(08)x7030-8 · Cited by 10,760
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
Quantum cryptography: Public key distribution and coin tossing
Bennett, C. H., & Brassard, G. (2020) · arXiv · doi:10.48550/arxiv.2003.06557 · Cited by 8,299
A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
Chernoff, H. (1952) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177729330 · Cited by 3,550
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 using any two nonorthogonal states
Bennett, C. H. (1992) · Physical Review Letters · doi:10.1103/physrevlett.68.3121 · Cited by 3,028
Purification of Noisy Entanglement and Faithful Teleportation via Noisy Channels
Bennett, C. H., Brassard, G., Popescu, S., Schumacher, B., Smolin, J. A., & Wootters, W. K. (1996) · Physical Review Letters · doi:10.1103/physrevlett.76.722 · Cited by 2,961
Quantum Theory: Concepts and Methods
Peres, A., & Ballentine, L. E. (1995) · American Journal of Physics · doi:10.1119/1.17946 · Cited by 2,561
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
New hash functions and their use in authentication and set equality
Wegman, M. N., & Carter, J. L. (1981) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(81)90033-7 · Cited by 1,402
Quantum Privacy Amplification and the Security of Quantum Cryptography over Noisy Channels
Deutsch, D., Ekert, A., Jozsa, R., Macchiavello, C., Popescu, S., & Sanpera, A. (1996) · Physical Review Letters · doi:10.1103/physrevlett.77.2818 · Cited by 1,268
Quantum Theory: Concepts and Methods
(2002) · doi:10.1007/0-306-47120-5 · Cited by 1,029
Experimental Quantum Cryptography
Bennett, C. H., Bessette, F., Brassard, G., Salvail, L., & Smolin, J. (1991) · Lecture Notes in Computer Science · doi:10.1007/3-540-46877-3_23 · Cited by 959
Privacy Amplification by Public Discussion
Bennett, C. H., Brassard, G., & Robert, J.-M. (1988) · SIAM Journal on Computing · doi:10.1137/0217014 · Cited by 867
Unconditionally Secure Quantum Bit Commitment is Impossible
Mayers, D. (1997) · Physical Review Letters · doi:10.1103/physrevlett.78.3414 · Cited by 748
Self-citationQuantum theory: Concepts and methods
Mermin, N. D. (1997) · Studies in History and Philosophy of Science Part B: Studies in History and Philosophy of Modern Physics · doi:10.1016/s1355-2198(97)85538-4 · Cited by 600
Quantum cryptography with imperfect apparatus
Mayers, D., & Yao, A. (2002) · Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280) · doi:10.1109/sfcs.1998.743501 · Cited by 381
Self-citationComputational Complexity of Machine Learning
Kearns, M. J. (1990) · Cited by 226
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
Quantum Key Distribution and String Oblivious Transfer in Noisy Channels
Mayers, D. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-68697-5_26 · Cited by 199
Self-citationSecurity of Quantum Cryptography against Collective Attacks
Biham, E., & Mor, T. (1997) · Physical Review Letters · doi:10.1103/physrevlett.78.2256 · Cited by 153
Security of quantum protocols against coherent measurements
Yao, A. C.-C. (1995) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/225058.225085 · Cited by 142
Perfectly Concealing Quantum Bit Commitment from any Quantum One-Way Permutation
Dumais, P., Mayers, D., & Salvail, L. (2000) · Lecture notes in computer science · doi:10.1007/3-540-45539-6_21 · Cited by 124
Self-citationSecurity of Quantum Key Distribution against All Collective Attacks
Available, N., Available, N., Available, N., van de Graaf, & Available, N. (2002) · Algorithmica · doi:10.1007/s00453-002-0973-6 · Cited by 86
25 years of quantum cryptography
Brassard, G., & Crépeau, C. (1996) · ACM SIGACT News · doi:10.1145/235666.235669 · Cited by 75
Quantum Key Distribution and String Oblivious Transfer in Noisy Channels
ayers, D. R. (2002) · Cited by 17
Security of Quantum Key Distribution Against All Collective AttacksPreprint
Biham, E., Boyer, M., Gilles Brassard, A., et al. (1998) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/9801022 · Cited by 15
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
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
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
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
Metadata
- Authors
- Mayers, D.
- Venue
- Journal of the ACM
- Published
- 2001-05
- Volume
- 48
- Issue
- 3
- Pages
- 351-406
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W2120755151
- Cited by
- 1,033
- References
- 29
- FWCI
- 26.29
- 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.