Introduction to Secret Sharing Schemes: Constructions

Abstract: 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. The family of these authorized subsets is called the access structure of the scheme. This introductory talk is focused on the problem of finding efficient secret sharing schemes for general access structures. We will see some general constructions as well as their limitations. We will review connections between the problem of finding efficient schemes and other problems, such as finding small monotone formulas and monotone span programs for monotone Boolean functions, and problems of matroid theory and entropy optimization.

Computer scienceMathematics

Audience: researchers in the discipline

Seminar on Algorithmic Aspects of Information Theory

Series comments: This online seminar is a follow up of the Dagstuhl Seminar 22301, www.dagstuhl.de/en/program/calendar/semhp/?semnr=22301.