View in EDS PDF Full Text

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., Lokesh1 lokeshbstri@gmail.com, Kaulgud, Narasimha2 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
FullText Links:
  – Type: pdflink
Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 194195916
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Adaptive Quantum Secret Sharing with Post-Quantum Authentication and Dynamic Routing in Scalable Networks.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22B%2E+S%2E%2C+Lokesh%22">B. S., Lokesh</searchLink><relatesTo>1</relatesTo><i> lokeshbstri@gmail.com</i><br /><searchLink fieldCode="AR" term="%22Kaulgud%2C+Narasimha%22">Kaulgud, Narasimha</searchLink><relatesTo>2</relatesTo><i> narasimha.kaulgud@nie.ac.in</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22IAENG+International+Journal+of+Applied+Mathematics%22">IAENG International Journal of Applied Mathematics</searchLink>. Jun2026, Vol. 56 Issue 6, p2260-2264. 5p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Quantum+cryptography%22">Quantum cryptography</searchLink><br /><searchLink fieldCode="DE" term="%22Adaptive+routing+%28Computer+network+management%29%22">Adaptive routing (Computer network management)</searchLink><br /><searchLink fieldCode="DE" term="%22Scalability%22">Scalability</searchLink><br /><searchLink fieldCode="DE" term="%22Cryptography%22">Cryptography</searchLink><br /><searchLink fieldCode="DE" term="%22Quantum+entanglement%22">Quantum entanglement</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+network+security%22">Computer network security</searchLink><br /><searchLink fieldCode="DE" term="%22Quantum+computing%22">Quantum computing</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: 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]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>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.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=194195916
RecordInfo BibRecord:
  BibEntity:
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 5
        StartPage: 2260
    Subjects:
      – SubjectFull: Quantum cryptography
        Type: general
      – SubjectFull: Adaptive routing (Computer network management)
        Type: general
      – SubjectFull: Scalability
        Type: general
      – SubjectFull: Cryptography
        Type: general
      – SubjectFull: Quantum entanglement
        Type: general
      – SubjectFull: Computer network security
        Type: general
      – SubjectFull: Quantum computing
        Type: general
    Titles:
      – TitleFull: Adaptive Quantum Secret Sharing with Post-Quantum Authentication and Dynamic Routing in Scalable Networks.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: B. S., Lokesh
      – PersonEntity:
          Name:
            NameFull: Kaulgud, Narasimha
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 06
              Text: Jun2026
              Type: published
              Y: 2026
          Identifiers:
            – Type: issn-print
              Value: 19929978
          Numbering:
            – Type: volume
              Value: 56
            – Type: issue
              Value: 6
          Titles:
            – TitleFull: IAENG International Journal of Applied Mathematics
              Type: main
ResultId 1