skip to main content
10.1145/3606843.3606845acmotherconferencesArticle/Chapter ViewAbstractPublication PagesitccConference Proceedingsconference-collections
research-article

Research on Multi-path Quantum Key Distribution Scheme without Public Nodes Based on Trust Relaying

Published:29 August 2023Publication History

ABSTRACT

ABSTRACT. Quantum key distribution (QKD) network develops rapidly in recent years. In order to improve the efficiency and security of quantum key distribution, this paper analyzes the advantages and disadvantages of single-path and multi-path quantum key distribution and proposes a multi-path quantum key distribution scheme. This scheme includes two aspects which are path equalization priority strategy and the No-public nodes strategy. The priority of the chosen path is based on the path bandwidth utilization, the number of routing hops and quantum keys stored in the trusted nodes. The no-public nodes strategy selects multiple key distribution paths without public nodes. The scheme can reduce the risk of path blocking and the consumption of quantum keys, improve the efficiency and security of QKD. Finally, this scheme is analyzed and verified.

References

  1. X. Yu : Secret-Key Provisioning with Collaborative Routing in Partially-Trusted-Relay-based Quantum-Key-Distribution-Secured Optical Networks[J]. Journal of Lightwave Technology 40(12), 3530-3545 (2022).Google ScholarGoogle ScholarCross RefCross Ref
  2. CAO Yuan, ZHAO YongLi: Research progress of quantum communication networks[J]. Laser Journal 40(09),1-7 (2019).Google ScholarGoogle Scholar
  3. Wu Zhangbin, Chen Guang, Yang Bojun: Analysis of quantum key distribution networks[J]. Study on Optical Communications 2(21), 22-24+60 (2009).Google ScholarGoogle Scholar
  4. XIE Sijiang, GAO Qiong, FENG Yan: A Multiple Paths Routing Scheme with Least Number of Public Nodes Based on Trust Relaying Quantum Key Distribution Network[J]. Netinfo Security 21(7), 35-42 (2021).Google ScholarGoogle Scholar
  5. SHI Lei, SU Jinhai, GUO Yixi: Optimal routing selection algorithm of end-to-end key agreement in quantum key distribution network[J]. Journal of Computer Applications 35(12), 3336-3340+3397 (2015).Google ScholarGoogle Scholar
  6. YANG C, ZHANG H, SU J: Quantum key distribution network: Optimal secret-key-aware routing method for trust relaying[J]. China Communications 15(2), 33-45 (2018).Google ScholarGoogle ScholarCross RefCross Ref
  7. XU Yabin, CHEN Shujuan, LI Yanping: Research on Multipath Key Transmission in Quantum Key Distribution Networks[J]. Journal of University of Electronic Science and Technology of China 49(2), 276-282 (2020).Google ScholarGoogle Scholar
  8. WEN Hao. Protocols and mechanisms in the quantum key distribution networks[D]. University of Science and Technology of China, 2008.Google ScholarGoogle Scholar
  9. MA C. A multiple paths scheme with labels for key distribution on quantum key distribution network[C]. 2nd IEEE Advanced Information Technology, Electronic and Automation Control Conference (IAEAC), 2513-2517. IEEE, Chongqing (2017).Google ScholarGoogle Scholar
  10. Recommendation ITU-T Y.3800: Overview on networks supporting quantum key distribution[S].2019.Google ScholarGoogle Scholar
  11. YANG Hao. Research in routing selection algorithm in trusted relay quantum key distribution networks. Beijng university of posts and telecommuncations,2017.Google ScholarGoogle Scholar

Index Terms

  1. Research on Multi-path Quantum Key Distribution Scheme without Public Nodes Based on Trust Relaying

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Other conferences
        ITCC '23: Proceedings of the 2023 5th International Conference on Information Technology and Computer Communications
        June 2023
        124 pages
        ISBN:9798400700583
        DOI:10.1145/3606843

        Copyright © 2023 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 29 August 2023

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article
        • Research
        • Refereed limited
      • Article Metrics

        • Downloads (Last 12 months)22
        • Downloads (Last 6 weeks)2

        Other Metrics

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      HTML Format

      View this article in HTML Format .

      View HTML Format