BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/1253
DTSTAMP:20230914T125956Z
SUMMARY:How to Simulate it?
DESCRIPTION:Speaker: Manideep Mamindlapally (STCS\, TIFR\, Mumbai.)\n\nAbst
 ract: \nThe notion of security for multi-party computations is not absolut
 ely defined. Simulation is a technique that models an abstract "ideal worl
 d" where a desired multi-party functionality is computed\, and is secure b
 y definition. Then in the "real world" you would execute any given interac
 tive protocol between agents\, who could be honest or cheating. You would 
 then argue that the outputs are similar to those of the secure "ideal worl
 d"\, and in doing so prove that the protocol itself is secure. In this sem
 inar\, I will talk about some such simulation proof techniques for some co
 mmon multi-party computation problems - oblivious transfer and the zero-kn
 owledge proof for the 3-colouring graph problem - based on examples from a
  tutorial by Yehuda Lindell.\n
URL:https://www.tcs.tifr.res.in/web/events/1253
DTSTART;TZID=Asia/Kolkata:20221125T160000
DTEND;TZID=Asia/Kolkata:20221125T170000
LOCATION:A201
END:VEVENT
END:VCALENDAR