Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Advertisement

Springer Nature Link
Log in

A cluster-based quantum key distribution with dynamic node selection: an improved approach for scalability and security in quantum communication

  • Research Article
  • Published:
Quantum Machine Intelligence Aims and scope Submit manuscript

Abstract

In quantum computing, key distribution is an indispensable approach for establishing secure communication using the principles of quantum mechanics. However, existing key distribution protocols face challenges related to scalability and resilience against eavesdropping attacks. In response, this paper introduces Cluster-based Quantum Key Distribution with a Dynamic Node Selection (CQKD-DNS) protocol designed to address these limitations. Through experimental simulations, we demonstrate notable improvements in key generation rates, reduced error rates, and enhanced overall performance compared to existing QKD protocols. The core innovation lies in the dynamic node selection process, which enables adaptive network utilization while considering factors such as distance, entanglement levels, and network traffic. This dynamic node selection enhances both efficiency and robustness. The significance of this research is twofold: First, the CQKD-with-Dynamic Node Selection protocol shows the potential to advance quantum key distribution by harnessing cluster entanglement and dynamic node selection. This innovation offers a scalable and resilient approach to key distribution, effectively tackling the critical limitations associated with conventional methods. Secondly, the findings contribute to the development of efficient and secure communication systems, paving the way for the practical implementation of QKD in large-scale networks. The proposed protocol represents a promising avenue for the advancement of quantum key distribution, ultimately enabling secure communication in the era of quantum technologies.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Algorithm 1
Algorithm 2
Algorithm 3
Algorithm 4
Algorithm 5
Algorithm 6
Algorithm 7
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

Data Availability

No datasets were generated or analyzed during the current study.

