BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/449
DTSTAMP:20230914T125925Z
SUMMARY:On the Communication Complexity of Secure Computation
DESCRIPTION:Speaker: Deepesh  Data\n\nAbstract: \nAbstract: In Secure multi
 party computation (MPC)\, mutually distrustful parties each having a priva
 te input\, perform a joint computation without revealing their inputs to e
 ach other. Information theoretically secure multi-party computation has be
 en a central primitive of modern cryptography. However\, relatively little
  is known about the communication complexity of this primitive.\n\nIn this
  talk\, first I will give some background in secure MPC and information th
 eory. We consider the problem where three parties are involved\, two of th
 em (Alice and Bob) have inputs and third one (Charlie) wants to compute th
 e output. We insist that Charlie does not learn anything about the other p
 arties' inputs from the protocol other than his output and whatever it rev
 eals about the inputs. Also\, Alice and Bob do not learn anything about th
 e other parties' input/output from the protocol. We develop information th
 eoretic tools to prove lower bounds on the communication complexity of sec
 ure computation in our setting and obtain tight bounds for secure computat
 ion protocols for various interesting functions. In particular\, we show t
 hat for certain functions\, there are “communication-ideal” protocols\
 , which achieve the minimum communication simultaneously on all links in t
 he network.\n
URL:https://www.tcs.tifr.res.in/web/events/449
DTSTART;TZID=Asia/Kolkata:20140124T153000
DTEND;TZID=Asia/Kolkata:20140124T173000
LOCATION:AG-80
END:VEVENT
END:VCALENDAR