BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/1302
DTSTAMP:20230914T125958Z
SUMMARY:Randomness Requirements for Three-Secret Sharing
DESCRIPTION:Speaker: Hari Krishnan P A\n\nAbstract: \nConsider a secret sha
 ring problem with three secrets related to each other\, i.e.\, we allow on
 ly certain combinations of the three secrets. A dealer produces three shar
 es such that every pair of share reveals a certain secret and nothing abou
 t the other two secrets other than what can be inferred from the revealed 
 secret. We bound the randomness complexity of each possible set of permiss
 ible combinations and give randomness-optimal schemes for the same for bin
 ary secrets.\nThis is a joint work with Aayush Rajesh\, Varun Narayanan\, 
 Manoj Prabhakaran and Vinod Prabhakaran.\n
URL:https://www.tcs.tifr.res.in/web/events/1302
DTSTART;TZID=Asia/Kolkata:20230609T140000
DTEND;TZID=Asia/Kolkata:20230609T150000
LOCATION:A201
END:VEVENT
END:VCALENDAR