Back to Search
Start Over
Verifiable quantum ( k, n)-threshold secret sharing.
- Source :
-
Quantum Information Processing . Dec2012, Vol. 11 Issue 6, p1619-1625. 7p. - Publication Year :
- 2012
-
Abstract
- In a conventional quantum ( k, n) threshold scheme, a trusted party shares a quantum secret with n agents such that any k or more agents can cooperate to recover the original secret, while fewer than k agents obtain no information about the secret. Is the reconstructed quantum secret same with the original one? Or is the dishonest agent willing to provide a true share during the secret reconstruction? In this paper we reexamine the security of quantum ( k, n) threshold schemes and show how to construct a verifiable quantum ( k, n) threshold scheme by combining a qubit authentication process. The novelty of ours is that it can provide a mechanism for checking whether the reconstructed quantum secret is same with the original one. This mechanism can also attain the goal of checking whether the dishonest agent provides a false quantum share during the secret reconstruction such that the secret quantum state cannot be recovered correctly. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 15700755
- Volume :
- 11
- Issue :
- 6
- Database :
- Academic Search Index
- Journal :
- Quantum Information Processing
- Publication Type :
- Academic Journal
- Accession number :
- 82580155
- Full Text :
- https://doi.org/10.1007/s11128-011-0323-1