BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/1746
DTSTAMP:20260713T111202Z
SUMMARY:Some randomness and algebraic structures in secure multi-party comp
 utation
DESCRIPTION:Speaker: Hari Krishnan P A\n\nAbstract: \nIn this talk\, we con
 sider the following problems:\nA significant body of work is devoted to un
 derstanding the power of randomness in private computation. We make furthe
 r progress on this by studying the randomness in a simple model of private
  computation called 'Private Stateless Sequential (PSS)' model. We show t
 hat the functions which can be computed 1-privately (i.e.\, 1 semi-honest 
 corruption) with O(1) randomness using a speak-O(1)-times protocols are ex
 actly those which can be computed with a constant-width read-O(1) branchin
 g programs.\nWe study the distributed function computation problem with k 
 users of which at most s may be controlled by an adversary and characteriz
 e the set of functions of the sources the decoder can reconstruct robustly
  in the following sense -- if the users behave honestly\, the function is 
 recovered with high probability (w.h.p.)\; if they behave adversarially\, 
 w.h.p\, either one of the adversarial users will be identified or the func
 tion is recovered with vanishingly small distortion.\nWe introduce the pse
 udo-random object called psedo-random homomorphism families (PHF). These o
 bjects are related to seed-homomorphic PRGs\, and are observed to yield ma
 ny standard computational assumptions. Upon imposing additional algebraic 
 structures on these PHFs\, they are shown to help obtain certain pseudo-ra
 ndom correlation generators (PCGs) from certain other PCG\n
URL:https://www.tcs.tifr.res.in/web/events/1746
DTSTART;TZID=Asia/Kolkata:20260717T110000
DTEND;TZID=Asia/Kolkata:20260717T120000
LOCATION:A-201 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR