Cryptology ePrint Archive: Report 2012/464

Finding Lower Bounds on the Complexity of Secret Sharing Schemes by Linear Programming

Carles Padro and Leonor Vazquez and An Yang

Abstract: 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 this can be effectively done for access structures on a small number of participants.

By applying this linear programming approach, we improve some of the known lower bounds for the access structures on five participants and the graph access structures on six participants for which these parameters were still undetermined. Nevertheless, the lower bounds that are obtained by this combinatorial method are not tight in general. For some access structures, they can be improved by adding to the linear program non-Shannon information inequalities as new constraints. We obtain in this way new separation results for some graph access structures on eight participants and for some ports of non-representable matroids. Finally, we prove that, for two access structures on five participants, the combinatorial lower bound cannot be attained by any linear secret sharing scheme.

Category / Keywords: cryptographic protocols / Secret sharing, linear programming, polymatroid, non-Shannon information inequalities

Publication Info: A previous version of this paper appeared in the Proceedings of LATIN 2010.

Date: received 14 Aug 2012, last revised 14 Aug 2012

Contact author: yang0246 at e ntu edu sg

Available format(s): PDF | BibTeX Citation

Note: This is a full version of the paper appeared in the Proceedings of LATIN 2010. Several new results have been added to the current version, as the ones in Sections 6 and 7. Moreover, the overall presentation of the paper has been greatly improved.

Version: 20120818:034243 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]