Message Randomization and Strong Security in Quantum Stabilizer-Based Secret Sharing for Classical Secrets
arXiv:1904.11114 · doi:10.1007/s10623-020-00751-w
Abstract
We improve the flexibility in designing access structures of quantum stabilizer-based secret sharing schemes for classical secrets, by introducing message randomization in their encoding procedures. We generalize the Gilbert-Varshamov bound for deterministic encoding to randomized encoding of classical secrets. We also provide an explicit example of a ramp secret sharing scheme with which multiple symbols in its classical secret are revealed to an intermediate set, and justify the necessity of incorporating strong security criterion of conventional secret sharing. Finally, we propose an explicit construction of strongly secure ramp secret sharing scheme by quantum stabilizers, which can support twice as large classical secrets as the McEliece-Sarwate strongly secure ramp secret sharing scheme of the same share size and the access structure.
Publisher's Open Access PDF. arXiv admin note: text overlap with arXiv:1811.05217
References in corpus (7)
- Non-Threshold Quantum Secret Sharing Schemes in the Graph State Formalism
- Relative generalized Hamming weights of one-point algebraic geometric codes
- Generalized Semi-Quantum Secret Sharing Schemes
- Unitary Reconstruction of Secret for Stabilizer Based Quantum Secret Sharing
- Quantum Strongly Secure Ramp Secret Sharing
- Classical Access Structures of Ramp Secret Sharing Based on Quantum Stabilizer Codes
- An extension of Massey scheme for secret sharing