BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Drupal iCal API//EN
X-WR-CALNAME:Events items teaser
X-WR-TIMEZONE:America/Toronto
BEGIN:VTIMEZONE
TZID:America/Toronto
X-LIC-LOCATION:America/Toronto
BEGIN:DAYLIGHT
TZNAME:EDT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
DTSTART:20180311T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20171105T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:6870ef693a538
DTSTART;TZID=America/Toronto:20180402T130000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20180402T130000
URL:/combinatorics-and-optimization/events/cryptography
 -seminar-ted-eaton-geovandro-pereira-john-schank
SUMMARY:Cryptography Seminar- Ted Eaton\, Geovandro Pereira & John Schank
CLASS:PUBLIC
DESCRIPTION:Summary \n\nTHERE ARE 3 SHORT TALKS THIS WEEK.\n\nTITLE: Quantu
 m Collision-Finding in Non-Uniform Random Functions\n\nSpeaker:\n Ted Eato
 n\n\nAffiliation:\n ISARA Corporatio\n\nRoom:\n MC 6486\n\nABSTRACT: Prov
 ing the security of a scheme against a quantum\nadversary often makes the 
 strong assumption of modelling the hash\nfunction as uniformly random. In 
 this work\, we study the generic\nsecurity of non-uniform random functions
 \, specifically those with\nmin-entropy k. This has applications to the qu
 antum security of the\nFujisaki-Okamoto transformation\, as well as allowi
 ng for more relaxed\nsecurity assumptions. We discuss previous results and
  sketch a proof\nfor an asymptotic upper and lower bound of 2k/3 quantum 
 queries. \n 
DTSTAMP:20250711T110305Z
END:VEVENT
END:VCALENDAR