HT-ADA: Scalable Hierarchical-Tree Quantum Key Distribution with Adaptive Optimization and Entropy-Enhanced Security

preprint OA: closed
Full text JSON View at publisher
AI-generated deep summary by claude@2026-06, 2026-06-24 · read from full text

The preprint proposes HT-ADA, a hierarchical-tree quantum key distribution protocol aimed at scalable multi-user quantum communication, combining per-link adaptive decoy allocation, Hoeffding-bound eavesdropper detection, and entropy-based key analysis within a composable security framework. Using numerical simulations with realistic fiber noise (2%) and an eavesdropper attack strength range (0.1–0.3), it reports 99% detection rates, near-ideal entropy values (~0.999 bits), and 2.7× higher key rates than static-decoy schemes across 8–32 node networks. A stated caveat is that results are based on simulations and the work is presented as a preprint that has not been peer reviewed. The paper does not explicitly discuss endometriosis or adenomyosis; it was included in the corpus via a keyword match in the upstream search index.

Read from the paper's body, not the abstract. Not a substitute for reading the paper. No clinical advice. How this works

Full text 11,583 characters · extracted from preprint-html · click to expand
HT-ADA: Scalable Hierarchical-Tree Quantum Key Distribution with Adaptive Optimization and Entropy-Enhanced Security | Research Square window.SnipcartSettings = { analytics: { enabled: false } }; (function() { var accessVector = localStorage.getItem('access_vector') || ''; window.dataLayer = window.dataLayer || []; if (accessVector) { window.dataLayer.push({ user: { profile: { profileInfo: { snid: accessVector } } } }); } })(); (function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start':new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0],j=d.createElement(s),dl=l!='dataLayer'?'&l='+l:'';j.async=true;j.src='https://www.googletagmanager.com/gtm.js?id='+i+dl;f.parentNode.insertBefore(j,f);})(window,document,'script','dataLayer','GTM-K279D39R'); Browse Preprints In Review Journals COVID-19 Preprints AJE Video Bytes Research Tools Research Promotion AJE Professional Editing AJE Rubriq About Preprint Platform In Review Editorial Policies Our Team Advisory Board Help Center Sign In Submit a Preprint Cite Share Download PDF Research Article HT-ADA: Scalable Hierarchical-Tree Quantum Key Distribution with Adaptive Optimization and Entropy-Enhanced Security khaled Berkani This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-8491202/v1 This work is licensed under a CC BY 4.0 License Status: Under Revision Version 1 posted 7 You are reading this latest preprint version Abstract Traditional QKD protocols limit scalability in multi-user networks due topoint-to-point designs and static decoy states. We propose HT-ADA, a novel hierarchical tree quantum key distribution protocol integrating per-link adaptive decoy allocation (ADA), Hoeffding-bound eavesdropper detection, and entropy-based key analysis within a composable security framework. HT-ADA distributes secure keys across multi-node tree networks, dynamically adjusting decoy probabilities to optimize detection sensitivity while minimizing communication overhead. Numerical simulations under realistic fiber-based noise (2%) and attack conditions (Eve strength 0.1-0.3) demonstrate 99% detection rates, near-ideal entropy (0.999 bits), and 2.7× higher key rates compared to static-decoy schemes across 8-32 node networks. HT-ADA provides a scalable, composable framework for future quantumnetworks with experimentally realistic parameters. Quantum Key Distribution (QKD) Composable Security Multi User Quantum Communication Hierarchical Tree Networks Adaptive Decoy States Eavesdropper Detection Quantum Bit Error Rate (QBER) Entropy Based Security Privacy Amplification Full Text Additional Declarations No competing interests reported. Cite Share Download PDF Status: Under Revision Version 1 posted Editorial decision: Revision requested 24 Apr, 2026 Reviews received at journal 26 Mar, 2026 Reviewers agreed at journal 08 Mar, 2026 Reviewers invited by journal 04 Feb, 2026 Editor assigned by journal 30 Jan, 2026 Submission checks completed at journal 03 Jan, 2026 First submitted to journal 31 Dec, 2025 You are reading this latest preprint version Research Square lets you share your work early, gain feedback from the community, and start making changes to your manuscript prior to peer review in a journal. As a division of Research Square Company, we’re committed to making research communication faster, fairer, and more useful. We do this by developing innovative software and high quality services for the global research community. Our growing team is made up of researchers and industry professionals working together to solve the most critical problems facing scientific publishing. Also discoverable on Platform About Our Team In Review Editorial Policies Advisory Board Help Center Resources Author Services Accessibility API Access RSS feed Manage Cookie Preferences © Research Square 2026 | ISSN 2693-5015 (online) Privacy Policy Terms of Service Do Not Sell My Personal Information {"props":{"pageProps":{"initialData":{"identity":"rs-8491202","acceptedTermsAndConditions":true,"allowDirectSubmit":false,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":568703259,"identity":"5441661e-d7d4-4757-afee-7f39735851a5","order_by":0,"name":"khaled Berkani","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAA6klEQVRIiWNgGAWjYBACAwkGBsYGBgYeNmbmgw+AAjx8RGvhY29LNgBpYSNWC4MczxkzCZAIQS3m0s3HPs6ouSPDJpFjVvk1x06GjYH54aMbeLRYzjmWPHPDsWc8bBJpZbdltyUDHcZmbJyDz2E3cowZH7AdBmpJ3nZbchszUAsPmzR+LfmfGR/8A2lJMCuW3FZPjJYcZsaNbUAtPEfMGD9uO0xYC9Avxowz+4AqgYEszbjtODCCCPgFGGKPGXu+HbaXb2Y++PHntmp7fvbmh4/xaUEBzDxgkljlIMD4gxTVo2AUjIJRMGIAANK8RL9wiJc4AAAAAElFTkSuQmCC","orcid":"","institution":"University of Batna2 Algeria","correspondingAuthor":true,"prefix":"","firstName":"khaled","middleName":"","lastName":"Berkani","suffix":""}],"badges":[],"createdAt":"2025-12-31 16:46:45","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-8491202/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-8491202/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":99665014,"identity":"abfd95d2-37b7-4fb2-8ac6-9d472bdd51fe","added_by":"auto","created_at":"2026-01-07 05:11:29","extension":"pdf","order_by":0,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":6717527,"visible":true,"origin":"","legend":"","description":"","filename":"distribution1500.pdf","url":"https://assets-eu.researchsquare.com/files/rs-8491202/v1/309619b48c10cee1a1b3838d.pdf"},{"id":99665013,"identity":"68ed416f-14e9-45eb-8996-886322157ca4","added_by":"auto","created_at":"2026-01-07 05:11:29","extension":"json","order_by":1,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":3250,"visible":true,"origin":"","legend":"","description":"","filename":"67dcb7c44da042af8a20ba3028249301.json","url":"https://assets-eu.researchsquare.com/files/rs-8491202/v1/ecad4e8992ab1d49d23bc85b.json"},{"id":99794882,"identity":"e21fa802-68a0-44ae-ab34-1e7f9bd8b0fc","added_by":"auto","created_at":"2026-01-08 13:36:34","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":1063032,"visible":true,"origin":"","legend":"","description":"","filename":"distribution1500.pdf","url":"https://assets-eu.researchsquare.com/files/rs-8491202/v1_covered_ccf716d5-3034-4761-a8cb-05c8e3827623.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"HT-ADA: Scalable Hierarchical-Tree Quantum Key Distribution with Adaptive Optimization and Entropy-Enhanced Security","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":true,"hideJournal":false,"highlight":"","institution":"","isAcceptedByJournal":false,"isAuthorSuppliedPdf":true,"isDeskRejected":"","isHiddenFromSearch":false,"isInQc":false,"isInWorkflow":false,"isPdf":true,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"[email protected]","identity":"quantum-information-processing","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"qinp","sideBox":"Learn more about [Quantum Information Processing](http://link.springer.com/journal/11128)","snPcode":"11128","submissionUrl":"https://submission.nature.com/new-submission/11128/3","title":"Quantum Information Processing","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"stoa","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false},"keywords":"Quantum Key Distribution (QKD), Composable Security, Multi User Quantum Communication, Hierarchical Tree Networks, Adaptive Decoy States, Eavesdropper Detection, Quantum Bit Error Rate (QBER), Entropy Based Security, Privacy Amplification","lastPublishedDoi":"10.21203/rs.3.rs-8491202/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-8491202/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"Traditional QKD protocols limit scalability in multi-user networks due topoint-to-point designs and static decoy states. We propose HT-ADA, a novel hierarchical tree quantum key distribution protocol integrating per-link adaptive decoy allocation (ADA), Hoeffding-bound eavesdropper detection, and entropy-based key analysis within a composable security framework. HT-ADA distributes secure keys across multi-node tree networks, dynamically adjusting decoy probabilities to optimize detection sensitivity while minimizing communication overhead. Numerical simulations under realistic fiber-based noise (2%) and attack conditions (Eve strength 0.1-0.3) demonstrate 99% detection rates, near-ideal entropy (0.999 bits), and 2.7× higher key rates compared to static-decoy schemes across 8-32 node networks. HT-ADA provides a scalable, composable framework for future quantumnetworks with experimentally realistic parameters.","manuscriptTitle":"HT-ADA: Scalable Hierarchical-Tree Quantum Key Distribution with Adaptive Optimization and Entropy-Enhanced Security","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2026-01-07 05:11:24","doi":"10.21203/rs.3.rs-8491202/v1","editorialEvents":[{"type":"communityComments","content":0},{"type":"decision","content":"Revision requested","date":"2026-04-24T14:11:03+00:00","index":"","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2026-03-27T01:28:50+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"24713726740366200954997347973331768232","date":"2026-03-09T00:26:38+00:00","index":"hide","fulltext":""},{"type":"reviewersInvited","content":"","date":"2026-02-04T13:50:42+00:00","index":"","fulltext":""},{"type":"editorAssigned","content":"","date":"2026-01-30T13:22:51+00:00","index":"","fulltext":""},{"type":"checksComplete","content":"","date":"2026-01-03T08:10:30+00:00","index":"","fulltext":""},{"type":"submitted","content":"Quantum Information Processing","date":"2025-12-31T16:24:50+00:00","index":"","fulltext":""}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"quantum-information-processing","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"qinp","sideBox":"Learn more about [Quantum Information Processing](http://link.springer.com/journal/11128)","snPcode":"11128","submissionUrl":"https://submission.nature.com/new-submission/11128/3","title":"Quantum Information Processing","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"stoa","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false}}],"origin":"","ownerIdentity":"8c4dc82b-0f90-4d27-8cb6-9874f06b2223","owner":[],"postedDate":"January 7th, 2026","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"in-revision","subjectAreas":[],"tags":[],"updatedAt":"2026-04-24T14:25:57+00:00","versionOfRecord":[],"versionCreatedAt":"2026-01-07 05:11:24","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-8491202","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-8491202","identity":"rs-8491202","version":["v1"]},"buildId":"XKTyCvWXoU3ODBz1xrDgd","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}

Text is read by the "Ask this paper" AI Q&A widget below. Extraction quality varies by source — PMC NXML preserves structure cleanly, OA-HTML may include some navigation residue, and OA-PDF can have broken hyphenation. The publisher copy (via DOI) is the canonical version.

My notes (saved in your browser only)

Ask this paper AI returns verbatim quotes from the full text · source: preprint-html

Answers must be backed by verbatim quotes from this paper's full text. Hallucinated quotes are dropped automatically; if no verbatim passage answers the question, we say so. How this works

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. This is a recent paper (2026) — citers typically take a year or two to land, and the OpenAlex reference graph may still be filling in.

Source provenance

europepmc
last seen: 2026-05-20T01:45:00.602351+00:00