On the optimization of bipartite secret sharing schemes |
| |
Authors: | Oriol Farràs Jessica Ruth Metcalf-Burton Carles Padró Leonor Vázquez |
| |
Affiliation: | 1.Dep. d’Eng. Informàtica i Matemàtiques,Universitat Rovira i Virgili,Tarragona,Spain;2.University of Michigan,Ann Arbor,USA;3.Division of Mathematical Sciences,Nanyang Technological University,Singapore,Singapore;4.Instituto Politécnico Nacional,México,Mexico |
| |
Abstract: | Optimizing the ratio between the maximum length of the shares and the length of the secret value in secret sharing schemes for general access structures is an extremely difficult and long-standing open problem. In this paper, we study it for bipartite access structures, in which the set of participants is divided in two parts, and all participants in each part play an equivalent role. We focus on the search of lower bounds by using a special class of polymatroids that is introduced here, the tripartite ones. We present a method based on linear programming to compute, for every given bipartite access structure, the best lower bound that can be obtained by this combinatorial method. In addition, we obtain some general lower bounds that improve the previously known ones, and we construct optimal secret sharing schemes for a family of bipartite access structures. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|