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:20210314T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20211107T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69cf6980dbfe6
DTSTART;TZID=America/Toronto:20211112T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20211112T153000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/tutte-colloq
 uium-greg-zaverucha
SUMMARY:Tutte Colloquium - Greg Zaverucha
CLASS:PUBLIC
DESCRIPTION:TITLE: Shorter Zero-Knowledge Proofs from MPC\n\nSpeaker:\n Gr
 eg Zaverucha\n\nAffiliation:\n Microsoft Research\n\nZoom:\n Please email
  Emma Watson\n\nABSTRACT:\n\nIn this talk I will review the MPC-in-the-he
 ad approach to\nconstructing zero-knowledge proofs\, then talk about some 
 recent\nresearch results to make the proofs shorter.\n\nIn a zero-knowledg
 e proof system\, a prover wants to convince a\nverifier that they know a s
 ecret value\, without revealing it. A common\ncase involves a one-way func
 tion\, where the prover wants to convince a\nverifier that they know a sec
 ret input corresponding to a public\noutput.
DTSTAMP:20260403T071720Z
END:VEVENT
END:VCALENDAR