BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/1090
DTSTAMP:20230914T125950Z
SUMMARY:Network Oblivious Transfer
DESCRIPTION:Speaker: Varun Narayanan\n\nAbstract: \nSecure message transmis
 sion and Byzantine agreement have been studied extensively in incomplete n
 etworks. However\, information theoretically secure multiparty computation
  (MPC) in incomplete networks is less well understood. In this paper\, we 
 characterize the conditions under which a pair of parties can compute obli
 vious transfer (OT) information theoretically securely against a general a
 dversary structure in an incomplete network of reliable\, private channels
 . We provide characterization for semi-honest model of corruption. A conse
 quence of our results is a complete characterization of networks in which 
 a given subset of parties can compute any functionality securely with resp
 ect to an adversary structure in the semi-honest case.\n
URL:https://www.tcs.tifr.res.in/web/events/1090
DTSTART;TZID=Asia/Kolkata:20201013T140000
DTEND;TZID=Asia/Kolkata:20201013T153000
END:VEVENT
END:VCALENDAR