Secret sharing, rank inequalities, and information inequalities
Tipus de documentArticle
Condicions d'accésAccés obert
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 a bounded number of variables can only provide lower bounds that are polynomial on the number of participants. Second, we prove that the rank inequalities that are derived from the existence of two common informations can provide only lower bounds that are at most cubic in the number of participants.
© 2016 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
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.
Versió de l'editorhttp://ieeexplore.ieee.org/xpl/RecentIssue.jsp?reload=true&punumber=18