Quantum secret sharing for general access structures
arXiv:quant-ph/0001087
Abstract
We explore the conversion of classical secret-sharing schemes to quantum ones, and how this can be used to give efficient QSS schemes for general adversary structures. Our first result is that quantum secret-sharing is possible for any structure for which no two disjoint sets can reconstruct the secret (this was also proved, somewhat differently, by D. Gottesman). To obtain this we show that a large class of linear classical SS schemes can be converted into quantum schemes of the same efficiency. We also give a necessary and sufficient condiion for the direct conversion of classical schemes into quantum ones, and show that all group homomorphic schemes satisfy it.
6 pages
References in corpus (3)
Cited by in corpus (15)
- Non-Threshold Quantum Secret Sharing Schemes in the Graph State Formalism
- Matroids and Quantum Secret Sharing Schemes
- Complexity and entanglement in non-local computation and holography
- A Quantum Information Theoretical Model for Quantum Secret Sharing Schemes
- Unified Approach to Secret Sharing and Symmetric Private Information Retrieval with Colluding Servers in Quantum Systems
- Approximate Quantum Error-Correcting Codes and Secret Sharing Schemes
- Combinatorial Approaches in Quantum Information Theory
- Multi-partite quantum cryptographic protocols with noisy GHZ states
- Code-routing: a new attack on position verification
- Unconstrained Summoning for relativistic quantum information processing
- Coding Theoretic Construction of Quantum Ramp Secret Sharing
- 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
- Entropic Inequalities for a Class of Quantum Secret Sharing States