Quantum secret sharing for general access structures

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.

[1]  Avi Wigderson,et al.  On span programs , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.

[2]  M. Koashi,et al.  Quantum entanglement for secret sharing and secret splitting , 1999 .

[3]  V. Buzek,et al.  Quantum secret sharing , 1998, quant-ph/9806063.

[4]  R. Cleve,et al.  Information-theoretic interpretation of quantum error-correcting codes , 1997, quant-ph/9702031.

[5]  Lajos Rónyai,et al.  Extremal bipartite graphs and superpolynomial lower bounds for monotone span programs , 1996, STOC '96.

[6]  Adi Shamir,et al.  How to share a secret , 1979, CACM.

[7]  Josh Benaloh,et al.  Generalized Secret Sharing and Monotone Functions , 1990, CRYPTO.

[8]  D. Gottesman Theory of quantum secret sharing , 1999, quant-ph/9910067.