Elements of information theory
Elements of information theory
An explication of secret sharing schemes
Designs, Codes and Cryptography
Fully dynamic secret sharing schemes
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Communications of the ACM
Changing Thresholds in the Absence of Secure Channels
ACISP '99 Proceedings of the 4th Australasian Conference on Information Security and Privacy
Threshold Schemes with Disenrollment
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Hi-index | 0.00 |
Threshold schemes are well-studied cryptographic primitives for distributing information among a number of entities in such a way that the information can only be recovered if a threshold of entities cooperate. Establishment of a threshold scheme involves an initialisation overhead. Threshold schemes with disenrollment capability are threshold schemes that enable entities to be removed from the initial threshold scheme at less communication cost than that of establishing a new scheme. We prove a revised version of a conjecture of Blakley, Blakley, Chan and Massey by establishing a bound on the size of the broadcast information necessary in a threshold scheme with disenrollment capability that has minimal entity information storage requirements. We also investigate the characterisation of threshold schemes with disenrollment that meet this bound.