Browsing by Author "Yang, An"

Now showing items 1-3 of 3

    • Finding lower bounds on the complexity of secret sharing schemes by linear programming 

      Padró Laimon, Carles; Vázquez González, Leonor; Yang, An (2013-05-01)
      Article
      Open Access
      Optimizing the maximum, or average, length of the shares in relation to the length of the secret for every given access structure is a difficult and long-standing open problem in cryptology. Most of the known lower bounds ...

    • Natural generalizations of threshold secret sharing 

      Farràs Ventura, Oriol; Padró Laimon, Carles; Xing, Chaoping; Yang, An (2014-01-14)
      Article
      Open Access
      We present new families of access structures that, similarly to the multilevel and compartmented access structures introduced in previous works, are natural generalizations of threshold secret sharing. Namely, they admit ...

    • Secret sharing, rank inequalities, and information inequalities 

      Martín Mollevi, Sebastià; Padró Laimon, Carles; Yang, An (2016-01)
      Article
      Open Access
      Beimel and Orlov proved that all information inequalities on four or five variables, together with all information inequalities on more than five variables that are known to date, provide lower bounds on the size of the ...