To access the full text documents, please follow this link: http://hdl.handle.net/2117/12185

On the optimization of bipartite secret sharing schemes
Farras Ventura, Oriol; Metcalf-Burton, Jessica Ruth; Padró Laimon, Carles; Vázquez González, Leonor
Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada IV; Universitat Politècnica de Catalunya. MAK - Matemàtica Aplicada a la Criptografia
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 bipartite 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.
Àrees temàtiques de la UPC::Matemàtiques i estadística::Investigació operativa::Programació matemàtica
Cryptography
Matroids
Linear programming
Criptografia
Matroides
Programació lineal
Attribution-NonCommercial-NoDerivs 3.0 Spain
http://creativecommons.org/licenses/by-nc-nd/3.0/es/
info:eu-repo/semantics/submittedVersion
Article
         

Show full item record

Related documents

Other documents of the same author

Farràs Ventura, Oriol; Metcalf-Burton, Jessica Ruth; Padró Laimon, Carles; Vázquez González, Leonor
Farras Ventura, Oriol; Gràcia Rivas, Ignacio; Martín Mollevi, Sebastià; Padró Laimon, Carles
Padró Laimon, Carles; Vázquez González, Leonor; Yang, An
Martí Farré, Jaume; Padró Laimon, Carles
 

Coordination

 

Supporters