Abstract
In a secret-sharing scheme, a secret value is distributed among a set of participants by giving each participant a share. The requirement is that only predefined subsets of participants can recover the secret from their shares. The family of the predefined authorized subsets is called the access structure. An access structure is ideal if there exists a secret-sharing scheme realizing it in which the shares have optimal length, that is, in which the shares are taken from the same domain as the secrets. Brickell and Davenport proved that ideal access structures are induced by matroids. Subsequently, ideal access structures and access structures induced by matroids have received a lot of attention. Seymour gave the first example of an access structure induced by a matroid namely the Vamos matroid, that is non-ideal. Since every matroid is multipartite and has the associated discrete polymatroid, in this paper, by dealing with the rank functions of discrete polymatroids, we obtain a sufficient condition for a multipartite access structure to be ideal. Furthermore, we give a new proof that all access structures related to bipartite and tripartite matroids coincide with the ideal ones. Our results give new contributions to the open problem, that is, which matroids induce ideal access structures.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Shamir A. How to share a secret. Commun ACM, 1979, 22: 612–613
Blakley G R, Safeguarding cryptographic keys. In: Proceedings of National Computer Conference. Montvale, NJ: AFIPS Press, 1979. 48: 313–317
Ito M, Saito A, Nishizeki T. Secret sharing schemes realizing general access structure. In: Proceedings of the IEEE Global Telecommunications Conference. Tokyo, Japan: IEEE Press, 1987. 99–102
Karnin E D, Greene J W, Hellman M E. On secret sharing systems. IEEE T Inform Theory, 1983, 29: 35–41
Brickell E F, Davenport D M. On the classification of ideal secret sharing schemes. J Cryptol, 1991, 4: 123–134
Brickell E F. Some ideal secret sharing schemes. J Comb Math Comb Comput, 1989, 6: 105–113
Seymour P D. On secret-sharing matroids. J Comb Theory B, 1992, 56: 69–73
Matus F. Matroid representations by partitions. Discrete Math, 1999, 203: 169–194
Simonis J, Ashikhmin A. Almost affine codes. Design Code Cryptogr, 1998, 14: 179–197
Cheng Q, Yin Y, Xiao K, et al. On non-representable secret sharing matroids. In: Proceedings of the 5th International Conference on Information Security Practice and Experience. Xi’an, China: Springer, 2009. 5451: 124–135
Marti-Farre J, Padro C. On secret sharing schemes, matroids and polymatroids. In: Proceedings of the Fourth Theory of Cryptography Conference. Amsterdam, The Netherlands: Springer, 2007. 4392: 253–272
Ng S-L, Walker M. On the composition of matroids and ideal secret sharing schemes. Design Code Cryptogr, 2001, 24: 49–67
Herzog J, Hibi T. Discrete polymatroids. J Algebr Comb, 2002, 16: 239–268
Farras O, Martí-Farré J, Padró C. Ideal multipartite secret sharing schemes. In: Proceedings of the 26th Annual International Conference on the Theory and Applications of Cryptographic Techniques. Barcelona, Spain: Springer, 2007. 4515: 448–465
Ng S-L. Ideal secret sharing schemes with multipartite access structures. IET Commun, 2006, 153: 165–168
Oxley J G. Matroid Theory. New York: Clarendon/Oxford University Press, 1992
Welsh D J A. Matroid Theory. London: Academic Press, 1976
Herzog J, Hibi T. Discrete polymatroids. J Algebr Comb, 2002, 16: 239–268
Padro C, Saez G. Secret sharing schemes with bipartite access structure. IEEE T Inform Theory, 2000, 46: 2596–2604
Author information
Authors and Affiliations
Corresponding author
About this article
Cite this article
Hsu, C., Tang, X., Cheng, Q. et al. Multipartite matroids and secret sharing. Chin. Sci. Bull. 55, 3261–3266 (2010). https://doi.org/10.1007/s11434-010-3086-7
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11434-010-3086-7