Abstract
The characterization of the access structures of ideal secret sharing schemes is one of the main open problems in secret sharing and has important connections with matroid theory. Because of its difficulty, it has been studied for several particular families of access structures. Multipartite access structures, in which the set of participants is divided into several parts and all participants in the same part play an equivalent role, have been studied in seminal works on secret sharing by Shamir, Simmons, and Brickell, and also recently by several authors.. In the EUROCRYPT’07, Farras made a important contribution to this work: By using discrete polymatroids, they obtained a necessary condition and a sufficient condition for a multipartite access structure to be ideal respectively. In particular, they further gave a very difficult open problem, that is, characterizing the representable discrete polymatroids, i.e., which discrete polymatroids are representable and which ones are non-representable. In this paper, by dealing with a family of matroids derived from the Vamos matroid, which was the first matroid that was proved to be non-representable, we obtain a family of non-representable matroids. As a consequence, we extend it to the general case and obtain a sufficient condition for a discrete polymatroid to be non-representable, which is a new contribution to the open problem given by Farras.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
References
Shamir, A.: How to share a secret. Commun. of the ACM 22, 612–613 (1979)
Blakley, G.R.: Safeguarding cryptographic keys. In: AFIPS Conference Proceedings, vol. 48, pp. 313–317 (1979)
Matus, F.: Matroid representations by partitions. Discrete Math. 203, 169–194 (1999)
Seymour, P.D.: On secret-sharing matroids. J. Combin. Theory Ser. B 56, 69–73 (1992)
Marti-Farre, J., Padro, C.: On Secret Sharing Schemes, Matroids and Polymatroids. Cryptology ePrint Archive, Report 2006/077, http://eprint.iacr.org/2006/077
Tassa, T.: Hierarchical threshold secret sharing. In: Naor, M. (ed.) TCC 2004. LNCS, vol. 2951, pp. 473–490. Springer, Heidelberg (2004)
Ng, S.-L., Walker, M.: On the composition of matroids and ideal secret sharing schemes. Des. Codes Cryptogr. 24, 49–67 (2001)
Collins, M.J.: A Note on Ideal Tripartite Access Structures. Cryptology ePrint Archive, Report 2002/193, http://eprint.iacr.org/2002/193
Farràs, O., Martí-Farré, J., Padró, C.: Ideal multipartite secret sharing schemes. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol. 4515, pp. 448–465. Springer, Heidelberg (2007)
Oxley, J.G.: Matroid theory. Oxford Science Publications/ The Clarendon Press/ Oxford University Press, New York (1992)
Welsh, D.J.A.: Matroid Theory. Academic Press, London (1976)
Ng, S.-L.: Ideal secret sharing schemes with multipartite access structures. IEE Proc.-Commun. 153, 165–168 (2006)
Herzog, J., Hibi, T.: Discrete polymatroids. J. Algebraic Combin. 16, 239–268 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cheng, Q., Yin, Y., Xiao, K., Hsu, CF. (2009). On Non-representable Secret Sharing Matroids. In: Bao, F., Li, H., Wang, G. (eds) Information Security Practice and Experience. ISPEC 2009. Lecture Notes in Computer Science, vol 5451. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00843-6_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-00843-6_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-00842-9
Online ISBN: 978-3-642-00843-6
eBook Packages: Computer ScienceComputer Science (R0)