References

  • Bennett CH, Brassard G (2014) Quantum cryptography: public key distribution and coin tossing. Theoret Comput Sci 560:7–11

    Article  MathSciNet  Google Scholar 

  • Bennett CH, Brassard G, Robert J-M (1988) Privacy amplification by public discussion. SIAM J Comput 17(2):210–229

    Article  MathSciNet  Google Scholar 

  • Bennett CH, Bessette F, Brassard G, Salvail L, Smolin J (1992) Experimental quantum cryptography. J Cryptol 5:3–28

    Article  Google Scholar 

  • Bennett CH, Brassard G, Crépeau C, Maurer UM (1995) Generalized privacy amplification. IEEE Trans Inf Theory 41(6):1915–1923

    Article  MathSciNet  Google Scholar 

  • Biswas S, Goswami RS, Reddy Hemant Kumar, K., Mohanty, S.N., Ahmed, M.A, (2024b) Exploring the fusion of lattice-based quantum key distribution for secure Internet of Things communications. IET Quantum Comm

  • Biswas S, Goswami RS, Reddy KHK (2024a) Advancing quantum steganography: a secure IoT communication with reversible decoding and customized encryption technique for smart cities. Cluster Comput 1–20

  • Braunstein SL, Pirandola S (2012) Side-channel-free quantum key distribution. Phys Rev Lett 108(13):130502

    Article  Google Scholar 

  • Broadbent A, Schaffner C (2016) Quantum cryptography beyond quantum key distribution. Des Codes Crypt 78:351–382

    Article  MathSciNet  Google Scholar 

  • Chen Z, Wang X, Yu S, Li Z, Guo H (2023) Continuous-mode quantum key distribution with digital signal processing. NPJ Quant Inform 9(1):28

    Article  Google Scholar 

  • Cherbal S, Zier A, Hebal S, Louail L, Annane B (2023) Security in internet of things: a review on approaches based on blockchain, machine learning, cryptography, and quantum computing. J Supercomput 1–79

  • Diamanti E, Leverrier A (2015) Distributing secret keys with quantum continuous variables: principle, security and implementations. Entropy 17(9):6072–6092

    Article  MathSciNet  Google Scholar 

  • Ekert AK (1991) Quantum cryptography based on bell’s theorem. Phys Rev Lett 67(6):661

    Article  MathSciNet  Google Scholar 

  • Fan-Yuan G-J, Teng J, Wang S, Yin Z-Q, Chen W, He D-Y, Guo G-C, Han Z-F (2020) Optimizing single-photon avalanche photodiodes for dynamic quantum key distribution networks. Phys Rev Appl 13(5):054027

    Article  Google Scholar 

  • Gilbert G, Weinstein YS (2014) Introduction to Special Issue on quantum cryptography. Springer

  • Gisin N, Ribordy G, Tittel W, Zbinden H (2002) Quantum cryptography. Rev Modern Phys 74(1):145

    Article  Google Scholar 

  • Kallin AB, Hyatt K, Singh RR, Melko RG (2013) Entanglement at a two-dimensional quantum critical point: a numerical linked-cluster expansion study. Phys Rev Lett 110(13):135702

    Article  Google Scholar 

  • Kang Y, Dong X, Wang Z, Chen H, Wang Q (2023) Parallel implementations of post-quantum Leighton-Micali signature on multiple nodes

  • Kozlowski W, Dahlberg A, Wehner S (2020) Designing a quantum network protocol. In: Proceedings of the 16th International Conference on Emerging Networking Experiments and Technologies. pp 1–16

  • Kumar A, Garhwal S (2021) State-of-the-art survey of quantum cryptography. Arch Comput Methods Eng 28:3831–3868

    Article  MathSciNet  Google Scholar 

  • Laudenbach F, Pacher C, Fung C-HF, Poppe A, Peev M, Schrenk B, Hentschel M, Walther P, Hübel H (2018) Continuous-variable quantum key distribution with gaussian modulation—the theory of practical implementations. Adv Quan Technol 1(1):1800011

    Article  Google Scholar 

  • Li X-H, Deng F-G, Zhou H-Y (2008) Efficient quantum key distribution over a collective noise channel. Phys Rev A 78(2):022321

    Article  Google Scholar 

  • Li Z, Xue K, Jia Q, Li J, Wei DS, Liu J, Yu N (2022) A cluster-based networking approach for large-scale and wide-area quantum key agreement. Quantum Inf Process 21(5):192

    Article  MathSciNet  Google Scholar 

  • Lim CCW, Portmann C, Tomamichel M, Renner R, Gisin N (2013) Device-independent quantum key distribution with local bell test. Phys Rev X 3(3):031006

    Google Scholar 

  • Liu X, Luo D, Lin G, Chen Z, Huang C, Li S, Zhang C, Zhang Z, Wei K (2022) Fiber-based quantum secure direct communication without active polarization compensation. Sci Chin Phys Mech Astron 65(12):120311

    Article  Google Scholar 

  • Lo H-K, Curty M, Qi B (2012) Measurement-device-independent quantum key distribution. Phys Rev Lett 108(13):130503

    Article  Google Scholar 

  • Lopez Alarcon S, Rueda F (2023) Compilation of gaussian boson samplers for quantum computing. J Supercomput 1–22

  • Mishra K, Pradhan R, Majhi SK (2021) Quantum-inspired binary chaotic salp swarm algorithm (QBCSSA)-based dynamic task scheduling for multiprocessor cloud computing systems. J Supercomput 77:10377–10423

    Article  Google Scholar 

  • Munro WJ, Azuma K, Tamaki K, Nemoto K (2015) Inside quantum repeaters. IEEE J Sel Top Quantum Electron 21(3):78–90

    Article  Google Scholar 

  • Peev M, Pacher C, Alléaume R, Barreiro C, Bouda J, Boxleitner W, Debuisschert T, Diamanti E, Dianati M, Dynes J et al (2009) The SECOQC quantum key distribution network in Vienna. New J Phys 11(7):075001

    Article  Google Scholar 

  • Pirandola S, Andersen UL, Banchi L, Berta M, Bunandar D, Colbeck R, Englund D, Gehring T, Lupo C, Ottaviani C et al (2020) Advances in quantum cryptography. Adv Opt Photon 12(4):1012–1236

  • Rasheed B, Wang X, Yu Z, Qu G, Yao Z, Cai H (2023) Properties of entanglement in the cluster of n-qubits. Int J Mod Phys B 37(11):2350110

    Article  Google Scholar 

  • Refael G, Moore JE (2004) Entanglement entropy of random quantum critical points in one dimension. Phys Rev Lett 93(26):260602

    Article  MathSciNet  Google Scholar 

  • Ribordy G, Brendel J, Gautier J-D, Gisin N, Zbinden H (2000) Long-distance entanglement-based quantum key distribution. Phys Rev A 63(1):012309

    Article  Google Scholar 

  • Ruihong Q, Ying M (2019) Research progress of quantum repeaters. In: Journal of Physics: Conference Series, vol. 1237. IOP Publishing, p 052032

  • Sundar K, Sasikumar S, Jayakumar C, Nagarajan D, Karthick S (2023) Quantum cryptography based cloud security model (QC-CSM) for ensuring cloud data security in storage and accessing. Multimed Tools Appl 1–16

  • Usenko VC, Filip R (2016) Trusted noise in continuous-variable quantum key distribution: a threat and a defense. Entropy 18(1):20

    Article  Google Scholar 

  • Vagniluca I, Da Lio B, Rusca D, Cozzolino D, Ding Y, Zbinden H, Zavatta A, Oxenløwe LK, Bacco D (2020) Efficient time-bin encoding for practical high-dimensional quantum key distribution. Phys Rev Appl 14(1):014051

    Article  Google Scholar 

  • Vazirani U, Vidick T (2019) Fully device independent quantum key distribution. Commun ACM 62(4):133–133

    Article  Google Scholar 

  • Wang Y, Chen G, Jian L, Zhou Y, Liu S (2022) Ternary quantum public-key cryptography based on qubit rotation. Quantum Inf Process 21(6):197

    Article  MathSciNet  Google Scholar 

  • Wei K, Hu X, Du Y, Hua X, Zhao Z, Chen Y, Huang C, Xiao X (2023) Resource-efficient quantum key distribution with integrated silicon photonics. Photon Res 11(8):1364–1372

    Article  Google Scholar 

  • Yin J, Cao Y, Li Y-H, Ren J-G, Liao S-K, Zhang L, Cai W-Q, Liu W-Y, Li B, Dai H et al (2017) Satellite-to-ground entanglement-based quantum key distribution. Phys Rev Lett 119(20):200501

    Article  Google Scholar 

  • Yin J, Li Y-H, Liao S-K, Yang M, Cao Y, Zhang L, Ren J-G, Cai W-Q, Liu W-Y, Li S-L et al (2020) Entanglement-based secure quantum cryptography over 1,120 kilometres. Nature 582(7813):501–505

    Article  Google Scholar 

  • Zhang Q, Xu F, Chen Y-A, Peng C-Z, Pan J-W (2018) Large scale quantum key distribution: challenges and solutions. Opt Express 26(18):24260–24273

    Article  Google Scholar 

  • Zhou L, Sheng Y-B, Long G-L (2020) Device-independent quantum secure direct communication against collective attacks. Sci Bull 65(1):12–20

    Article  Google Scholar 

