Related papers: Quantum secret sharing with two qubit bipartite mi…
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 investigate the concept of quantum secret sharing. In a ((k,n)) threshold scheme, a secret quantum state is divided into n shares such that any k of those shares can be used to reconstruct the secret, but any set of k-1 or fewer shares…
We investigate definitions of and protocols for multi-party quantum computing in the scenario where the secret data are quantum systems. We work in the quantum information-theoretic model, where no assumptions are made on the computational…
Quantum entanglement in multipartite systems cannot be shared freely. In order to illuminate basic rules of entanglement sharing between qubits we introduce a concept of an entangled structure (graph) such that each qubit of a multipartite…
Entanglement is a key resource of quantum science for tasks that require it to be shared among participants. Within atomic, condensed matter and photonic many-body systems the distribution and sharing of entanglement is of particular…
In quantum secret sharing, a quantum secret state is mapped to multiple shares such that shares from qualified sets can recover the secret state and shares from other forbidden sets reveal nothing about the secret state; we study the…
Quantum secret sharing plays an important role in quantum communications and secure multiparty computation. In this paper, we present a new measurement-device-independent quantum secret sharing protocol, which can double the space distance…
We study the existence of absolutely maximally entangled (AME) states in quantum mechanics and its applications to quantum information. AME states are characterized by being maximally entangled for all bipartitions of the system and exhibit…
We present a scheme for multiparty quantum secret sharing of a private key with pure entangled states and decoy photons. The boss, say Alice uses the decoy photons, which are randomly in one of the four nonorthogonal single-photon states,…
A single quantum state can be shared by many distant parties. In this thesis, we try to characterize the information contents of such distributed states by defining the multiparty information and the multiparty squashed entanglement, two…
The increasing sophistication of available quantum networks has seen a corresponding growth in the pursuit of multi-partite cryptographic protocols. Whilst the use of multi-partite entanglement is known to offer an advantage in certain…
We report two key distribution schemes achieved by swapping quantum entanglement. Using two Bell states, two bits of secret key can be shared between two distant parties that play symmetric and equal roles. We also address eavesdropping…
I present a variety of results on the theory of quantum secret sharing. I show that any mixed state quantum secret sharing scheme can be derived by discarding a share from a pure state scheme, and that the size of each share in a quantum…
Quantum secret sharing is a scheme for encoding a quantum state (the secret) into multiple shares and distributing them among several participants. If a sufficient number of shares are put together, then the secret can be fully…
Quantum secret sharing (QSS) is a cryptographic protocol that leverages quantum mechanics to distribute a secret among multiple parties. With respect to the classical counterpart, in QSS the secret is encoded into quantum states and shared…
Quantum data hiding stores classical information in bipartite quantum states that are, in principle, perfectly distinguishable, yet remain almost indistinguishable without access to a quantum communication channel. Here, we investigate…
We study a quantum switch that distributes maximally entangled multipartite states to sets of users. The entanglement switching process requires two steps: first, each user attempts to generate bipartite entanglement between itself and the…
In a realistic situation, the secret sharing of classical or quantum information will involve the transmission of this information through noisy channels. We consider a three qubit pure state. This state becomes a mixed-state when the…
In this work, we present a quantum secret sharing scheme based on Bell state entanglement and sequential projection measurements. The protocol verifies the $n$ out of $n$ scheme and supports the aborting of the protocol in case all the…
We discuss a model for quantum computing with initially mixed states. Although such a computer is known to be less powerful than a quantum computer operating with pure (entangled) states, it may efficiently solve some problems for which no…