BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//wp-events-plugin.com//7.2.3.1//EN
TZID:Europe/Paris
X-WR-TIMEZONE:Europe/Paris
BEGIN:VEVENT
UID:6574@i2m.univ-amu.fr
DTSTART;TZID=Europe/Paris:20210121T103000
DTEND;TZID=Europe/Paris:20210121T113000
DTSTAMP:20241120T201743Z
URL:https://www.i2m.univ-amu.fr/evenements/on-higher-order-cryptography-ra
 phaelle-crubille/
SUMMARY:Raphaëlle Crubillé (LORIA\, PESTO team\, Nancy): On higher-order 
 cryptography - Raphaëlle Crubillé
DESCRIPTION:Raphaëlle Crubillé: Type-two constructions abound in cryptogr
 aphy: adversaries for encryption and authentication schemes\, if active\, 
 are modeled as algorithms having access to oracles\, i.e. as second-order 
 algorithms.\nBut how about making cryptographic schemes themselves higher-
 order? This work gives an answer to this question\, by first describing wh
 y higher-order cryptography is interesting as an object of study\, then sh
 owing how the concept of probabilistic polynomial time algorithm can be ge
 neralized so as to encompass algorithms of order strictly higher than two\
 , and finally proving some positive and negative results about the existen
 ce of higher-order cryptographic primitives\, namely authentication scheme
 s and pseudorandom functions.\n(Joint work with Boaz Barak and Ugo Dal Lag
 o)\nVisio-conférence ici :\n\n  https://greenlight.lal.cloud.math.cnrs.f
 r/b/lio-hdc-jef\n\n&nbsp\;
ATTACH;FMTTYPE=image/jpeg:https://www.i2m.univ-amu.fr/wp-content/uploads/2
 020/01/Raphaelle_Crubille.jpg
CATEGORIES:Séminaire,Logique et Interactions,Virtual event
END:VEVENT
BEGIN:VTIMEZONE
TZID:Europe/Paris
X-LIC-LOCATION:Europe/Paris
BEGIN:STANDARD
DTSTART:20201025T020000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
END:STANDARD
END:VTIMEZONE
END:VCALENDAR