Resilient Quantum Secret Sharing Against Collusion and Eavesdropping: A Measurement-Basis and Hash-Based Approachn

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

The paper studies a new quantum secret sharing protocol designed to resist collusion and eavesdropping, using hash-based derivation of measurement bases and decoy-photon–enhanced eavesdropping detection. Using a multi-party QSS framework, the authors report that the scheme enables fair, deterministic secret reconstruction without entangled states or complex quantum operations, and they provide correctness and security analyses against internal and external adversaries, along with efficiency comparisons (qubit usage, transmission delay, and computational overhead). A stated caveat is that the work is presented as a research preprint that has not been peer reviewed by a journal. Relevance to endometriosis: it was included in the corpus only via an upstream keyword match; the paper’s content is about quantum cryptography and does not explicitly discuss endometriosis or adenomyosis.

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

Abstract

Abstract Quantum secret sharing (QSS) is a fundamental primitive in quantum cryptography, enabling secure distribution of sensitive information among multiple parties. However, existing protocols often suffer from vulnerabilities such as collusion attacks, uneven share distribution, and protocol failure due to random basis selection. In this paper, we propose a novel QSS protocol that integrates hash-based measurement basis derivation with decoy photon-enhanced eavesdropping detection. Our scheme ensures fair and deterministic secret reconstruction while eliminating the need for entangled states or complex quantum operations. We rigorously analyze the protocol's correctness, security against both internal and external adversaries, and efficiency in terms of qubit usage, transmission delay, and computational overhead. Notably, our protocol supports dynamic participant management, allowing agents to join or leave securely without re-executing the entire protocol. Comparative analysis demonstrates that our approach outperforms existing QSS protocols across multiple performance metrics. This work bridges the gap between theoretical robustness and practical deployment, offering a scalable and resilient solution for post-quantum secure communication.
Full text 10,553 characters · extracted from preprint-html · click to expand
Resilient Quantum Secret Sharing Against Collusion and Eavesdropping: A Measurement-Basis and Hash-Based Approachn | 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 Resilient Quantum Secret Sharing Against Collusion and Eavesdropping: A Measurement-Basis and Hash-Based Approachn Wenting Pan, Kun Zhang, Yu Zhou, Jing Xue This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-7151564/v1 This work is licensed under a CC BY 4.0 License Status: Posted Version 1 posted You are reading this latest preprint version Abstract Quantum secret sharing (QSS) is a fundamental primitive in quantum cryptography, enabling secure distribution of sensitive information among multiple parties. However, existing protocols often suffer from vulnerabilities such as collusion attacks, uneven share distribution, and protocol failure due to random basis selection. In this paper, we propose a novel QSS protocol that integrates hash-based measurement basis derivation with decoy photon-enhanced eavesdropping detection. Our scheme ensures fair and deterministic secret reconstruction while eliminating the need for entangled states or complex quantum operations. We rigorously analyze the protocol's correctness, security against both internal and external adversaries, and efficiency in terms of qubit usage, transmission delay, and computational overhead. Notably, our protocol supports dynamic participant management, allowing agents to join or leave securely without re-executing the entire protocol. Comparative analysis demonstrates that our approach outperforms existing QSS protocols across multiple performance metrics. This work bridges the gap between theoretical robustness and practical deployment, offering a scalable and resilient solution for post-quantum secure communication. Encryption Measurement-Basis Encryption Multi-Party Quantum Secret Sharing Quantum Cryptography Quantum Secret Sharing Full Text Additional Declarations No competing interests reported. Cite Share Download PDF Status: Posted Version 1 posted 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-7151564","acceptedTermsAndConditions":true,"allowDirectSubmit":true,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":492752813,"identity":"6969d001-5c2f-4f82-b590-e3fab3b94e80","order_by":0,"name":"Wenting Pan","email":"","orcid":"","institution":"Hainan Normal University","correspondingAuthor":false,"prefix":"","firstName":"Wenting","middleName":"","lastName":"Pan","suffix":""},{"id":492752814,"identity":"08356aa2-9f41-4cea-a273-71c0acecfae8","order_by":1,"name":"Kun Zhang","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAA6klEQVRIiWNgGAWjYBACCSBmBjH4gawDELEEIrVIziBZi8ENuBgBLZIzcg9/Lqi5Y7f5dvPDw4U7DjPws+cYMPzcgVuLtERegvGMY8+St905ZnB45pnDDJI9bwwYe8/g1iInkWOQzMN2ONnsRoLBYd62w0AX5hgwM7bh13KY59/hZOMZ6R/AWuwJaZGWyDFsBqq0MwDpBdsiQUAL0OXGzLx9hxMkbuQUALWk80iceVZwsBePFonjOcafeb4dtuefkb75M2+btRx/e/LGBz/xaIGBxAYogwdEHCCsgYHBnhhFo2AUjIJRMEIBAEIuUSy3wU4uAAAAAElFTkSuQmCC","orcid":"","institution":"Hainan Normal University","correspondingAuthor":true,"prefix":"","firstName":"Kun","middleName":"","lastName":"Zhang","suffix":""},{"id":492752815,"identity":"cf1a6898-da78-44d4-acc5-0db70b7f3c8c","order_by":2,"name":"Yu Zhou","email":"","orcid":"","institution":"Hainan Normal University","correspondingAuthor":false,"prefix":"","firstName":"Yu","middleName":"","lastName":"Zhou","suffix":""},{"id":492752816,"identity":"27a7d9c9-969e-44db-949c-e4d098ecd0eb","order_by":3,"name":"Jing Xue","email":"","orcid":"","institution":"Hainan Tropical Ocean University","correspondingAuthor":false,"prefix":"","firstName":"Jing","middleName":"","lastName":"Xue","suffix":""}],"badges":[],"createdAt":"2025-07-17 18:08:15","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-7151564/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-7151564/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":92434697,"identity":"b394a4ec-6387-42e0-9e99-ee3f82e2c4d1","added_by":"auto","created_at":"2025-09-29 16:46:53","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":2233357,"visible":true,"origin":"","legend":"","description":"","filename":"EPJQuantumTechnology.pdf","url":"https://assets-eu.researchsquare.com/files/rs-7151564/v1_covered_e18c679b-e4da-437d-bdeb-409bad57f34d.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"Resilient Quantum Secret Sharing Against Collusion and Eavesdropping: A Measurement-Basis and Hash-Based Approachn","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":false,"hideJournal":true,"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":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true},"keywords":"Encryption, Measurement-Basis Encryption, Multi-Party Quantum Secret Sharing, Quantum Cryptography, Quantum Secret Sharing","lastPublishedDoi":"10.21203/rs.3.rs-7151564/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-7151564/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"\u003cp\u003eQuantum secret sharing (QSS) is a fundamental primitive in quantum cryptography, enabling secure distribution of sensitive information among multiple parties. However, existing protocols often suffer from vulnerabilities such as collusion attacks, uneven share distribution, and protocol failure due to random basis selection. In this paper, we propose a novel QSS protocol that integrates hash-based measurement basis derivation with decoy photon-enhanced eavesdropping detection. Our scheme ensures fair and deterministic secret reconstruction while eliminating the need for entangled states or complex quantum operations. We rigorously analyze the protocol's correctness, security against both internal and external adversaries, and efficiency in terms of qubit usage, transmission delay, and computational overhead. Notably, our protocol supports dynamic participant management, allowing agents to join or leave securely without re-executing the entire protocol. Comparative analysis demonstrates that our approach outperforms existing QSS protocols across multiple performance metrics. This work bridges the gap between theoretical robustness and practical deployment, offering a scalable and resilient solution for post-quantum secure communication.\u003c/p\u003e","manuscriptTitle":"Resilient Quantum Secret Sharing Against Collusion and Eavesdropping: A Measurement-Basis and Hash-Based Approachn","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2025-07-30 11:35:13","doi":"10.21203/rs.3.rs-7151564/v1","editorialEvents":[{"type":"communityComments","content":0}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true}}],"origin":"","ownerIdentity":"9e1c0367-b212-4ed9-af58-e34237273794","owner":[],"postedDate":"July 30th, 2025","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"posted","subjectAreas":[],"tags":[],"updatedAt":"2025-09-29T16:38:40+00:00","versionOfRecord":[],"versionCreatedAt":"2025-07-30 11:35:13","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-7151564","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-7151564","identity":"rs-7151564","version":["v1"]},"buildId":"8U1c8b4HqxoKbykW_rLl7","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 (2025) — 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
unpaywall
last seen: 2026-05-22T02:00:06.705733+00:00
License: CC-BY-4.0