Multiple-Access Quantum Key Distribution Networks
Open accessThe DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Abstract
This paper addresses multi-user quantum key distribution networks, in which any two users can mutually exchange a secret key without trusting any other nodes. The same network also supports conventional classical communications by assigning two different wavelength bands to quantum and classical signals. Time and code division multiple access (CDMA) techniques, within a passive star network, are considered. In the case of CDMA, it turns out that the optimal performance is achieved at a unity code weight. A listen-before-send protocol is then proposed to improve secret key generation rates in this case. Finally, a hybrid setup with wavelength routers and passive optical networks, which can support a large number of users, is considered and analyzed.
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 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 · cited 2×
“In this section, we first review the original BB84 protocol, that relies on ideal single photons [1], and then we present its decoy-state variant and the existing lower bounds for secret key generation rate in the case of point-to-point QKD links.”
BackgroundQuantum cryptography: Public key distribution and coin tossing
Bennett, C. H., & Brassard, G. (2020) · arXiv · doi:10.48550/arxiv.2003.06557 · Cited by 8,299
Quantum Repeaters: The Role of Imperfect Local Operations in Quantum Communication
Briegel, H.-J., Dür, W., Cirac, J. I., & Zoller, P. (1998) · Physical Review Letters · doi:10.1103/physrevlett.81.5932 · Cited by 3,481 · cited 1×
“in local and metropolitan areas without relying on quantum repeaters [7]–[10].”
BackgroundSimple 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
Cited by
The Evolution of Quantum Key Distribution Networks: On the Road to the Qinternet
Cao, Y., Zhao, Y., Wang, Q., Zhang, J., Ng, S. X., & Hanzo, L. (2022) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2022.3144219 · Cited by 505
Field and long-term demonstration of a wide area quantum key distribution network
Wang, S., Chen, W., Yin, Z.-Q., Li, H.-W., He, D.-Y., Li, Y.-H., Zhou, Z., Song, X.-T., Li, F.-Y., Wang, D., et al. (2014) · Optics Express · doi:10.1364/oe.22.021739 · Cited by 289
Botsinis, P., Ng, S. X., & Hanzo, L. (2013) · IEEE Access · doi:10.1109/access.2013.2259536 · Cited by 64
Long-Distance Trust-Free Quantum Key Distribution
Piparo, N. L., & Razavi, M. (2015) · IEEE Journal of Selected Topics in Quantum Electronics · doi:10.1109/jstqe.2014.2364129 · Cited by 41
Self-citationQuantum Spread Spectrum Multiple Access
Garcia-Escartin, J. C., & Chamorro-Posada, P. (2015) · IEEE Journal of Selected Topics in Quantum Electronics · doi:10.1109/jstqe.2014.2360366 · Cited by 10
Metadata
- Authors
- Razavi, M.
- Venue
- IEEE Transactions on Communications
- Published
- 2012-10
- Volume
- 60
- Issue
- 10
- Pages
- 3071-3079
- ISSN
- 0090-6778 (ISSN-L)
- OpenAlex
- W1981525690
- Cited by
- 74
- References
- 4
- FWCI
- 6.65
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Multiple-Access Quantum Key Distribution Networks. https://app.cochat.ai/papers/10.1109/tcomm.2012.072612.110840
- The paper
- Razavi, M. (2012). Multiple-Access Quantum Key Distribution Networks. IEEE Transactions on Communications. https://doi.org/10.1109/tcomm.2012.072612.110840
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.