Experimental quantum secure network with digital signatures and encryption
Open accessThe DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Abstract
Cryptography promises four information security objectives, namely, confidentiality, integrity, authenticity and non-repudiation, to support trillions of transactions annually in the digital economy. Efficient digital signatures, ensuring integrity, authenticity and non-repudiation of data with information-theoretical security are highly urgent and intractable open problems in cryptography. Here, we propose a high-efficiency quantum digital signature (QDS) protocol using asymmetric quantum keys acquired via secret sharing, one-time universal2 hashing and a one-time pad. We just need to use a 384-bit key to sign documents of lengths up to 264 with a security bound of 10−19. If a one-megabit document is signed, the signature efficiency is improved by more than 108 times compared with previous QDS protocols. Furthermore, we build the first all-in-one quantum secure network integrating information-theoretically secure communication, digital signatures, secret sharing and conference key agreement and experimentally demonstrate this signature efficiency advantage. Our work completes the cryptography toolbox of the four information security objectives.
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
Communication Theory of Secrecy Systems
Shannon, C. E. (1949) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1949.tb00928.x · Cited by 9,440 · cited 1×
“…one-time pad (OTP) encryption based on a symmetric key allows a message to be transmitted with information-theoretical confidentiality [10] over a standard communication channel, with the symmetric key being securely established using quantum key distribution [11] and the attackers’…”
Algorithms for quantum computation: discrete logarithms and factoring
Shor, P. W. (2002) · Proceedings 35th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365700 · Cited by 8,713 · cited 1×
“More seriously, quantum computers can in principle attack public-key cryptosystems with any number of bits [9].”
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×
“One-time pad encryption combined with quantum key distribution [8] can perfectly guarantee the confidentiality of communication [9], which has been demonstrated in various quantum communication networks [10–12].”
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
Factorization of a 768-Bit RSA Modulus
Kleinjung, T., Aoki, K., Franke, J., Lenstra, A. K., Thomé, E., Bos, J. W., Gaudry, P., Kruppa, A., Montgomery, P. L., Osvik, D. A., et al. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-14623-7_18 · Cited by 423 · cited 1×
“Additionally, in 2020, the public-key encryption algorithms [6–8], based on the computational complexity of factorization and the discrete logarithm, have both been compromised at the 795-bit level [8].”
Comparing the Difficulty of Factorization and Discrete Logarithm: A 240-Digit Experiment
Boudot, F., Gaudry, P., Guillevic, A., Heninger, N., Thomé, E., & Zimmermann, P. (2020) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-56880-1_3 · Cited by 71
Cited by
Hierarchical controlled hybrid quantum communication based on six-qubit entangled states in IoT
Hua, X., Li, D., Fu, Y., Zhu, Y., Jiang, Y., Zhou, J., Yang, X., & Tan, Y. (2023) · Sensors · doi:10.3390/s23229111 · Cited by 15
Self-citation
Metadata
- Authors
- Yin, H.-L., Fu, Y., Li, C.-L., Weng, C.-X., Li, B.-H., Gu, J., Lu, Y.-S., Huang, S., & Chen, Z.-B.
- Venue
- National Science Review
- Publisher
- Oxford University Press (OUP)
- Published
- 2022-10-22
- Volume
- 10
- Issue
- 4
- Pages
- nwac228-nwac228
- ISSN
- 2053-714X (ISSN-L)
- 2095-5138
- OpenAlex
- W3183336522
- Cited by
- 214
- References
- 6
- FWCI
- 14.70
- Type
- journal article
- Language
- en
- Open access
- gold
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: Experimental quantum secure network with digital signatures and encryption. https://app.cochat.ai/papers/10.1093/nsr/nwac228
- The paper
- Yin, H.-L., Fu, Y., Li, C.-L., Weng, C.-X., Li, B.-H., Gu, J., Lu, Y.-S., Huang, S., & Chen, Z.-B. (2023). Experimental quantum secure network with digital signatures and encryption. National Science Review. https://doi.org/10.1093/nsr/nwac228
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.