BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/549
DTSTAMP:20230914T125929Z
SUMMARY:Complete Characterization of Two-party Securely Computable Function
 s
DESCRIPTION:Speaker: Deepesh  Data\n\nAbstract: \nAbstract: In two-party se
 cure computation\, Alice has an input X\, Bob has an input Y and both of t
 hem want to compute a function $f:\\mathcal{X} \\times \\mathcal{Y} \\to \
 \mathcal{Z}$ securely by exchanging messages to each other over several ro
 unds. By security we mean that they should compute $f(X\,Y)$ correctly and
  either party should not learn any information about the other party's inp
 ut other than what it can infer from its own input and the function value.
  We will characterize the class of securely computable functions\, i.e.\, 
 which functions can be computed securely and which cannot be.\n
URL:https://www.tcs.tifr.res.in/web/events/549
DTSTART;TZID=Asia/Kolkata:20141114T140000
DTEND;TZID=Asia/Kolkata:20141114T153000
LOCATION:D-405 (D-Block Seminar Room)
END:VEVENT
END:VCALENDAR