Show simple item record

dc.contributorPadró Laimon, Carles
dc.contributor.authorHernández Ansuátegui, Félix
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Matemàtiques
dc.description.abstractSecret sharing refers to methods used to distribute a secret value among a set of participants. This work deals with the optimization of two parameters regarding the efficiency of a secret sharing scheme: the information ratio and average information ratio. Only access structures (a special family of sets) on 5 and 6 participants will be considered. First, access structures with 5 participants will be studied, followed by the ones on 6 participants that are based on graphs. The main goal of the paper is to check existing lower bounds (and improve some of them) by using linear programs with the sage solver. Shannon information inequalities have been used to translate the polymatroid axioms into linear constraints.
dc.publisherUniversitat Politècnica de Catalunya
dc.subjectÀrees temàtiques de la UPC::Matemàtiques i estadística
dc.subject.lcshComputer science--Mathematics
dc.subject.otherSecret Sharing
dc.subject.otherInfomation Ratio
dc.subject.otherLinear programming
dc.titleSecret sharing schemes: Optimizing the information ratio
dc.typeBachelor thesis
dc.subject.amsClassificació AMS::68 Computer science::68R Discrete mathematics in relation to computer science
dc.rights.accessOpen Access
dc.audience.mediatorUniversitat Politècnica de Catalunya. Facultat de Matemàtiques i Estadística

Files in this item


This item appears in the following Collection(s)

Show simple item record

Except where otherwise noted, content on this work is licensed under a Creative Commons license: Attribution-NonCommercial-NoDerivs 3.0 Spain