A proof of the security of quantum key distribution (extended abstract)
The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Abstract
Article Free Access Share on A proof of the security of quantum key distribution (extended abstract) Authors: Eli Biham Computer Science Department, Technion, Haifa 32000, Israel Computer Science Department, Technion, Haifa 32000, IsraelView Profile , Michel Boyer DIRO, Université de Montréal, Montréal, Canada DIRO, Université de Montréal, Montréal, CanadaView Profile , P. Oscar Boykin Dept. of Electrical Engineering, UCLA, Los Angeles, CA Dept. of Electrical Engineering, UCLA, Los Angeles, CAView Profile , Tal Mor Dept. of Electrical Engineering, UCLA, Los Angeles, CA and Dept. of Electrical Engineering, College of Judea and Samaria, Ariel, Israel Dept. of Electrical Engineering, UCLA, Los Angeles, CA and Dept. of Electrical Engineering, College of Judea and Samaria, Ariel, IsraelView Profile , Vwani Roychowdhury Dept. of Electrical Engineering, College of Judea and Samaria, Ariel, Israel Dept. of Electrical Engineering, College of Judea and Samaria, Ariel, IsraelView Profile Authors Info & Claims STOC '00: Proceedings of the thirty-second annual ACM symposium on Theory of computingMay 2000 Pages 715–724https://doi.org/10.1145/335305.335406Published:01 May 2000Publication History 38citation1,057DownloadsMetricsTotal Citations38Total Downloads1,057Last 12 Months95Last 6 weeks17 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
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
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539795293172 · Cited by 8,472
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
Wiesner, S. (1983) · ACM SIGACT News · doi:10.1145/1008908.1008920 · Cited by 1,520
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
Cited by
The Physics of Quantum Information
(2000) · doi:10.1007/978-3-662-04209-0 · Cited by 1,086
Security of quantum key distribution with imperfect devices
Gottesman, D., Lo, H.-K., L\"utkenhaus, N., & Preskill, J. (2004) · Quantum Information and Computation · doi:10.26421/qic4.5-1 · Cited by 682
Entropic uncertainty relations and their applications
Coles, P. J., Berta, M., Tomamichel, M., & Wehner, S. (2017) · Reviews of Modern Physics · doi:10.1103/revmodphys.89.015002 · Cited by 658
Efficient Quantum Key Distribution Scheme and a Proof of Its Unconditional Security
Lo, H.-K., Chau, H. F., & Ardehali, M. (2005) · Journal of Cryptology · doi:10.1007/s00145-004-0142-y · Cited by 557
Security in quantum cryptography
Portmann, C., & Renner, R. (2022) · Reviews of Modern Physics · doi:10.1103/revmodphys.94.025008 · Cited by 390
Metadata
- Authors
- Biham, E., Boyer, M., Boykin, P. O., Mor, T., & Roychowdhury, V.
- Venue
- Proceedings of the thirty-second annual ACM symposium on Theory of computing
- Publisher
- ACM
- Published
- 2000-05
- Pages
- 715-724
- OpenAlex
- W2048920728
- Cited by
- 72
- References
- 5
- FWCI
- 4.23
- Type
- conference paper
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A proof of the security of quantum key distribution (extended abstract). https://app.cochat.ai/papers/10.1145/335305.335406
- The paper
- Biham, E., Boyer, M., Boykin, P. O., Mor, T., & Roychowdhury, V. (2000). A proof of the security of quantum key distribution (extended abstract). Proceedings of the thirty-second annual ACM symposium on Theory of computing. https://doi.org/10.1145/335305.335406
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.