Advances in Cryptology – CRYPTO 2013 pp 277-288
Secret Sharing, Rank Inequalities and Information Inequalities
- Cite this paper as:
- Martín S., Padró C., Yang A. (2013) Secret Sharing, Rank Inequalities and Information Inequalities. In: Canetti R., Garay J.A. (eds) Advances in Cryptology – CRYPTO 2013. Lecture Notes in Computer Science, vol 8043. Springer, Berlin, Heidelberg
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 bounded number of variables only can provide lower bounds that are polynomial on the number of participants.
KeywordsSecret sharing Information inequalities Rank inequalities Polymatroids
Unable to display preview. Download preview PDF.