Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Finding lower bounds on the complexity of secret sharing schemes by linear programming

Autor
Padro, C.; Vázquez, L.; Yang, A.
Tipus d'activitat
Article en revista
Revista
Discrete applied mathematics
Data de publicació
2013-05-01
Volum
161
Número
7-8
Pàgina inicial
1072
Pàgina final
1084
DOI
https://doi.org/10.1016/j.dam.2012.10.020 Obrir en finestra nova
Repositori
http://eprint.iacr.org/2012/464 Obrir en finestra nova
http://hdl.handle.net/2117/105967 Obrir en finestra nova
URL
http://www.sciencedirect.com/science/article/pii/S0166218X12004003?via%3Dihub Obrir en finestra nova
Resum
Optimizing the maximum, or average, length of the shares in relation to the length of the secret for every given access structure is a difficult and long-standing open problem in cryptology. Most of the known lower bounds on these parameters have been obtained by implicitly or explicitly using that every secret sharing scheme defines a polymatroid related to the access structure. The best bounds that can be obtained by this combinatorial method can be determined by using linear programming, and ...
Citació
Padro, C., Vázquez, L., Yang, A. Finding lower bounds on the complexity of secret sharing schemes by linear programming. "Discrete applied mathematics", 1 Maig 2013, vol. 161, núm. 7-8, p. 1072-1084.
Paraules clau
Secret sharing, linear programming, non-Shannon information inequalities, polymatroid
Grup de recerca
MAK - Matemàtica Aplicada a la Criptografia

Participants

Arxius