Carregant...
Carregant...

Vés al contingut (premeu Retorn)

On the information ratio of non-perfect secret sharing schemes

Autor
Farràs Ventura, O.; Hansen, T.; Kaced, T.; Padro, C.
Tipus d'activitat
Article en revista
Revista
Algorithmica
Data de publicació
2017-12-01
Volum
79
Número
4
Pàgina inicial
987
Pàgina final
1013
DOI
https://doi.org/10.1007/s00453-016-0217-9 Obrir en finestra nova
Repositori
http://hdl.handle.net/2117/114396 Obrir en finestra nova
URL
https://link.springer.com/article/10.1007%2Fs00453-016-0217-9 Obrir en finestra nova
Resum
A secret sharing scheme is non-perfect if some subsets of players that cannot recover the secret value have partial information about it. The information ratio of a secret sharing scheme is the ratio between the maximum length of the shares and the length of the secret. This work is dedicated to the search of bounds on the information ratio of non-perfect secret sharing schemes and the construction of efficient linear non-perfect secret sharing schemes. To this end, we extend the known connectio...
Citació
Farràs Ventura, O., Hansen, T., Kaced, T., Padro, C. On the information ratio of non-perfect secret sharing schemes. "Algorithmica", 1 Desembre 2017, vol. 79, núm. 4, p. 987-1013.
Paraules clau
Access function, Information ratio, Non-perfect secret sharing, Polymatroid, Secret sharing
Grup de recerca
MAK - Matemàtica Aplicada a la Criptografia

Participants

  • Farràs Ventura, Oriol  (autor)
  • Hansen, Torben  (autor)
  • Kaced, Tarik  (autor)
  • Padro Laimon, Carles  (autor)