Welcome to the resource topic for 2017/919
Title:
Improving the Linear Programming Technique in the Search for Lower Bounds in Secret Sharing
Authors: Oriol Farràs, Tarik Kaced, Sebastià Martín, Carles Padró
Abstract:We 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.
ePrint: https://eprint.iacr.org/2017/919
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .