Improving the Linear Programming Technique in the Search for Lower Bounds in Secret Sharing

Identificador:  imarina:9138837

Handle: https://hdl.handle.net/20.500.11797/imarina9138837

Autors:  Farras, O; Kaced, T; Martín, S; Padró, C

Resum:
© 1963-2012 IEEE. 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.