A distributed and parallel $(k, n)$ QSS scheme with verification capability
Theodore Andronikos

TL;DR
This paper presents a novel distributed quantum secret sharing scheme with verification, enabling parallel operation across multiple locations, reducing complexity, and ensuring security without pre-shared keys or signatures.
Contribution
It introduces a fully distributed, parallel $(k, n)$ quantum secret sharing protocol with verification, utilizing entanglement and simple quantum gates, and provides comprehensive security analysis.
Findings
Operates completely in parallel across distributed locations.
Eliminates need for quantum signatures or pre-shared keys.
Secure against eavesdroppers and rogue agents.
Abstract
This article introduces a novel Quantum Secret Sharing scheme with threshold and endowed with verification capability. The new protocol exploits the power of entanglement and evolves in three phases. The primary novelty of the new protocol lies in its ability to operate completely parallelly in a fully distributed setup, where the spymaster and her agents all are in different locations, in contrast to the vast majority of analogous protocols that assume a localized scenario in which all agents are at the same place. The spymaster sends all necessary information to all intended recipients simultaneously in one step. All phases are executed in parallel, minimizing the overall execution cost of the protocol. Given its comparative complexity, we provide a comprehensive and detailed analysis to establish its information-theoretic security in the sense of preventing both outside…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCryptography and Data Security · Advanced Data Storage Technologies · Simulation Techniques and Applications
