Matroids and quantum-secret-sharing schemes
- 24 May 2010
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review A
- Vol. 81 (5)
Abstract
A secret-sharing scheme is a cryptographic protocol to distribute a secret state in an encoded form among a group of players such that only authorized subsets of the players can reconstruct the secret. Classically, efficient secret-sharing schemes have been shown to be induced by matroids. Furthermore, access structures of such schemes can be characterized by an excluded minor relation. No such relations are known for quantum secret-sharing schemes. In this paper we take the first steps toward a matroidal characterization of quantum-secret-sharing schemes. In addition to providing a new perspective on quantum-secret-sharing schemes, this characterization has important benefits. While previous work has shown how to construct quantum-secret-sharing schemes for general access structures, these schemes are not claimed to be efficient. In this context the present results prove to be useful; they enable us to construct efficient quantum-secret-sharing schemes for many general access structures. More precisely, we show that an identically self-dual matroid that is representable over a finite field induces a pure-state quantum-secret-sharing scheme with information rate . DOI: http://dx.doi.org/10.1103/PhysRevA.81.052333 © 2010 The American Physical Society
Keywords
All Related Versions
This publication has 26 references indexed in Scilit:
- On Codes, Matroids, and Secure Multiparty Computation From Linear Secret-Sharing SchemesIEEE Transactions on Information Theory, 2008
- On Matroids and Nonideal Secret SharingIEEE Transactions on Information Theory, 2008
- How to Share a Quantum SecretPhysical Review Letters, 1999
- Quantum secret sharingPhysical Review A, 1999
- Almost Affine CodesDesigns, Codes and Cryptography, 1998
- On Matroid Characterization of Ideal Secret Sharing SchemesJournal of Cryptology, 1998
- An explication of secret sharing schemesDesigns, Codes and Cryptography, 1992
- On the classification of ideal secret sharing schemesJournal of Cryptology, 1991
- How to share a secretCommunications of the ACM, 1979
- A FORBIDDEN MINOR CHARACTERIZATION OF MATROID PORTSThe Quarterly Journal of Mathematics, 1976