Adaptive Quantum Secret Sharing with Post-Quantum Authentication and Dynamic Routing in Scalable Networks.

Saved in:

Bibliographic Details
Title:	Adaptive Quantum Secret Sharing with Post-Quantum Authentication and Dynamic Routing in Scalable Networks.
Authors:	B. S., Lokesh¹ lokeshbstri@gmail.com, Kaulgud, Narasimha² narasimha.kaulgud@nie.ac.in
Source:	IAENG International Journal of Applied Mathematics. Jun2026, Vol. 56 Issue 6, p2260-2264. 5p.
Subjects:	Quantum cryptography, Adaptive routing (Computer network management), Scalability, Cryptography, Quantum entanglement, Computer network security, Quantum computing
Abstract:	Quantum Secret Sharing (QSS) protocols face significant limitations in dynamic network environments, such as fixed topologies, weak authentication, and fairness-throughput trade-offs. This work presents a novel entanglement-based (t, n) threshold QSS protocol that addresses these issues through four integrated innovations: (1) a quantum-enhanced Dijkstra algorithm for optimal participant selection with reduced complexity O(\|V \| p \|V \|); (2) a dynamic link weighting model incorporating entanglement fidelity and fiber impairments; (3) CRYSTALSKyber-based post-quantum authentication integrated into the GHZ state distribution with decoy photons; and (4) polynomialbased fairness reconstruction enforced via hash commitments. Simulations demonstrate a 28.7% reduction in selection latency, 99.8% eavesdropper detection with 15 decoys, and a 3.6 times throughput gain over fairness-focused baselines. The protocol upholds an extended CIA triad, ensuring confidentiality, integrity, availability, authenticity, accountability, and nonrepudiation. This work advances secure and scalable quantum communication for practical networks. [ABSTRACT FROM AUTHOR]
	Copyright of IAENG International Journal of Applied Mathematics is the property of International Association of Engineers (IAENG) and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database:	Engineering Source

Description
Abstract:	Quantum Secret Sharing (QSS) protocols face significant limitations in dynamic network environments, such as fixed topologies, weak authentication, and fairness-throughput trade-offs. This work presents a novel entanglement-based (t, n) threshold QSS protocol that addresses these issues through four integrated innovations: (1) a quantum-enhanced Dijkstra algorithm for optimal participant selection with reduced complexity O(\|V \| p \|V \|); (2) a dynamic link weighting model incorporating entanglement fidelity and fiber impairments; (3) CRYSTALSKyber-based post-quantum authentication integrated into the GHZ state distribution with decoy photons; and (4) polynomialbased fairness reconstruction enforced via hash commitments. Simulations demonstrate a 28.7% reduction in selection latency, 99.8% eavesdropper detection with 15 decoys, and a 3.6 times throughput gain over fairness-focused baselines. The protocol upholds an extended CIA triad, ensuring confidentiality, integrity, availability, authenticity, accountability, and nonrepudiation. This work advances secure and scalable quantum communication for practical networks. [ABSTRACT FROM AUTHOR]
ISSN:	19929978