Revision History for: Quantum Secret Sharing
- 2025-06-24 at 21:28 by JuliaM
Functionality Description
Quantum Secret Sharing (QSS) allows to transfer a quantum state (or a classical message encoded as quantum state), referred to as the secret, from Alice to Bob but only with the consent of a third-party, Charlie. A QSS protocol is generalizable to an arbitrary number of parties consisting of one sender, one recipient, and all other parties being endorsers. In case of only two parties, sender and receiver, QSS is equivalent to Quantum Teleportation. Despite the no-cloning theorem not allowing the quantum secret to be in possession of more than one party at the same time, there exist QSS protocols that mimic classical secret sharing (see Further Information).
Protocols
No protocols implement this functionality yet.
Classical Analogues
No content has been added to this section, yet!
Real-world Use Cases
- QSS can replace certain classical secret sharing scenarios with unconditional security. [1]
- Secret sharing is a very common building block in other protocols [2]:
- Secure Multiparty Delegated Quantum Computation
- Leader election and Byzantine Agreement
- Error correction in quantum computers [3]
- Bank transfers with third party endorsement, see Quantum Cheque
Properties
- Confidentiality: QSS with one dishonest party not following the protocol must guarantee that no information about the quantum secret at all is revealed to any party.
- Security: Every protocol must ensure that no information about the secret is leaked to an external eavesdropper.
Further Information
QSS is inspired by classical secret sharing (CSS), but has one fundamental difference due to the no-cloning theorem. In CSS, Alice shares a secret among $n$ parties and any team of $t$ parties or more, with $t \\\leq n$, has full access to the secret, whereas $t-1$ collaborating parties or less have no information about the secret at all. Such $(t,n)$-threshold schemes are not straightforward to implement for QSS, since the no-cloning theorem forbids that quantum states are copied, resulting in only one party, the receiver, obtaining the quantum secret from Alice, who looses hers during the process. However, $(t,n)$ schemes can be built through sequentially running several QSS rounds. [4]
References
- Mayers, D., and A. Yao. “Unconditional security in Quantum Cryptography, quant-ph.” 9802025 (1998).
- Joy, Dintomon, M. Sabir, Bikash K. Behera, and Prasanta K. Panigrahi. “Implementation of quantum secret sharing and quantum binary voting protocol in the IBM quantum computer.” Quantum Information Processing 19 (2020): 1-20.
- Gottesman, Daniel. “Theory of quantum secret sharing.” Physical Review A 61, no. 4 (2000): 042311.
- Lu, Changbin, Fuyou Miao, Junpeng Hou, and Keju Meng. “Verifiable threshold quantum secret sharing with sequential communication.” Quantum Information Processing 17 (2018): 1-13.
- 2025-05-15 at 15:36 by JuliaM
Functionality Description
Quantum Secret Sharing (QSS) allows to transfer a quantum state (or a classical message encoded as quantum state), referred to as the secret, from Alice to Bob but only with the consent of a third-party, Charlie. A QSS protocol is generalizable to an arbitrary number of parties consisting of one sender, one recipient, and all other parties being endorsers. In case of only two parties, sender and receiver, QSS is equivalent to Quantum Teleportation. Despite the no-cloning theorem not allowing the quantum secret to be in possession of more than one party at the same time, there exist QSS protocols that mimic classical secret sharing (see Further Information).
Protocols
No protocols implement this functionality yet.
Classical Analogues
No content has been added to this section, yet!
Real-world Use Cases
- QSS can replace certain classical secret sharing scenarios with unconditional security. [1]
- Secret sharing is a very common building block in other protocols [2]:
- Secure Multiparty Delegated Quantum Computation
- Leader election and Byzantine Agreement
- Error correction in quantum computers [3]
- Bank transfers with third party endorsement, see Quantum Cheque
Properties
- Confidentiality: QSS with one dishonest party not following the protocol must guarantee that no information about the quantum secret at all is revealed to any party.
- Security: Every protocol must ensure that no information about the secret is leaked to an external eavesdropper.
Further Information
QSS is inspired by classical secret sharing (CSS), but has one fundamental difference due to the no-cloning theorem. In CSS, Alice shares a secret among $n$ parties and any team of $t$ parties or more, with $t \\\leq n$, has full access to the secret, whereas $t-1$ collaborating parties or less have no information about the secret at all. Such $(t,n)$-threshold schemes are not straightforward to implement for QSS, since the no-cloning theorem forbids that quantum states are copied, resulting in only one party, the receiver, obtaining the quantum secret from Alice, who looses hers during the process. However, $(t,n)$ schemes can be built through sequentially running several QSS rounds. [4]
References
- Mayers, D., and A. Yao. “Unconditional security in Quantum Cryptography, quant-ph.” 9802025 (1998).
- Joy, Dintomon, M. Sabir, Bikash K. Behera, and Prasanta K. Panigrahi. “Implementation of quantum secret sharing and quantum binary voting protocol in the IBM quantum computer.” Quantum Information Processing 19 (2020): 1-20.
- Gottesman, Daniel. “Theory of quantum secret sharing.” Physical Review A 61, no. 4 (2000): 042311.
- Lu, Changbin, Fuyou Miao, Junpeng Hou, and Keju Meng. “Verifiable threshold quantum secret sharing with sequential communication.” Quantum Information Processing 17 (2018): 1-13.
- 2025-05-15 at 15:36 by JuliaM
Functionality Description
Quantum Secret Sharing (QSS) allows to transfer a quantum state (or a classical message encoded as quantum state), referred to as the secret, from Alice to Bob but only with the consent of a third-party, Charlie. A QSS protocol is generalizable to an arbitrary number of parties consisting of one sender, one recipient, and all other parties being endorsers. In case of only two parties, sender and receiver, QSS is equivalent to Quantum Teleportation. Despite the no-cloning theorem not allowing the quantum secret to be in possession of more than one party at the same time, there exist QSS protocols that mimic classical secret sharing (see Further Information).
Protocols
No protocols implement this functionality yet.
Classical Analogues
No content has been added to this section, yet!
Real-world Use Cases
- QSS can replace certain classical secret sharing scenarios with unconditional security. [1]
- Secret sharing is a very common building block in other protocols [2]:
- Secure Multiparty Delegated Quantum Computation
- Leader election and Byzantine Agreement
- Error correction in quantum computers [3]
- Bank transfers with third party endorsement, see Quantum Cheque
Properties
- Confidentiality: QSS with one dishonest party not following the protocol must guarantee that no information about the quantum secret at all is revealed to any party.
- Security: Every protocol must ensure that no information about the secret is leaked to an external eavesdropper.
Further Information
QSS is inspired by classical secret sharing (CSS), but has one fundamental difference due to the no-cloning theorem. In CSS, Alice shares a secret among $n$ parties and any team of $t$ parties or more, with $t \\\leq n$, has full access to the secret, whereas $t-1$ collaborating parties or less have no information about the secret at all. Such $(t,n)$-threshold schemes are not straightforward to implement for QSS, since the no-cloning theorem forbids that quantum states are copied, resulting in only one party, the receiver, obtaining the quantum secret from Alice, who looses hers during the process. However, $(t,n)$ schemes can be built through sequentially running several QSS rounds. [4]
References
- Mayers, D., and A. Yao. “Unconditional security in Quantum Cryptography, quant-ph.” 9802025 (1998).
- Joy, Dintomon, M. Sabir, Bikash K. Behera, and Prasanta K. Panigrahi. “Implementation of quantum secret sharing and quantum binary voting protocol in the IBM quantum computer.” Quantum Information Processing 19 (2020): 1-20.
- Gottesman, Daniel. “Theory of quantum secret sharing.” Physical Review A 61, no. 4 (2000): 042311.
- Lu, Changbin, Fuyou Miao, Junpeng Hou, and Keju Meng. “Verifiable threshold quantum secret sharing with sequential communication.” Quantum Information Processing 17 (2018): 1-13.