Randomness Required for Linear Threshold Sharing Schemes Defined over Any Finite Abelian Group
ACISP '01 Proceedings of the 6th Australasian Conference on Information Security and Privacy
| Hi-index | 0.00 |
In dynamic threshold schemes the dealer is able (after apreprocessing stage) to allow sets of participants of a givencardinality to reconstruct different secrets (in different timeinstants) by sending them the same broadcast message. In this paperwe provide a tight lower bound on the number of random bits neededby the dealer to set up a dynamic threshold scheme.