Quantum secret sharing (QSS) is a quantum cryptographic scheme for secure communication that extends beyond simple quantum key distribution. It modifies the classical secret sharing (CSS) scheme by using quantum information and the no-cloning theorem to attain the ultimate security for communications.
The method of secret sharing consists of a sender who wishes to share a secret with a number of receiver parties in such a way that the secret is fully revealed only if a large enough portion of the receivers work together. However, if not enough receivers work together to reveal the secret, the secret remains completely unknown.
The classical scheme was independently proposed by Adi Shamir[1] and George Blakley[2] in 1979. In 1998, Mark Hillery, Vladimír Bužek, and André Berthiaume extended the theory to make use of quantum states for establishing a secure key that could be used to transmit the secret via classical data.[3] In the years following, more work was done to extend the theory to transmitting quantum information as the secret, rather than just using quantum states for establishing the cryptographic key.[4] [5]
QSS has been proposed for being used in quantum money[6] as well as for joint checking accounts, quantum networking, and distributed quantum computing, among other applications.
This example follows the original scheme laid out by Hillery et al. in 1998 which makes use of Greenberger–Horne–Zeilinger (GHZ) states. A similar scheme was developed shortly thereafter which used two-particle entangled states instead of three-particle states.[7] In both cases, the protocol is essentially an extension of quantum key distribution to two receivers instead of just one.
Following the typical language, let the sender be denoted as Alice and two receivers as Bob and Charlie. Alice's objective is to send each receiver a "share" of her secret key (really just a quantum state) in such a way that:
Alice initiates the protocol by sharing with each of Bob and Charlie one particle from a GHZ triplet in the (standard) Z-basis, holding onto the third particle herself:
|\Psi\rangle\rm=
|000\rangle+|111\rangle | |
\sqrt{2 |
|0\rangle
|1\rangle
After each participant measures their particle in the X- or Y-basis (chosen at random), they share (via a classical, public channel) which basis they used to make the measurement, but not the result itself. Upon combining their measurement results, Bob and Charlie can deduce what Alice measured 50% of the time. Repeating this process many times, and using a small fraction to verify that no malicious actors are present, the three participants can establish a joint key for communicating securely. Consider the following for a clear example of how this will work.
Let us define the x and y eigenstates in the following, standard way:
|+x\rangle=
|0\rangle+|1\rangle | |
\sqrt{2 |
1\rangle |
|+y\rangle=
|0\rangle+i|1\rangle | |
\sqrt{2 |
1\rangle |
The GHZ state can then be rewritten as
|\Psi\rangle\rm=
1 | |
2\sqrt{2 |
|0\ranglec+|1\ranglec | |
\sqrt{2 |
|0\ranglec-|1\ranglec | |
\sqrt{2 |
The simple case described above can be extended similarly to that done in CSS by Shamir and Blakley via a thresholding scheme. In the threshold scheme (double parentheses denoting a quantum scheme), Alice splits her secret key (quantum state) into n shares such that any k≤n shares are required to extract the full information but k-1 or less shares cannot extract any information about Alice's key.
The number of users needed to extract the secret is bounded by . Consider for, if a threshold scheme is applied to two disjoint sets of k in n, then two independent copies of Alice's secret can be reconstructed. This of course would violate the no-cloning theorem and is why n must be less than 2k.
As long as a threshold scheme exists, a threshold scheme can be constructed by simply discarding one share. This method can be repeated until k=n.
The following outlines a simple ((2,3)) threshold scheme,[4] and more complicated schemes can be imagined by increasing the number of shares Alice splits her original state into:
Consider Alice beginning with the single qutrit state
|\Psi\ranglea=\alpha|0\rangle+\beta|1\rangle+\gamma|2\rangle,
|\psi\rangle=\alpha(|000\rangle+|111\rangle+|222\rangle)+\beta(|012\rangle+|120\rangle+|201\rangle)+\gamma(|021\rangle+|102\rangle+|210\rangle)
|\psi\rangle=(\alpha|0\rangle+\beta|1\rangle+\gamma|2\rangle)(|00\rangle+|12\rangle+|21\rangle)
The security of QSS relies upon the no-cloning theorem to protect against possible eavesdroppers as well as dishonest users. This section adopts the two-particle entanglement protocol very briefly mentioned above.[7]
QSS promises security against eavesdropping in the exact same way as quantum key distribution. Consider an eavesdropper, Eve, who is assumed to be capable of perfectly discriminating and creating the quantum states used in the QSS protocol. Eve's objective is to intercept one of the receivers' (say Bob's) shares, measure it, then recreate the state and send it on to whomever the share was initially intended for. The issue with this method is that Eve needs to randomly choose a basis to measure in, and half of the time she will choose the wrong basis. When she chooses the correct basis, she will get the correct measurement result with certainty and can recreate the state she measured and send it off to Bob without her presence being detected. However, when she chooses the wrong basis, she will end up sending one of the two states from the incorrect basis. Bob will measure the state she sent him and half of the time this will be the correct detection, but only because the state from the wrong basis is an equal superposition of the two states in the correct basis. Thus, half of the time that Eve measures in the wrong basis and therefore sends the incorrect state, Bob will measure the wrong state. This intervention on Eve's part leads to causing an error in the protocol on an extra 25% of trials. Therefore, with enough measurements, it will be nearly impossible to miss the protocol errors occurring with a 75% probability instead of the 50% probability predicted by the theory, thus signaling that there is an eavesdropper within the communication channel.
More complex eavesdropping strategies can be performed using ancilla states, but the eavesdropper will still be detectable in a similar manner.
Now, consider the case where one of the participants of the protocol (say Bob) is acting as a malicious user by trying to obtain the secret without the other participants being aware. Analyzing the possibilities, one learns that choosing the proper order in which Bob and Charlie release their measurement bases and results when testing for eavesdropping can promise the detection of any cheating that may be occurring. The proper order turns out to be:
This ordering prevents receiver 2 from knowing which basis to share for tricking the other participants because receiver 2 does not yet know what basis receiver 1 is going to announce was used. Similarly, since receiver 1 must release their results first, they cannot control if the measurements should be correlated or anticorrelated for the valid combination of bases used. In this way, acting dishonestly will introduce errors in the eavesdropper testing phase whether the dishonest participant is receiver 1 or receiver 2. Thus, the ordering of releasing the data must be carefully chosen so as to prevent any dishonest user from acquiring the secret without being noticed by the other participants.
This section follows from the first experimental demonstration of QSS in 2001 which was made possible via advances in techniques of quantum optics.[8]
The original idea for QSS using GHZ states was more challenging to implement because of the difficulties in producing three-particle correlations via either down-conversion processes with
\chi3
\chi2
t0
\alpha.
\beta
\gamma
tB
tC
Using
|X\ranglei,|Y\ranglej
|S\rangleA,|L\ranglej
|L\rangleA,|S\ranglej
|S\rangleB,|S\rangleC
|L\rangleB,|L\rangleC.
|\psi\rangle=
1 | |
\sqrt{2 |
Pi,j,k=
1 | |
8 |
(1+ijk\cos(\alpha+\beta+\gamma)),
By setting the phases
\alpha,\beta,
\gamma
\pi | |
2 |
S3=|E(\alpha'+\beta+\gamma)+E(\alpha+\beta'+\gamma)+E(\alpha+\beta+\gamma')-E(\alpha'+\beta'+\gamma')|\le{2}
E(\alpha+\beta+\gamma)
(\alpha,\beta,\gamma)
S\rm=3.69
This seminal experiment showed that the quantum correlations from this setup are indeed described by the probability function
Pi,j,k.