Download references

Author information

Author notes

  1. K Hemant Kumar Reddy contributed equally to this work.

Authors and Affiliations

  1. Department of Computer Science & Engineering, National Institute of Technology Arunachal Pradesh, Jote, 791123, Arunachal Pradesh, India

    Sujit Biswas & Rajat S. Goswami

  2. Department of Computer Science & Engineering, VIT-AP University, Amaravati, 522237, Andhra Pradesh, India

    K. Hemant Kumar Reddy

Authors
  1. Sujit Biswas
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rajat S. Goswami
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. K. Hemant Kumar Reddy
    View author publications

    You can also search for this author in PubMed Google Scholar

Contributions

Sujit Biswas: modeling, implementing. Rajat S. Goswami: writing and designing. K. H. K. Reddy: designing, proofreading

Corresponding author

Correspondence to Rajat S. Goswami.

Ethics declarations

The work is original and unpublished and has not been submitted for publication elsewhere.

Conflict of interest

The authors declare no competing interests.

Ethical approval

Not applicable for both human and/ or animal studies.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Appendix A.  Reconciliation and privacy amplification algorithms

Appendix A.  Reconciliation and privacy amplification algorithms

1.1 A.1 Reconciliation process in CQKD-DNS

The reconciliation process in the CQKD-DNS protocol is designed to correct discrepancies between the key bits shared between Alice and Bob due to quantum noise and potential eavesdropping attempts. This process is crucial for ensuring that Alice and Bob share an identical key before proceeding to the privacy amplification step. Our protocol implements an iterative reconciliation process inspired by the Cascade protocol, which is widely used in quantum key distribution. The key steps involved in the reconciliation process are as follows:

  1. 1.

    Parity check: Alice and Bob divide their bit strings into smaller blocks and compare the parity (i.e., the number of ones) of each block. If a mismatch in parity is detected, it indicates the presence of one or more errors within that block.

  2. 2.

    Error detection and correction: Once an error is identified, Alice and Bob apply a binary search within the erroneous block to pinpoint the exact location of the error. Upon identifying the erroneous bit, they correct the discrepancy by flipping the bit in Bob’s key to match Alice’s bit.

  3. 3.

    Iterative refinement: The process is repeated iteratively, with block sizes being halved in each iteration, ensuring that multiple rounds of error correction are applied to reduce the overall error rate. After several iterations, the process ensures that both parties’ bit strings are as close to identical as possible.

  4. 4.

    Information reconciliation: To ensure the integrity of the corrected keys, Alice and Bob exchange parity bits over a classical authenticated channel. The final key is only accepted if the parity matches in all blocks after the final round of reconciliation.

