BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/1774
DTSTAMP:20260910T045124Z
SUMMARY:The complexity of secret sharing
DESCRIPTION:Speaker: Benny Applebaum (Tel Aviv University)\n\nAbstract: \nS
 ecret sharing allows a dealer to distribute a secret among a collection of
  parties so that only certain authorized subsets can reconstruct the secre
 t\, while unauthorized subsets learn nothing about it. The complexity of s
 uch schemes has been studied for several decades and is governed by the st
 ructure of the underlying access structure.\nOver the last decade\, substa
 ntial progress has been made on several central questions\, yet many basic
  problems remain wide open. In this talk\, I will survey several of these 
 recent developments and highlight some unexpected connections between the 
 complexity of secret sharing and other questions in computational complexi
 ty.\n \n
URL:https://www.tcs.tifr.res.in/web/events/1774
DTSTART;TZID=Asia/Kolkata:20261210T160000
DTEND;TZID=Asia/Kolkata:20261210T170000
LOCATION:Homi Bhabha Auditorium
END:VEVENT
END:VCALENDAR