Abstract
We use two combinatorial techniques to apply a decomposition construction in obtaining general lower bounds on information rate and average information rate of certain general classes of access structures. The first technique uses combinatorial designs (in particular, Steiner systems S(t, k, v)). The second technique uses equitable edge-colourings of bipartite graphs. For uniform access structures of rank t, this second technique improves the best previous general bounds by a factor of t (asymptotically).
Chapter PDF
Similar content being viewed by others
References
J. Benaloh and J. Leichter. Generalized secret sharing and monotone functions. Lecture Notes in Computer Science 403 (1990) 27–35.
T. Beth, D. Jungnickel, and H. Lenz. Design Theory. Bibliographisches Institut, Zurich, 1985.
C. Blundo. Secret Sharing Schemes for Access Structures based on Graphs. Tesi di Laurea, University of Salerno, 1991.
C. Blundo, A. De Santis, D. R. Stinson, and U. Vaccaro. Graph decompositions and secret sharing schemes. Presented at EUROCRYPT’ 92, submitted to Journal of Cryptology.
C. Blundo, A. De Santis, L. Gargano, and U. Vaccaro. On the information rate of secret sharing schemes. Presented at CRYPTO’ 92.
B. Bollobás. Graph Theory — An Introductory Course. Springer-Verlag, 1979.
E. F. Brickell. Some ideal secret sharing schemes. J. Combin. Math. and Combin. Comput. 9 (1989) 105–113.
E. F. Brickell and D. M. Davenport. On the classification of ideal secret sharing schemes. J. Cryptology 4 (1991), 123–134.
E. F. Brickell and D. R. Stinson. Some improved bounds on the information rate of perfect secret sharing schemes. J. Cryptology (to appear), preliminary version appeared in Lecture Notes in Computer Science 537 (1991) 242–252.
R. M. Capocelli, A. De Santis, L. Gargano, and U. Vaccaro. On the size of shares for secret sharing schemes. Submitted to Journal of Cryptology, preliminary version appeared in Lecture Notes in Computer Science 576 (1992) 101–113.
D. de Werra. Equitable colorations of graphs. Rev. Franc. Automat. Informat. Rech. Operat. Sér. Rouge 3 (1971) 3–8.
H. Hanani. On quadruple systems. Canad. J. Math. 12 (1960) 145–157
H. Hanani. Balanced incomplete block designs and related designs. Discrete Math. 11 (1975) 255–369.
M. Ito, A. Saito, and T. Nishizeki. Secret sharing scheme realising general access structure. Proc. IEEE Globecom’ 87 (1987) 99–102.
W.-A. Jackson and K. M. Martin. On ideal secret sharing schemes. Submitted to J. Cryptology.
K. M. Martin. New secret sharing schemes from old. Submitted to J. Comb. Math. Comb. Comp.
K. M. Martin. Discrete Structures in the Theory of Secret Sharing. PhD thesis, University of London, 1991.
P. D. Seymour. On secret-sharing matroids. Journal of Combin. Theory B (to appear).
A. Shamir. How to share a secret. Commun. of the ACM 22 (1979) 612–613.
G. J. Simmons. An introduction to shared secret and/or shared control schemes and their application. In G. J. Simmons, editor, Contemporary Cryptology, The Science of Information Integrity, IEEE Press, 1991, pp. 441–447.
G. J. Simmons, W. Jackson, and K. Martin. The geometry of shared secret schemes. Bulletin of the ICA 1 (1991) 71–88.
D. R. Stinson. An explication of secret sharing schemes. Designs, Codes and Cryptography (to appear).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Stinson, D.R. (1993). New General Lower Bounds on the Information Rate of Secret Sharing Schemes. In: Brickell, E.F. (eds) Advances in Cryptology — CRYPTO’ 92. CRYPTO 1992. Lecture Notes in Computer Science, vol 740. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48071-4_12
Download citation
DOI: https://doi.org/10.1007/3-540-48071-4_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57340-1
Online ISBN: 978-3-540-48071-6
eBook Packages: Springer Book Archive