Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Secret sharing, rank inequalities, and information inequalities

Autor
Martin, S.; Padro, C.; Yang, A.
Tipus d'activitat
Article en revista
Revista
IEEE transactions on information theory
Data de publicació
2016-01
Volum
62
Número
1
Pàgina inicial
599
Pàgina final
609
DOI
https://doi.org/10.1109/TIT.2015.2500232 Obrir en finestra nova
Repositori
http://hdl.handle.net/2117/86051 Obrir en finestra nova
https://eprint.iacr.org/2013/082 Obrir en finestra nova
URL
http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?reload=true&punumber=18 Obrir en finestra nova
Resum
Beimel and Orlov proved that all information inequalities on four or five variables, together with all information inequalities on more than five variables that are known to date, provide lower bounds on the size of the shares in secret sharing schemes that are at most linear on the number of participants. We present here another two negative results about the power of information inequalities in the search for lower bounds in secret sharing. First, we prove that all information inequalities on ...
Citació
Martin, S., Padro, C., Yang, A. Secret sharing, rank inequalities, and information inequalities. "IEEE transactions on information theory", Gener 2016, vol. 62, núm. 1, p. 599-609.
Paraules clau
cryptography, information inequalities, polymatroids, rank inequalities, secret sharing
Grup de recerca
MAK - Matemàtica Aplicada a la Criptografia

Participants