A secret-sharing scheme is a method by which a dealer distributes shares to parties such
that only authorized subsets of parties can reconstruct the secret. Secret-sharing schemes …

Hierarchical secret sharing is among the most natural generalizations of threshold secret
sharing, and it has attracted a lot of attention since the invention of secret sharing until …

Multipartite secret sharing schemes are those having a multipartite access structure, in
which the set of participants is divided into several parts and all participants in the same part …

Multipartite secret sharing schemes are those having a multipartite access structure, in
which the set of participants is divided into several parts and all participants in the same part …

Error-correcting codes and matroids have been widely used in the study of ordinary secret
sharing schemes. In this paper, the connections between codes, matroids, and a special …

Multi-linear secret-sharing schemes are the most common secret-sharing schemes. In these
schemes the secret is composed of some field elements and the sharing is done by applying …

This paper provides a link between matroid theory and locally repairable codes (LRCs) that
are either linear or more generally almost affine. Using this link, new results on both LRCs …

The share size of general secret-sharing schemes is poorly understood. The gap between
the best known upper bound on the total share size per party of 2^ 0.64 n (Applebaum et al …

These are basically the lecture notes for the short course" Applications of Combinatorics to
Information-Theoretic Cryptography", Central European University, Budapest, May-June …

In a secret-sharing scheme, a secret value is distributed among a set of parties by giving
each party a share. The requirement is that only predefined subsets of parties can recover …