Show simple item record

dc.contributor.authorFarràs Ventura, Oriol
dc.contributor.authorMetcalf-Burton, Jessica Ruth
dc.contributor.authorPadró Laimon, Carles
dc.contributor.authorVázquez González, Leonor
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Matemàtiques
dc.date.accessioned2017-06-29T08:25:56Z
dc.date.available2017-06-29T08:25:56Z
dc.date.issued2012-05-01
dc.identifier.citationFarràs Ventura, O., Metcalf-Burton, J., Padro, C., Vázquez, L. On the optimization of bipartite secret sharing schemes. "Designs codes and cryptography", 1 Maig 2012, vol. 63, núm. 2, p. 255-271.
dc.identifier.issn0925-1022
dc.identifier.urihttp://hdl.handle.net/2117/105969
dc.description.abstractOptimizing 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.
dc.format.extent17 p.
dc.language.isoeng
dc.subjectÀrees temàtiques de la UPC::Matemàtiques i estadística::Anàlisi numèrica
dc.subjectÀrees temàtiques de la UPC::Matemàtiques i estadística::Probabilitat
dc.subjectÀrees temàtiques de la UPC::Matemàtiques i estadística::Investigació operativa::Optimització
dc.subject.lcshCoding theory
dc.subject.lcshProgramming (Mathematics)
dc.subject.lcshNumerical analysis
dc.subject.otherCryptography
dc.subject.otherSecret sharing
dc.subject.otherMultipartite secret sharing
dc.subject.otherPolymatroids
dc.subject.otherLinear programming
dc.titleOn the optimization of bipartite secret sharing schemes
dc.typeArticle
dc.subject.lemacCodificació, Teoria de la
dc.subject.lemacProgramació (Matemàtica)
dc.subject.lemacAnàlisi numèrica
dc.contributor.groupUniversitat Politècnica de Catalunya. MAK - Matemàtica Aplicada a la Criptografia
dc.identifier.doi10.1007/s10623-011-9552-7
dc.description.peerreviewedPeer Reviewed
dc.subject.amsClassificació AMS::94 Information And Communication, Circuits::94A Communication, information
dc.subject.ams90C Mathematical programming
dc.subject.amsClassificació AMS::65 Numerical analysis::65K Mathematical programming, optimization and variational techniques
dc.relation.publisherversionhttps://link.springer.com/article/10.1007%2Fs10623-011-9552-7
dc.rights.accessOpen Access
local.identifier.drac18547272
dc.description.versionPostprint (author's final draft)
local.citation.authorFarràs Ventura, O.; Metcalf-Burton, J.; Padro, C.; Vázquez, L.
local.citation.publicationNameDesigns codes and cryptography
local.citation.volume63
local.citation.number2
local.citation.startingPage255
local.citation.endingPage271


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder