Abstract
This paper is an explication of secret sharing schemes, emphasizing combinatorial construction methods. The main problem we consider is the construction of perfect secret sharing schemes, for specified access structures, with the maximum possible information rate.
In this paper, we present numerous direct constructions for secret sharing schemes, such as the Shamir threshold scheme, the Boolean circuit construction of Benaloh and Leichter (for general access structures), the vector space construction of Brickell, and the Simmons geometric construction. We discuss the connections between ideal schemes (i.e., those with information rate equal to one) and matroids. We also mention the entropy bounds of Capocelli et al. Then we give a very general construciton, called the decomposition construction, and numerous applications of it. In particular, we study schemes for access structures based on graphs and the many interesting bounds that can be proved; and we determine the exact value of the optimal information rate for all access structures on at most four participants.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
M. Ben-Or, S. Goldwasser, and A. Wigderson, Completeness theorems for noncryptographic fault-tolerant distributed computation, Proc. 20th ACM Symp. on Theory of Computing, (1988), pp. 1–10.
J. Benaloh and J. Leichter, Generalized secret sharing and monotone functions, Lecture Notes in Computer Science, Springer-Verlag, Berlin, New York, 403, (1990), pp. 27–35.
T. Beth, J. Jungnickel, and H. Lenz, Design Theory. Bibliographisches Institut, Zurich, (1985).
B. Blakley, G.R. Blakley, A.H. Chan, and J.L. Massey, Threshold schemes with disenrollment, presented at CRYPTO '92.
G.R. Blakley, Safeguarding cryptographic keys, AFIPS Conference Proceedings, Vol. 48, (1979), pp. 313–317.
C. Blundo, A. De Santis, D.R. Stinson, and U. Vaccaro, Graph decomposition and secret sharing schemes. Presented at EUROCRYPT '92, submitted to Journal of Cryptology.
E.F. Brickell, Some ideal secret sharing schemes, J. Combin. Math. and Combin. Comput., Vol. 9, (1989), pp. 105–113.
E.F. Brickell and D.M. Davenport, On the classification of ideal secret sharing schemes, J. Cryptology, Vol. 4, (1991), pp. 123–134.
E.F. Brickell and D.R. Stinson, Some improved bounds on the information rate of perfect secret sharing schemes, to appear in J. Cryptology. Preliminary version appeared in Lecture Notes in Computer Science, Springer-Verlag, Berlin, New York, 537, (1991), pp. 242–252.
E.F. Brickell and D.R. Stinson, The detection of cheaters in threshold schemes. SIAM J. on Discrete Math., Vol. 4, (1991), pp. 502–510. Preliminary version appeared in Lecture Notes in Computer Science, Springer-Verlag, Berlin, New York, 403, (1990), pp. 564–577.
R.M. Capocelli, A. De Santis, L. Gargano, and U. Vaccaro, On the size of shares for secret sharing schemes. Submitted to J. Cryptology. Preliminary version appeared in Lecture Notes in Computer Science, Springer-Verlag, Berlin, New York, 576, (1992), pp. 101–113.
I. Ingemarsson and G.J. Simmons, A protocol to set up shared secret schemes without the assistance of a mutually trusted party, Lecture Notes in Computer Science, Springer-Verlag, Berlin, New York, 473, (1991), pp. 266–282.
M. Ito, A. Saito, and T. Nishizeki, Secret sharing scheme realizing general access structure, Proc. IEEE Globecom '87, (1987), pp. 99–102.
W.-A. Jackson and K.M. Martin, On ideal secret sharing schemes. Submitted to J. Cryptology.
E.D. Karnin, J.W. Greene, and M.E. Hellman, On secret sharing systems, IEEE Trans. Inform. Theory, Vol. 29, (1983), pp. 35–41.
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. Ph.D. thesis, University of London, 1991.
R.J. McEliece and D.V. Sarwate, On sharing secrets and Reed-Solomon codes, Commun. of the ACM, Vol. 24, (1981), pp. 583–584.
T. Rabin and M. Ben-Or, Verifiable secret sharing and multiparty protocols with honest majority, Proc. 21st ACM Symp. on Theory of Computing, (1989), pp. 73–85.
P.D. Seymour, On secret-sharing matroids. To appear in Journal of Combin. Theory B.
A. Shamir, How to share a secret, Commun. of the ACM, Vol. 22, (1979), pp. 612–613.
G.J. Simmons, Robust shared secret schemes or ‘how to be sure you have the right answer even though you don't known the question,’ Congressus Numer., Vol. 68, (1989), pp. 215–248.
G.J. Simmons, How to (really) share a secret, Lecture Notes in Computer Science, Springer-Verlag, Berlin, New York, 403, (1990), pp. 390–448.
G.J. Simmons, Prepositioned shared secret and/or shared control schemes, Lecture Notes in Computer Science, Springer-Verlag, Berlin, New York, 434, (1990), pp. 436–467.
G.J. Simmons, An introduction to shared secret and/or shared control schemes and their application, In (G.J. Simmons, ed.) Contemporary Cryptology, The Science of Information Integrity, IEEE Press, New York, (1991), pp. 441–497.
G.J. Simmons, W. Jackson, and K. Martin, The geometry of shared secret schemes, Bulletin of the ICA, Vol. 1, (1991), pp. 71–88.
D.R. Stinson, New general lower bounds on the information rate of secret sharing schemes. Presented at CRYPTO '92.
M. Tompa and H. Woll, How to share a secret with cheaters, J. Cryptology, Vol. 1, (1988), pp. 133–138.
Author information
Authors and Affiliations
Additional information
Communicated by R.C. Mullin
Research supported by NSERC (Canada) grant A9287.
Rights and permissions
About this article
Cite this article
Stinson, D.R. An explication of secret sharing schemes. Des Codes Crypt 2, 357–390 (1992). https://doi.org/10.1007/BF00125203
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00125203