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.
Cite
CITATION STYLE
Blakley, B., Blakley, G. R., Chan, A. H., & Massey, J. L. (1993). Threshold schemes with disenrollment. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 740 LNCS, pp. 540–548). Springer Verlag. https://doi.org/10.1007/3-540-48071-4_38
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
