Vector space multisecret-sharing scheme based on Blakley's method
Résumé
Secret sharing schemes were introduced by Adi Shamir and George Blakley, independently, in 1979.
In a $(k, n)$- threshold secret sharing scheme, any set of at least $k$ out of $n$ participants can retrieve the secret but no set of
$(k-1)$ or less can. Shamir's secret sharing scheme is more popular than Blakley's, even though the former is more complex than the latter.
The practical reason is that Blakley's scheme lacks determined, general and suitable matrices.
In this paper, we present a multisecret-sharing scheme based on vector spaces over $\R^{n}$ . We use Blakley's method.
This scheme is ideal in the sense that the size of each secret equals the size of any share.
Origine | Fichiers produits par l'(les) auteur(s) |
---|