Related papers: Sharing a quantum secret without a trusted party
In single-qubit quantum secret sharing, a secret is shared between N parties via manipulation and measurement of one qubit at a time. Each qubit is sent to all N parties in sequence; the secret is encoded in the first participant's…
In this article we present a general security strategy for quantum secret sharing (QSS) protocols based on the HBB scheme presented by Hillery, Bu\v{z}ek and Berthiaume [Phys. Rev A \textbf{59}, 1829 (1999)]. We focus on a generalization of…
Each member of an $n$-person team has a secret, say a password. The $k$ out of $n$ gruppen secret sharing requires that any group of $k$ members should be able to recover the secrets of the other $n-k$ members, while any group of $k-1$ or…
A quantum key distribution scheme whose security depends on the features of pre- and post-selected quantum states is described.
The paper concerns the protection of the secrecy of ballots, so that the identity of the voters cannot be matched with their vote. To achieve this we use an entangled quantum state to represent the ballots. Each ballot includes the identity…
We investigate how a classical private key can be used by two players, connected by an insecure one-way quantum channel, to perform private communication of quantum information. In particular we show that in order to transmit n qubits…
Quantum secret sharing schemes are a family of quantum cryptographic protocols which provide secure quantum encodings, mapping one secret to multiple shares of information such that the original secret cannot be accessed without an…
The work presents an amalgam of quantum search algorithm (QSA) and quantum secret sharing (QSS). The proposed QSS scheme utilizes Grover's three-particle quantum state. In this scheme, the dealer prepares an encoded state by encoding the…
We develop the concept of quantum carrier and show that messages can be uploaded and downloaded from this carrier and while in transit, these messages are hidden from external agents. We explain in detail the working of the quantum carrier…
We introduce and analyse approximate quantum secret sharing in a formal cryptographic setting, wherein a dealer encodes and distributes a quantum secret to players such that authorized structures (sets of subsets of players) can…
States with private correlations but little or no distillable entanglement were recently reported. Here, we consider the secure distribution of such states, i.e., the situation when an adversary gives two parties such states and they have…
Quantum distillation is the task of concentrating quantum correlations present in 'N' imperfect copies using free operations by involving all 'P' parties sharing the quantum correlations. We present a threshold quantum distillation task…
Entanglement is a well-known resource in quantum information, in particular it can be exploited for quantum key distribution (QKD). In this paper we define a two-way QKD scheme employing GHZ-type states of three qubits obtaining an…
Quantum information allows us to build quantum money schemes, where a bank can issue banknotes in the form of authenticatable quantum states that cannot be cloned or counterfeited. Similar to paper banknotes, in existing quantum money…
Quantum computers can solve specific complex tasks for which no reasonable-time classical algorithm is known. Quantum computers do however also offer inherent security of data, as measurements destroy quantum states. Using shared entangled…
We present a three-stage quantum cryptographic protocol guaranteeing security in which each party uses its own secret key. Unlike the BB84 protocol, where the qubits are transmitted in only one direction and classical information exchanged…
In this paper we introduce a quantum information theoretical model for quantum secret sharing schemes. We show that quantum information theory provides a unifying framework for the study of these schemes. We prove that the information…
Four-qubit Smolin bound entangled state has a distinct feature: the state is not distillable when every qubit is seperated from each other; but it makes two separated qubit entangled if the other qubits group together. Here the feature is…
We consider the task of sharing a secret quantum state in a quantum network in a verifiable way. We propose a protocol that achieves this task, while reducing the number of required qubits, as compared to the existing protocols. To achieve…
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…