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:20260308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20261101T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:6af0c12b59749
DTSTART;TZID=America/Toronto:20261111T100000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20261111T110000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/crypto-readi
 ng-group-quantum-computing-huanhuan-chen-bruce
SUMMARY:Crypto Reading Group on quantum computing | Huanhuan Chen & Bruce X
 u\,\nClassical Security Proofs\, Game Hopping and the Random Oracle Model
CLASS:PUBLIC
DESCRIPTION:SPEAKER:\n Huanhuan Chen &Bruce Xu\n\nAFFILIATION:\n Universit
 y of Waterloo\n\nROOM:\n MC 5501\n\nABSTRACT: This talk introduces fundam
 ental techniques for proving\nsecurity in classical cryptography\, with an
  emphasis on game hopping\nand the random oracle model. We will discuss ho
 w security arguments\nare structured as sequences of games and how the ran
 dom oracle model\nsimplifies the analysis of cryptographic constructions. 
 As a first\nexample\, we will examine how a random oracle can be used to c
 onstruct\na secure pseudorandom function (PRF) and subsequently a message\
 nauthentication code (MAC). As a second example\, we will explore the\nrol
 e of the random oracle in the Fujisaki–Okamoto transformation and\nits s
 ecurity proof.
DTSTAMP:20261108T183627Z
END:VEVENT
END:VCALENDAR