Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userEntanglement-secured single-qubit quantum secret-sharing
235
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
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 participants preparation of the qubit state and the subsequent participants choices of state rotation or measurement basis. We present a protocol for single-qubit quantum secret sharing using polarization entanglement of photon pairs produced in type-I spontaneous parametric downconversion. We investigate the protocols security against eavesdropping attack under common experimental conditions: a lossy channel for photon transmission, and imperfect preparation of the initial qubit state. A protocol which exploits entanglement between photons, rather than simply polarization correlation, is more robustly secure. We implement the entanglement-based secret-sharing protocol with 87% secret-sharing fidelity, limited by the purity of the entangled state produced by our present apparatus. We demonstrate a photon-number splitting eavesdropping attack, which achieves no success against the entanglement-based protocol while showing the predicted rate of success against a correlation-based protocol.
rate research
Read More
Quantum protocols for secret sharing usually rely on multi-party entanglement which with present technology is very difficult to achieve. Recently it has been shown that sequential manipulation and communication of a single $d-$ level state can do the same task of secret sharing between $N$ parties, hence alleviating the need for entanglement. However the suggested protocol which is based on using mutually unbiased bases, works only when $d$ is a prime number. We propose a new sequential protocol which is valid for any $d$.
To detect frauds from some internal participants or external attackers, some verifiable threshold quantum secret sharing schemes have been proposed. In this paper, we present a new verifiable threshold structure based on a single qubit using bivariate polynomial. First, Alice chooses an asymmetric bivariate polynomial and sends a pair of values from this polynomial to each participant. Then Alice and participants implement in sequence unitary transformation on the $d$-dimensional quantum state based on unbiased bases, where those unitary transformations are contacted by this polynomial. Finally, security analysis shows that the proposed scheme can detect the fraud from external and internal attacks compared with the exiting schemes and is comparable to the recent schemes.
In this paper we define a kind of decomposition for a quantum access structure. We propose a conception of minimal maximal quantum access structure and obtain a sufficient and necessary condition for minimal maximal quantum access structure, which shows the relationship between the number of minimal authorized sets and that of the players. Moreover, we investigate the construction of efficient quantum secret schemes by using these techniques, a decomposition and minimal maximal quantum access structure. A major advantage of these techniques is that it allows us to construct a method to realize a general quantum access structure. For these quantum access structures, we present two quantum secret schemes via the idea of concatenation or a decomposition of a quantum access structure. As a consequence, the application of these techniques allow us to save more quantum shares and reduce more cost than the existing scheme.
We develop a connection between tripartite information $I_3$, secret sharing protocols and multi-unitaries. This leads to explicit ((2,3)) threshold schemes in arbitrary dimension minimizing tripartite information $I_3$. As an application we show that Page scrambling unitaries simultaneously work for all secrets shared by Alice. Using the $I_3$-Ansatz for imperfect sharing schemes we discover examples of VIP sharing schemes.
In this work, we investigate what kinds of quantum states are feasible to perform perfectly secure secret sharing, and present its necessary and sufficient conditions. We also show that the states are bipartite distillable for all bipartite splits, and hence the states could be distillable into the Greenberger-Horne-Zeilinger state. We finally exhibit a class of secret-sharing states, which have an arbitrarily small amount of bipartite distillable entanglement for a certain split.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
