Abstract
When a shadow of a threshold scheme is publicized, new shadows have to be reconstructed and redistributed in order to maintain the same level of security. In this paper we consider threshold schemes with disenrollment capabilities where the new shadows can be created by broadcasts through a public channel. We establish a lower bound on the size of each shadow in a scheme that allows L disenrollments. We exhibit three systems that achieve the lower bound on shadow size.
Agnes Chan’s work was supported by MITRE Sponsored Research Program.
Chapter PDF
Similar content being viewed by others
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
G.R. Blakley, Safeguarding Cryptographic Keys. Proceedings AFIPS 1979 Nat. Computer Conf. 48 (1979) 313–317
E.G. Brickell and D.R. Stinson, oral communication.
M. De Soete and K. Vedder, Some New Classes of Geometric Threshold Schemes, Proceedings EUROCRYPT 88 (1988).
E.D. Karnin, J.W. Greene and M.E. Hellman, On Secret Sharing Systems, IEEE Trans. on Information Theory, IT-29 (1983), 35–41
K.M. Martin, Untrustworthy Participants in Perfect Secret Sharing Schemes, preprint
R.J. McEliece and D.V. Sarwarte, On Sharing Secrets and Reed-Solomon Codes, Communications of ACM 24 (Sept 1981), 583–584
A. Shamir, How to Share a Secret, Communications ACM 22 (Nov 1979), 612–613
C.E. Shannon, Communication Theory of Secrecy Systems, Bell System Technical Journal (1948), 656–715
D.R. Stinson and S.A. Vanstone, A Combinatorial Approach to Threshold Schemes, SIAM J. Disc. Math. 1–2 (1988), 230–236
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
Blakley, B., Blakley, G.R., Chan, A.H., Massey, J.L. (1993). Threshold Schemes with Disenrollment. 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_38
Download citation
DOI: https://doi.org/10.1007/3-540-48071-4_38
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