BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Carles Padro (Universitat Politècnica de Catalunya)
DTSTART:20230329T150000Z
DTEND:20230329T161500Z
DTSTAMP:20260423T052922Z
UID:AAIT/9
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/AAIT/9/">Low
 er Bounds in Secret Sharing from Information Theory.</a>\nby Carles Padro 
 (Universitat Politècnica de Catalunya) as part of Seminar on Algorithmic 
 Aspects of Information Theory\n\n\nAbstract\nnformation theory has been us
 ed for decades in the search for lower bounds in secret sharing. The main 
 achievements and limitations of that technique are discussed in this surve
 y 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 i
 ntuition on the limits of the method and a comparison with the existing lo
 wer bounds for linear secret sharing schemes.\n
LOCATION:https://researchseminars.org/talk/AAIT/9/
END:VEVENT
END:VCALENDAR