Single Qubit Quantum Secret Sharing

We give an example of a wide class of problems for which quantum information protocols based on multi-system entanglement can be mapped into much simpler ones involving one system. Secret sharing is a cryptographic primitive which plays a central role in various secure multiparty computation tasks and management of keys in cryptography. In secret sharing protocols, a classical message is divided into shares given to recipient parties in such a way that some number of parties ...

Secret sharing is a procedure for splitting a message into several parts so that no subset of parts is sufficient to read the message, but the entire set is. We show how this procedure can be implemented using GHZ states. In the quantum case the presence of an eavesdropper will introduce errors so that his presence can be detected. We also show how GHZ states can be used to split quantum information into two parts so that both parts are necessary to reconstruct the original q...

We propose a new quantum secret sharing scheme using a single non-entangled qubit. In the scheme, by transmitting a qubit to the next party sequentially, a sender can securely transmit a secret message to $N$ receivers who could only decode the message cooperatively after randomly shuffling the polarization of the qubit. We explain this quantum secret sharing scheme into the one between a sender and two receivers, and generalize the scheme between a sender and $N$ receivers. ...

Analyzing carefully an experimentally feasible non-entangled single qubit quantum secret sharing protocol and its modified version [Phys. Rev. Lett. 95, 230505 (2005); ibid. 98, 028902 (2007)], it is found that both versions are insecure against coherent attacks though the original idea is so remarkable. To overcome this fatal flaw, here we propose a protocol with a distinct security checking strategy, which still involves single qubit operations only, making it possible to a...

We introduce a protocol for quantum secret sharing based on reusable entangled states. The entangled state between the sender and the receiver acts only as a carrier to which data bits are entangled by the sender and disentangled from it by the receivers, all by local actions of simple gates. We also show that the interception by Eve or the cheating of one of the receivers introduces a quantum bit error rate (QBER) larger than 25 percent which can be detected by comparing...

The work presents a novel quantum secret sharing strategy based on GHZ product state sharing between three parties. The dealer, based on the classical information to be shared, toggles his qubit and shares the product state. The other parties make their Bell measurements and collude to reconstruct the secret. Unlike the other protocols, this protocol does not involve the entire initial state reconstruction, rather uses selective qubits to discard the redundant qubits at the t...

This paper introduces the Symmetric Extensible Quantum Secret Sharing protocol, which is a novel quantum protocol for secret sharing. At its heart, it is an entanglement based protocol that relies on the use of maximally entangled GHZ tuples, evenly distributed among the players, endowing the spymaster with the ability to securely share a secret message with her agents. It offers uncompromising security, making virtually impossible for a malicious eavesdropper or a rogue doub...

Secret sharing is a procedure for sharing a secret among a number of participants such that only the qualified subsets of participants have the ability to reconstruct the secret. Even in the presence of eavesdropping, secret sharing can be achieved when all the members are quantum. So what happens if not all the members are quantum? In this paper we propose two semi-quantum secret sharing protocols using maximally entangled GHZ-type states in which quantum Alice shares a secr...

In this note, we study some properties of the GHZ state. First, we present a quantum secret sharing scheme in which the participants require only classical channels in order to reconstruct the secret; our protocol is significantly more efficient than the trivial usage of teleportation. Second, we show that the classical simulation of an n-party GHZ state requires at least n log n - 2n bits of communication. Finally, we present a problem simpler than the complete simulation of...

In a conventional quantum (k,n) threshold scheme, a trusted party shares a secret quantum state with n participants such that any k of those participants can cooperate to recover the original secret, while fewer than k participants obtain no information about the secret. In this paper we show how to construct a quantum (k,n) threshold scheme without the assistance of a trusted party, who generates and distributes shares among the participants. Instead, each participant choose...