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:20140309T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20131103T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:6831c12d18fc1
DTSTART;TZID=America/Toronto:20140512T143000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20140512T153000
URL:/institute-for-quantum-computing/events/fawzi-achie
 ving-limits-boundednoisy-quantum-storage-model
SUMMARY:Fawzi: Achieving the limits of the bounded/noisy quantum-storage mo
 del
CLASS:PUBLIC
DESCRIPTION:Summary \n\nOMAR FAWZI\, MCGILL UNIVERSITY\n\nThe goal of two-p
 arty cryptography is to enable Alice and Bob to solve\ntasks in cooperatio
 n even if they do not trust each other. Examples of\nsuch tasks include bi
 t commitment\, coin flipping and oblivious\ntransfer. Unfortunately\, it h
 as been shown that even using quantum\ncommunication\, none of these tasks
  can be implemented when the\nadversary is completely general.\n 
DTSTAMP:20250524T125301Z
END:VEVENT
END:VCALENDAR