Now showing items 1-3 of 3

    • Improving the linear programming technique in the search for lower bounds in secret sharing 

      Farràs Ventura, Oriol; Kaced, Tarik; Martín Mollevi, Sebastià; Padró Laimon, Carles (2020-11)
      Article
      Restricted access - publisher's policy
      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. ...
    • On the information ratio of non-perfect secret sharing schemes 

      Farràs Ventura, Oriol; Hansen, Torben; Kaced, Tarik; Padró Laimon, Carles (2017-12-01)
      Article
      Open Access
      A secret sharing scheme is non-perfect if some subsets of players that cannot recover the secret value have partial information about it. The information ratio of a secret sharing scheme is the ratio between the maximum ...
    • Optimal non-perfect uniform secret sharing schemes 

      Farràs Ventura, Oriol; Hansen, Torben; Kaced, Tarik; Padró Laimon, Carles (Springer, 2014)
      Conference report
      Open Access
      A secret sharing scheme is non-perfect if some subsets of participants that cannot recover the secret value have partial information about it. The information ratio of a secret sharing scheme is the ratio between the maximum ...