Abstract
Traditional secret sharing schemes involve the use of a mu- tually trusted authority to assist in the generation and distribution of shares that will allow a secret to be protected among a set of partic- ipants. In contrast, this paper addresses the problem of establishing a secret sharing scheme for a given access structure without the use of a mutually trusted authority. A general protocol is discussed and several implementations of this protocol are presented. The efficiency of these implementations is considered. The protocol is then refined and con- structions are presented for mutually trusted authority free threshold schemes.
This work was supported by the Australian Research Council
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
J. Benaloh and J. Leichter. Generalized secret sharing and monotone functions. Adv. in Cryptology-CRYPTO’88, Lecture Notes in Comput. Sci, 403:27–35, 1990.
G. R. Blakley. Safeguarding cryptographic keys. Proceedings of AFIPS 1979 National Computer Conference, 48:313–317, 1979.
E. F. Brickell and D. R. Stinson. Some improved bounds on the information rate of perfect secret sharing schemes. J. Cryptology, 5:153–166, 1992.
R. M. Capocelli, A. De Santis, L. Gargano, and U. Vaccaro. On the size of shares for secret sharing schemes. J. Cryptology, 6:157–167, 1993.
R. G. Gallager. Information theory and reliable communication. John Wiley and Sons, New York, 1968.
I. Ingemarsson and G. J. Simmons. A protocol to set up shared secret schemes without the assistance of a mutually trusted party. Adv. in Cryptology — EUROCRYPT’90, Lecture Notes in Comput. Sci., 473:266–282, 1991.
W.-A. Jackson and K. M. Martin. A combinatorial interpretation of ramp schemes. Submitted, 1994.
K. M. Martin. New secret sharing schemes from old. J. Combin. Math Combin. Comput., 14:65–77, 1993.
C. Meadows. Some threshold schemes without central key distributors. Congressus Numerantium, 46:187–199, 1985.
A. Shamir. How to share a secret. Comm. ACM, 22(11):612–613, 1979.
G. J. Simmons. The consequences of trust in shared secret schemes. Adv. in Cryptology — EUROCRYPT’93, Lecture Notes in Comput. Sci., 765:448–452, 1994.
G. J. Simmons, W.-A. Jackson, and K. Martin. The geometry of shared secret schemes. Bull. Inst. Combin. Appl., 1:71–88, 1991.
D. R. Stinson. An explication of secret sharing schemes. Des. Codes Cryptogr., 2:357–390, 1992.
D. R. Stinson. Decomposition constructions for secret sharing schemes. IEEE Trans. Inform. Theory, 40:118–125, 1994.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jackson, WA., Martin, K.M., O’Keefe, C.M. (1995). Efficient Secret Sharing Without a Mutually Trusted Authority. In: Guillou, L.C., Quisquater, JJ. (eds) Advances in Cryptology — EUROCRYPT ’95. EUROCRYPT 1995. Lecture Notes in Computer Science, vol 921. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49264-X_15
Download citation
DOI: https://doi.org/10.1007/3-540-49264-X_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59409-3
Online ISBN: 978-3-540-49264-1
eBook Packages: Springer Book Archive