BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//GREYC UMR CNRS 6072 - Groupe de Recherche en Informatique, Image, et Instrumentation de Caen - ECPv5.7.0//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:GREYC UMR CNRS 6072 - Groupe de Recherche en Informatique, Image, et Instrumentation de Caen
X-ORIGINAL-URL:https://www.greyc.fr
X-WR-CALDESC:évènements pour GREYC UMR CNRS 6072 - Groupe de Recherche en Informatique, Image, et Instrumentation de Caen
BEGIN:VTIMEZONE
TZID:Europe/Paris
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20250330T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20251026T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20251209T104500
DTEND;TZID=Europe/Paris:20251209T114500
DTSTAMP:20260418T234321
CREATED:20251219T084006Z
LAST-MODIFIED:20251219T084006Z
UID:12005-1765277100-1765280700@www.greyc.fr
SUMMARY:Séminaire Algorithmique : « Structured-Seed Local Pseudorandom Generators and their Applications »\, Melissaris Nikolas (IRIF\, Univ. Paris Cité)
DESCRIPTION:Pseudorandom generators are basic tools for simulating randomness efficiently. A local PRG is one where each output bit depends on only a few bits of the seed\, which makes them useful in low-depth cryptography and certain complexity-theoretic constructions. \nIn this talk\, I will introduce structured-seed local PRGs (SSL-PRGs)\, where the seed is not uniform but comes from a simple\, efficiently sampleable structured distribution. This small change turns out to broaden what we can build: we can construct SSL-PRGs under assumptions that are much weaker than those needed for standard local PRGs. \nThe key idea combines PRGs that tolerate “noisy” sparse input with new ways to locally compress sparse vectors. From this\, we obtain efficient SSL-PRGs based on variants of the Learning-Parity-with-Noise problem. I will also show how SSL-PRGs recover several known applications such as constant overhead secure computation and hardness-of-learning\, under these milder assumptions.
URL:https://www.greyc.fr/event/seminaire-algorithmique-structured-seed-local-pseudorandom-generators-and-their-applications-melissaris-nikolas-irif-univ-paris-cite/
LOCATION:Sciences 3- S3 351
CATEGORIES:Amacc,General,News
END:VEVENT
END:VCALENDAR