Accés ràpid intranet

Més informació...

a a a
Inici

Deiminari

Títol

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

Conferenciant

Oriol Farrs

Professor/a organitzador/a

Institució

URV

Data

25-04-2018 12:00

Resum

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. This is a joint work with Tarik Kaced, Sebasti Martn and Carles Padr. It will be presented in EUROCRYPT 2018.

Lloc

LAb 231

Idioma

Angls