Lower Bounds in Secret Sharing from Information Theory.

Abstract: nformation theory has been used for decades in the search for lower bounds in secret sharing. The main achievements and limitations of that technique are discussed in this survey talk. Among the former, Csirmaz's general lower bound, which is still the best of the known ones, and the findings of exact optimal information ratios for several families of access structures. For the latter, some intuition on the limits of the method and a comparison with the existing lower bounds for linear secret sharing schemes.

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.