This process is carefully designed to account for the dynamic node selection inherent in CQKD-DNS. By dynamically adjusting the block size and the number of iterations based on the specific characteristics of the cluster state and the network configuration, our protocol optimizes the reconciliation process, minimizing the error rate while maintaining efficiency.

1.2 A.2 Privacy amplification in CQKD-DNS

Privacy amplification is a critical step in the CQKD-DNS protocol, aimed at eliminating any partial information that an eavesdropper (Eve) may have gained about the shared key during transmission. This step ensures that the final key is secure and can be used for subsequent cryptographic operations. In our protocol, privacy amplification is achieved through the application of universal hashing techniques, which compress the reconciled key to a shorter length. The key steps involved in this process are as follows:

  1. 1.

    Selection of a universal hash function: Alice and Bob agree on a publicly known universal hash function, which is selected from a predefined family of hash functions. This function is chosen to minimize the potential information that Eve could have about the final key.

  2. 2.

    Compression of the key: The reconciled key, which may still have some residual information leakage, is input into the universal hash function. The output is a shorter key, with a length determined based on the amount of information Eve could have potentially obtained. The compression ratio is carefully calculated to ensure that the probability of Eve guessing the final key is exponentially small.

  3. 3.

    Secure key generation: The output of the hash function is the final shared key, which is used for secure communication. This key is significantly shorter than the original reconciled key but is guaranteed to be secure against any information leakage.

The privacy amplification process is adapted to the dynamic nature of the CQKD-DNS protocol. By adjusting the parameters of the hash function and the compression ratio based on the network’s current configuration and the quality of the quantum channels, the protocol ensures robust security even in the presence of potential eavesdropping.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Biswas, S., Goswami, R.S. & Reddy, K.H.K. A cluster-based quantum key distribution with dynamic node selection: an improved approach for scalability and security in quantum communication. Quantum Mach. Intell. 6, 63 (2024). https://doi.org/10.1007/s42484-024-00199-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s42484-024-00199-4

Keywords

Search

Navigation