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
Presentació treball a congrés
Nom de l'edició
33rd. International Cryptology Conference
Any de l'edició
2013
Llibre d'actes
Advances in Cryptology : CRYPTO 2013. 33rd Annual Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2013. Proceedings, Part II
Pàgina inicial
277
Pàgina final
288
DOI
https://doi.org/10.1007/978-3-642-40084-1_16 Obrir en finestra nova
URL
http://download.springer.com/static/pdf/255/chp%253A10.1007%252F978-3-642-40084-1_16.pdf?auth66=1395830907_96bf8abc8244469f520aed1551dc0f28&ext=.pdf 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 negative result about the power of information inequalities in the search for lower bounds in secret sharing. Namely, we prove that all information inequalities on a bo...
Paraules clau
Information inequalities, Polymatroids, Rank inequalities, Secret sharing
Grup de recerca
MAK - Matemàtica Aplicada a la Criptografia

Participants