BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/1631
DTSTAMP:20251024T044341Z
SUMMARY:Homomorphic Secret Sharing Constructions
DESCRIPTION:Speaker: Hari Krishnan P A (TIFR)\n\nAbstract: \n\nSuppose two 
 parties\, at most one of them being semi-honest\, attempt to compute a fun
 ction interactively and securely. The communication incurred during such a
  computation\, while done unconditionally\, depends on the circuit-size of
  the function being computed. However\, it is possible to break this 'circ
 uit-size barrier' if we have the LWE (learning with errors) assumption\, s
 ince we know how to get fully homomorphic encryption (FHE) from LWE and th
 en using FHE with this simple protocol - the first party encrypts its inpu
 t and sends them to the second party and then the second party applies the
  function locally under the FHE and outputs the function value. \nIn a 20
 16 CRYPTO paper\, Boyle\, Gilboa and Ishai constructed a primitive known a
 s Homomorphic Secret Sharing\, which also breaks the circuit-size barrier 
 for certain circuits\, but without heavy assumptions like LWE. In fact the
  only assumption they used was DDH (decisional Diffie-Hellman). In this ta
 lk\, we will see this construction.\npaper link - https://eprint.iacr.org/
 2016/585.pdf\n
URL:https://www.tcs.tifr.res.in/web/events/1631
DTSTART;TZID=Asia/Kolkata:20251024T160000
DTEND;TZID=Asia/Kolkata:20251024T170000
LOCATION:A-201 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR