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

Abstract

This article introduces a novel Quantum Secret Sharing scheme with $(k,n)$ 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 eavesdroppers from obtaining any useful information and inside rogue agents from sabotaging its successful completion. The protocol eliminates the need for a quantum signature scheme or pre-shared keys, thereby simplifying the process and lowering complexity. Finally, the possibility of its implementation by contemporary quantum computers is promising because the protocol relies exclusively on CNOT and Hadamard gates and all players operating on similar or identical quantum circuits.

References in corpus (34)

• Experimental quantum teleportation
• Quantum cryptography: Public key distribution and coin tossing
• Quantum secret sharing
• A Two-Step Quantum Direct Communication Protocol Using Einstein-Podolsky-Rosen Pair Block
• How to share a quantum secret
• Secure Direct Communication with a Quantum One-Time-Pad
• Security Aspects of Practical Quantum Cryptography
• Quantum Games and Quantum Strategies
• Efficient Multi-Party Quantum Secret Sharing Schemes
• Quantum strategies
• Security against individual attacks for realistic quantum key distribution
• On the Theory of Quantum Secret Sharing
• Quantum Cryptography with Coherent States
• Teleportation and Secret Sharing with Pure Entangled States
• Long-Distance Measurement-Device-Independent Multiparty Quantum Communication
• Experimental demonstration of graph-state quantum secret sharing
• Secret Sharing with a Single d-level Quantum System
• Efficient quantum algorithms for $GHZ$ and $W$ states, and implementation on the IBM quantum computer
• Efficient high-capacity quantum secret sharing with two-photon entanglement
• Quantum secret sharing using weak coherent states
• Quantum Advantage in Cryptography
• Secure Quantum Secret Sharing without Signal Disturbance Monitoring
• Device-independent quantum secret sharing with noise preprocessing and postselection
• Multi-party quantum private comparison of size relation with d-level single-particle states
• Reducing the quantum communication cost of quantum secret sharing
• Multipartite Continuous Variable Solution for the Byzantine Agreement Problem
• Continuous Variable Solution for Byzantine Agreement
• QKD based on symmetric entangled Bernstein-Vazirani
• Quantum Protocol for Decision Making and Verifying Truthfulness among $N$-quantum Parties: Solution and Extension of the Quantum Coin Flipping Game
• Conditions that enable a player to surely win in sequential quantum games
• A symmetric extensible protocol for quantum secret sharing
• Quantum secret aggregation utilizing a network of agents
• A Quantum Detectable Byzantine Agreement Protocol using only EPR pairs
• One-to-Many Simultaneous Secure Quantum Information Transmission

Cited by in corpus (2)

• Quantum Shadows: The Dining Information Brokers
• A novel $2$ \& $3$ player scheme for Quantum Direct Communication