BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/1183
DTSTAMP:20230914T125953Z
SUMMARY:Lower bound on randomness complexity of secure computations of AND
DESCRIPTION:Speaker: Hari Krishnan P A\n\nAbstract: \nIn a secure multi-par
ty computation problem\, players are required to compute a function of the
ir private inputs without revealing any extra information about this input
to other players. Randomness complexity is the number of random bits used
by the protocol which enables such a computation. Since randomness is an
expensive resource\, developing MPC protocols to operate on minimum amount
of randomness has been an interesting problem. In a recent work\, Kushile
vitz et. al. prove a lower bound of 1 bit and an upper bound of 7 bits (8
bits) for the randomness complexity of securely computing Boolean AND func
tion in a 3-player (n>3 player) setting. In this work\, we improve upon th
is lower bound obtaining 3 bits for a 3-player setting using information t
heoretic tools.\nZoom link -\nhttps://zoom.us/j/98392241202?pwd=bTJRYklZZE
RXWWpIK0RIdnFZNzJSQT09\n
URL:https://www.tcs.tifr.res.in/web/events/1183
DTSTART;TZID=Asia/Kolkata:20220124T160000
DTEND;TZID=Asia/Kolkata:20220124T170000
LOCATION:Via Zoom
END:VEVENT
END:VCALENDAR