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:69d0a5e2ec44a
DTSTART;TZID=America/Toronto:20180402T130000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20180402T130000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/cryptography
 -seminar-ted-eaton-geovandro-pereira-john-schank
LOCATION:MC - Mathematics & Computer Building 200 University Avenue West 64
 86 Waterloo ON N2L 3G1 Canada
SUMMARY:Cryptography Seminar- Ted Eaton\, Geovandro Pereira & John Schank
CLASS:PUBLIC
DESCRIPTION:THERE ARE 3 SHORT TALKS THIS WEEK.\n\nTITLE: Quantum Collision-
 Finding in Non-Uniform Random Functions\n\nSpeaker:\n Ted Eaton\n\nAffilia
 tion:\n ISARA Corporatio\n\nRoom:\n MC 6486\n\nABSTRACT: Proving the secu
 rity of a scheme against a quantum\nadversary often makes the strong assum
 ption of modelling the hash\nfunction as uniformly random. In this work\, 
 we study the generic\nsecurity of non-uniform random functions\, specifica
 lly those with\nmin-entropy k. This has applications to the quantum securi
 ty of the\nFujisaki-Okamoto transformation\, as well as allowing for more 
 relaxed\nsecurity assumptions. We discuss previous results and sketch a pr
 oof\nfor an asymptotic upper and lower bound of 2k/3 quantum queries. 
DTSTAMP:20260404T054714Z
END:VEVENT
END:VCALENDAR