BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/432
DTSTAMP:20230914T125924Z
SUMMARY:Some Complexity Aspects of Secure Multiparty Computation
DESCRIPTION:Speaker: Manoj M. Prabhakaran (University of Illinois at Urbana
 -Champaign\nDepartment of Computer Science\n1110 West Springfield\nUrbana\
 , IL 61801\nUnited States of America)\n\nAbstract: \nAbstract: In this tal
 k\, I will survey a collection of results that study qualitative and quant
 itative complexity of (multi-party) functions\, with respect to how "easy"
  or "hard" they are for Secure Multi-party Computation.\n\nIn particular\,
  we formulate a quantitative notion of "cryptographic complexity" of a (mu
 lti-party) function\, as the number of "crypto gates" needed to securely e
 valuate the function (amortized over several evaluations). Due to recent r
 esults\, we can show that up to constants\, this quantity does not depend 
 on the specific choice of crypto gate\, as long as it is "complete."\n\nI 
 shall discuss some connections of cryptographic complexity with other noti
 ons of complexity of functions\, like circuit complexity and communication
  complexity.\n\nBio: Manoj Prabhakaran is an Associate Professor in the De
 partment of Computer Science at the University of Illinois\, Urbana-Champa
 ign. Manoj received a Ph.D. in Computer Science from Princeton University 
 in 2005\, and a B.Tech in Computer Science and Engineering from the Indian
  Institute of Technology\, Mumbai\, in 2000. His primary research interest
  is in theoretical cryptography. His research has been supported by an NSF
  CAREER award and a Beckman faculty fellowship.\n \n \n
URL:https://www.tcs.tifr.res.in/web/events/432
DTSTART;TZID=Asia/Kolkata:20140101T143000
DTEND;TZID=Asia/Kolkata:20140101T153000
LOCATION:AG-69
END:VEVENT
END:VCALENDAR