On Increasing the Number of Users in (t, n) Threshold Secret Sharing Schemes

摘要

Constructing ideal (t, n) threshold secret sharing schemes leads to some limitations on the maximum number of users, that are able to join the secret sharing scheme. We aim to remove these limitations by reducing the information rate of the constructed threshold secret sharing schemes. In this paper we propose recursive construction algorithms of (t, n) threshold secret sharing schemes, based on the generalized vector space construction. Using these algorithms we are able to construct a (r, n) threshold secret sharing scheme for any arbitrary n.