Vector space multisecret-sharing scheme based on Blakley's method - Archive ouverte HAL
Communication Dans Un Congrès Année : 2023

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.
Fichier principal
Vignette du fichier
vectors pace 2.pdf (218.41 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03970482 , version 1 (10-02-2023)

Licence

Identifiants

  • HAL Id : hal-03970482 , version 1

Citer

Selda Çalkavur, Patrick Solé. Vector space multisecret-sharing scheme based on Blakley's method. 1st International Conference on Frontiers of Academic Research (ICFAR 2023), Umut Özkaya, Feb 2023, Konya (en ligne), Turkey. pp.1-4. ⟨hal-03970482⟩
70 Consultations
104 Téléchargements

Partager

More