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:69e0c40c6e55c
DTSTART;TZID=America/Toronto:20220310T113000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20220310T113000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/cryptography
 -reading-group
SUMMARY:Cryptography Reading Group
CLASS:PUBLIC
DESCRIPTION:TITLE: “Lattice-Based Zero-Knowledge Arguments for Integer\n
 Relations” by Benoit Libert\, San Ling\, Khoa Nguyen\, and Huaxiong\nWan
 g\n\nSpeaker:\n Camryn Steckel\n\nAffiliation:\n University of Waterloo\n\
 nZoom:\n Contact Jesse Elliott\n\nABSTRACT:\n\nWe provide lattice-based pr
 otocols allowing to prove relations among\ncommitted integers. While the m
 ost general zero-knowledge proof\ntechniques can handle arithmetic circuit
 s in the lattice setting\,\nadapting them to prove statements over the int
 egers is non-trivial\, at\nleast if we want to handle exponentially large 
 integers while working\nwith a polynomial size modulus q.
DTSTAMP:20260416T111212Z
END:VEVENT
END:VCALENDAR