BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/1170
DTSTAMP:20230914T125953Z
SUMMARY:Upper bound on randomness complexity of private 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. It was previously known
  that XOR can be computed using only one random bit for any number of play
 ers.\n\nIn this talk\, we will see the result by Kushilevitz et al. which 
 shows that there exists a protocol that can privately compute the Boolean 
 function AND with 8 random bits for n>3 players and 7 bits for n=3 players
  under a semi-honest adversarial setting.\n\nLink to the paper: https://ep
 ubs.siam.org/doi/pdf/10.1137/20M1314197\n\nZoom link:  https://zoom.us/j/9
 3889521556?pwd=eEFJWVRtRHNpNlpZWmhNYTJGQTF6Zz09\n
URL:https://www.tcs.tifr.res.in/web/events/1170
DTSTART;TZID=Asia/Kolkata:20211112T171500
DTEND;TZID=Asia/Kolkata:20211112T181500
END:VEVENT
END:VCALENDAR