Show simple item record

dc.contributor.authorFarràs Ventura, Oriol
dc.contributor.authorKaced, Tarik
dc.contributor.authorMartín Mollevi, Sebastià
dc.contributor.authorPadró Laimon, Carles
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Matemàtiques
dc.date.accessioned2021-02-10T09:06:37Z
dc.date.available2021-11-01T01:27:36Z
dc.date.issued2020-11
dc.identifier.citationFarràs Ventura, O. [et al.]. Improving the linear programming technique in the search for lower bounds in secret sharing. "IEEE transactions on information theory", Novembre 2020, vol. 66, núm. 11, p. 7088-7100.
dc.identifier.issn0018-9448
dc.identifier.urihttp://hdl.handle.net/2117/338198
dc.description.abstractWe present a new improvement in the linear programming technique to derive lower bounds on the information ratio of secret sharing schemes. We obtain non-Shannon-type bounds without using information inequalities explicitly. Our new technique makes it possible to determine the optimal information ratio of linear secret sharing schemes for all access structures on $5$ participants and all graph-based access structures on $6$ participants. In addition, new lower bounds are presented also for some small matroid ports and, in particular, the optimal information ratios of the linear secret sharing schemes for the ports of the Vamos matroid are determined.
dc.description.sponsorshipOriol Farr`as is supported by the Spanish Government through TIN2014-57364-C2-1-R and by the Catalan government through 2017SGR-705. Tarik Kaced acknowledges the support of the French Agence Nationale de la Recherche (ANR), under grant ANR-16-CE23-0016-01 (project PAMELA). Sebasti`a Mart´ın and Carles Padr´o are supported by Spanish Government through MTM2016-77213-R.
dc.format.extent13 p.
dc.language.isoeng
dc.subjectÀrees temàtiques de la UPC::Matemàtiques i estadística::Investigació operativa::Programació matemàtica
dc.subject.lcshProgramming (Mathematics)
dc.subject.otherSecret sharing
dc.subject.otherInformation inequalities
dc.subject.otherRank inequalities
dc.subject.otherCommon information
dc.subject.otherLinear Programming
dc.titleImproving the linear programming technique in the search for lower bounds in secret sharing
dc.typeArticle
dc.subject.lemacProgramació (Matemàtica)
dc.contributor.groupUniversitat Politècnica de Catalunya. MAK - Matemàtica Aplicada a la Criptografia
dc.identifier.doi10.1109/TIT.2020.3005706
dc.description.peerreviewedPeer Reviewed
dc.subject.amsClassificació AMS::65 Numerical analysis::65K Mathematical programming, optimization and variational techniques
dc.relation.publisherversionhttps://ieeexplore.ieee.org/document/9127978
dc.rights.accessOpen Access
local.identifier.drac30264982
dc.description.versionPostprint (author's final draft)
dc.relation.projectidinfo:eu-repo/grantAgreement/MINECO/1PE/MTM2016-77213-R
local.citation.authorFarràs Ventura, O.; Kaced, T.; Martin, S.; Padro, C.
local.citation.publicationNameIEEE transactions on information theory
local.citation.volume66
local.citation.number11
local.citation.startingPage7088
local.citation.endingPage7100


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