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:68339432dc779
DTSTART;TZID=America/Toronto:20220310T113000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20220310T113000
URL:/combinatorics-and-optimization/events/cryptography
 -reading-group
SUMMARY:Cryptography Reading Group
CLASS:PUBLIC
DESCRIPTION:Summary \n\nTITLE: “Lattice-Based Zero-Knowledge Arguments f
 or Integer\nRelations” by Benoit Libert\, San Ling\, Khoa Nguyen\, and H
 uaxiong\nWang\n\nSpeaker:\n Camryn Steckel\n\nAffiliation:\n University of
  ��ݮ��Ƶ\n\nZoom:\n Contact Jesse Elliott\n\nABSTRACT:\n\nWe provide latt
 ice-based protocols allowing to prove relations among\ncommitted integers.
  While the most general zero-knowledge proof\ntechniques can handle arithm
 etic circuits in the lattice setting\,\nadapting them to prove statements 
 over the integers is non-trivial\, at\nleast if we want to handle exponent
 ially large integers while working\nwith a polynomial size modulus q.\n 
DTSTAMP:20250525T220538Z
END:VEVENT
END:VCALENDAR