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 ...
    • On the optimization of bipartite secret sharing schemes 

      Farràs Ventura, Oriol; Metcalf-Burton, Jessica Ruth; Padró Laimon, Carles; Vázquez González, Leonor (2012-05-01)
      Article
      Open Access
      Optimizing the ratio between the maximum length of the shares and the length of the secret value in secret sharing schemes for general access structures is an extremely difficult and long-standing open problem. In this ...
    • On the optimization of bipartite secret sharing schemes 

      Farras Ventura, Oriol; Metcalf-Burton, Jessica Ruth; Padró Laimon, Carles; Vázquez González, Leonor (2010)
      Article
      Open Access
      Optimizing the ratio between the maximum length of the shares and the length of the secret value in secret sharing schemes for general access structures is an extremely difficult and long-standing open problem. In this ...