A note on the randomness in dynamic threshold schemes

Article type: Research Article

Authors: Blundo, Carlo^{; *} | Masucci, Barbara

Affiliations: Dipartimento di Informatica ed Applicazioni, Università di Salerno, 84081 Baronissi (SA), Italy. E-mail: carblu@dia.unisa.it, masucci@dia.unisa.it; URL: http://www.unisa.it/~carblu, http://www.unisa.it/~masucci

Correspondence: [*] Corresponding author.

Abstract: In dynamic threshold schemes the dealer is able (after a preprocessing stage) to allow sets of participants of a given cardinality to reconstruct different secrets (in different time instants) by sending them the same broadcast message. In this paper we provide a tight lower bound on the number of random bits needed by the dealer to set up a dynamic threshold scheme.

Keywords: Data security, cryptography, randomness, secret sharing schemes, entropy

DOI: 10.3233/JCS-1999-7104

Journal: Journal of Computer Security, vol. 7, no. 1, pp. 73-85, 1999