BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/1166
DTSTAMP:20230914T125953Z
SUMMARY:Computationally Secure Computation from One-Way Noisy Communication
DESCRIPTION:Speaker: Varun Narayanan (Technion)\n\nAbstract: \nCan a sender
  encode a pair of messages (m0\, m1) jointly\, and send their encoding ove
 r (say) a binary erasure channel\, so that the receiver can decode exactly
  one of the two messages and the sender does not know which one?\nGarg et 
 al. (Crypto 2015) showed that this is information-theoretically impossible
 . We show how to circumvent this impossibility by assuming that the receiv
 er is computationally bounded\, settling for an inverse- polynomial securi
 ty error (which is provably necessary)\, and relying on ideal obfuscation.
  Our solution creates a "computational anti-correlation" between the event
 s of receiving m0 and receiving m1 by exploiting the anti-concentration of
  the binomial distribution.\nThe ideal obfuscation primitive in our constr
 uction can either be directly realized using (stateless)  tamper-proof har
 dware\, yielding an unconditional result.\nAs a corollary\, we get similar
  feasibility results for general secure computation of sender-receiver fun
 ctionalities by leveraging the completeness of the above random oblivious 
 transfer functionality.\n\nZoom link: \nhttps://zoom.us/j/93889521556?pwd=
 eEFJWVRtRHNpNlpZWmhNYTJGQTF6Zz09\n
URL:https://www.tcs.tifr.res.in/web/events/1166
DTSTART;TZID=Asia/Kolkata:20211008T171500
DTEND;TZID=Asia/Kolkata:20211008T181500
END:VEVENT
END:VCALENDAR