Optimal Uniform Secret Sharing.

An important problem in secret sharing schemes is minimizing the share size. For (k, n)-threshold schemes and (k, L, n)-ramp schemes, constructions that minimize the share size are known. This paper presents optimal constructions for a more general class of access structures in which subsets with the same cardinality have the same amount of information about the secret. We refer to schemes with su...