Abstract
We propose the concept of weight-decomposition construction for perfect secret sharing schemes. This construction is more general than previous constructions. Based on the weight-decomposition construction, we improve the information rate in 4 cases of the left unsolved 18 cases of secret sharing schemes for connected graphs on six vertices. In addition, we also propose some efficient decomposition constructions for perfect secret sharing schemes with access structures of constant rank. Compared with the best previous constructions, our constructions have some improved lower bounds on the information rate.
This research was supported in part by the National Science Council of the Republic of China under grant number NSC-86-2213-E-324-002.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J. Benaloh and J. Leichter, “Generalized secret sharing and monotone functions,” in Advances in Cryptology-Crypto'88 Proceedings, Lecture Notes in Computer Science, Vol. 403, Springer-Verlag, Berlin, pp. 27–35, 1990.
C. Blundo, A. De Santis, L. Gargano, and U. Vaccaro, “On the information rate of secret sharing schemes,” in Advance in Cryptology-CRYPTO'92, Lecture Notes in Comput. Sci., Vol. 740, pp. 148–167, 1993.
C. Blundo, A. De Santis, D.R. Stinson and U. Vaccaro, “Graph decompositions and secret sharing schemes,” in Advance in Cryptology-Proceedings of Eurocrypt'92, Lecture Notes in Comput. Sci., Vol. 658, pp. 1–24, 1993.
C. Blundo, A. De Santis, D.R. Stinson and U. Vaccaro, “Graph decompositions and secret sharing schemes,” Journal of Cryptology, Vol. 8, pp. 39–63, 1995.
E.F. Brickell and D.R. Stinson, “Some improved bounds on the information rate of perfect secret sharing schemes,” Journal of Cryptology, Vol. 5, pp. 153–166, 1992.
R. M. Capocelli, A. De Santis, L. Gargano, and U. Vaccaro, “On the size of shares for secret sharing schemes,” Journal of Cryptology, Vol. 6, pp. 157–167, 1993.
M. van Dijk, “On the information rate of perfect secret sharing schemes,” Designs, Codes and Cryptography, Vol. 6, pp. 143–169, 1995.
R.W. Hamming, Coding and Information Theory, Englewood Cliffs, Reading, NJ:Prentice-Hall, 1986.
M. Ito, A. Saito and T. Nishizeki, “Secret sharing scheme realizing general access structure,” in Proc. IEEE Globecom'87, Tokyo, pp. 99–102, 1987.
M. Ito, A. Saito and T. Nishizeki, “Multiple assignment scheme for sharing secret,” Journal of Cryptology, Vol. 6, pp. 15–20, 1993.
D.R. Stinson, “New general lower bounds on the information rate of secret sharing schemes,” in Advance in Cryptology-CRYPTO'92, Lecture Notes in Comput. Sci., Vol. 740, pp. 168–182, 1993.
D.R. Stinson, “Decomposition constructions for secret sharing schemes,” IEEE Trans. Inform. Theory, Vol. IT-40, pp. 118–125, 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag
About this paper
Cite this paper
Sun, HM., Chen, BL. (1997). On the decomposition constructions for perfect secret sharing schemes. In: Han, Y., Okamoto, T., Qing, S. (eds) Information and Communications Security. ICICS 1997. Lecture Notes in Computer Science, vol 1334. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028461
Download citation
DOI: https://doi.org/10.1007/BFb0028461
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63696-0
Online ISBN: 978-3-540-69628-5
eBook Packages: Springer Book Archive