BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CERN//INDICO//EN
BEGIN:VEVENT
SUMMARY:Maxime Bombar. From Structured Codes to Secure Computation\, and B
 ack Again.
DTSTART:20250318T130000Z
DTEND:20250318T143000Z
DTSTAMP:20260415T202200Z
UID:indico-event-13953@indico.math.cnrs.fr
DESCRIPTION: \nAbstract\nRandom linear codes are well known to be hard to
  decode\, even with quantum computers\, making them a strong alternative t
 o lattice-based post-quantum cryptography\, which has recently been standa
 rdised. However\, traditional cryptography only secures data in transit\, 
 while a growing need is to compute on that data. If lattices also enable (
 fully) homomorphic encryption\, this still requires heavy computations whi
 ch may not be suitable for all use cases.\nIn particular\, when data is di
 stributed among multiple users\, secure Multi-Party Computation (MPC) offe
 rs a more practical alternative. However\, its main bottleneck is often th
 e cost of communication between parties. Fortunately\, highly efficient on
 line MPC protocols exist if all parties share a trusted source of correlat
 ed randomness\, independent of the protocol’s inputs. The challenge then
  reduces to efficiently distributing this randomness.\n\nIn this talk\, I 
 will present primitives known as Pseudorandom Correlation Generators which
  have recently been developed\, leveraging the hardness of decoding random
  linear codes with a specific algebraic structures. These are now regarded
  as one of the most promising approaches for enabling practical MPC in the
  so-called "Correlated Randomness Model".\n\n\nhttps://indico.math.cnrs.fr
 /event/13953/
URL:https://indico.math.cnrs.fr/event/13953/
END:VEVENT
END:VCALENDAR