BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/962
DTSTAMP:20230914T125945Z
SUMMARY:Uncovering Algebraic Structures in the MPC Landscape
DESCRIPTION:Speaker: Manoj M. Prabhakaran (Indian Institute of Technology B
 ombay\nComputer Science and Engineering\nMumbai)\n\nAbstract: \nAbstract: 
 A fundamental open problem in information-theoretically secure multi-party
  computation (MPC) is to characterize functions which admit MPC protocols 
 (say\, secure against passive corruption)\, when more than 2 parties are i
 nvolved. This question has seen little progress since the work of Chor and
  Ishai (1996)\, who demonstrated difficulties in resolving it.\nIn this wo
 rk\, we make significant progress towards resolving this question in the i
 mportant case of aggregating functionalities\, in which m parties P1\, . .
  . \, Pm hold inputs x1\, . . . \, xm and an aggregating party P0 must lea
 rn f(x1\,...\,xm). We uncover a rich class of algebraic structures that ar
 e closely related to secure computability\, namely\, “Commuting Permutat
 ions Systems” (CPS) and its variants. We present a necessary algebraic c
 ondition and a slightly stronger sufficient algebraic condition for a func
 tion to admit information-theoretically secure MPC protocols. Along the wa
 y we introduce and study new models of minimally interactive MPC which hel
 p in understanding our positive and negative results better\, and may be o
 f independent practical interest.\nBased on joint work with Navneet Agarwa
 l and Sanat Anand\, to appear at EUROCRYPT'19.\n
URL:https://www.tcs.tifr.res.in/web/events/962
DTSTART;TZID=Asia/Kolkata:20190430T160000
DTEND;TZID=Asia/Kolkata:20190430T170000
LOCATION:A-201 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR