Coding Theoretic Construction of Quantum Ramp Secret Sharing
arXiv:1405.0149 · doi:10.1587/transfun.E101.A.1215
Abstract
We show a construction of a quantum ramp secret sharing scheme from a nested pair of linear codes. Necessary and sufficient conditions for qualified sets and forbidden sets are given in terms of combinatorial properties of nested linear codes. An algebraic geometric construction for quantum secret sharing is also given.
svjour3.cls, 12 pages, no figure. Version 5 added citations to relevant prior papers that were missing in previous versions. Contents unchanged
References in corpus (5)
- Non-Threshold Quantum Secret Sharing Schemes in the Graph State Formalism
- On the equivalence between sharing quantum and classical secrets, and error correction
- Quantum Strongly Secure Ramp Secret Sharing
- Quantum Optimal Multiple Assignment Scheme for Realizing General Access Structure of Secret Sharing
- An extension of Massey scheme for secret sharing
Cited by in corpus (5)
- Unified Approach to Secret Sharing and Symmetric Private Information Retrieval with Colluding Servers in Quantum Systems
- Classical Access Structures of Ramp Secret Sharing Based on Quantum Stabilizer Codes
- Quantum Stabilizer Codes Can Realize Access Structures Impossible by Classical Secret Sharing
- Quantum Optimal Multiple Assignment Scheme for Realizing General Access Structure of Secret Sharing
- Message Randomization and Strong Security in Quantum Stabilizer-Based Secret Sharing for Classical Secrets