Ligeti Péter: Secret sharing, matroids and combopt

Secret sharing is a method for distributing partial
information of a secret amongst the users in a way that
only some predefined groups are able to recover it from the shared
knowledge. Although an essential building block of several cryptographic
systems, the related problems are connected to combinatorics, especially
to matroid theory and combinatorial optimization. The purpose of this
talk is to highlight such connections and open problems.