BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Benjamin Smith (INRIA and École Polytechnique)
DTSTART:20201019T140000Z
DTEND:20201019T150000Z
DTSTAMP:20260315T021731Z
UID:SAC2020-School/1
DESCRIPTION:Title: Modern elliptic curve cryptography (Part 1)\nby Benjamin Smith
(INRIA and École Polytechnique) as part of SAC 2020 "Summer" School\n\n\n
Abstract\nThis is a very short course on the foundations of modern ellipti
c curve cryptography. First\, we will cover the basics on elliptic curves
and their arithmetic\, and the difficulty and inter-relationship of the El
liptic Curve Discrete Log and Elliptic Curve Diffie-Hellman problems. Then
\, we will dive into the design of state-of-the-art ECC protocols\, includ
ing Curve25519/X25519 key exchange and contemporary elliptic curve signatu
re schemes.\n
LOCATION:https://researchseminars.org/talk/SAC2020-School/1/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Benjamin Smith (INRIA and École Polytechnique)
DTSTART:20201019T160000Z
DTEND:20201019T170000Z
DTSTAMP:20260315T021731Z
UID:SAC2020-School/2
DESCRIPTION:Title: Modern elliptic curve cryptography (Part 2)\nby Benjamin Smith
(INRIA and École Polytechnique) as part of SAC 2020 "Summer" School\n\n\n
Abstract\nThis is a very short course on the foundations of modern ellipti
c curve cryptography. First\, we will cover the basics on elliptic curves
and their arithmetic\, and the difficulty and inter-relationship of the El
liptic Curve Discrete Log and Elliptic Curve Diffie-Hellman problems. Then
\, we will dive into the design of state-of-the-art ECC protocols\, includ
ing Curve25519/X25519 key exchange and contemporary elliptic curve signatu
re schemes.\n
LOCATION:https://researchseminars.org/talk/SAC2020-School/2/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Jeremy Clark (Concordia University (Montreal))
DTSTART:20201019T190000Z
DTEND:20201019T200000Z
DTSTAMP:20260315T021731Z
UID:SAC2020-School/3
DESCRIPTION:Title: Can crypto help enhance democracy? (Part 1)\nby Jeremy Clark (C
oncordia University (Montreal)) as part of SAC 2020 "Summer" School\n\n\nA
bstract\nIn this workshop\, we will explore the world of voting technology
. We will show you how cryptography can enhance the verifiability of an el
ection\, which is a challenge when a secret ballot needs to be obtained. W
e will discuss some real-world attempts at putting this type of cryptograp
hic voting into practice. We will also discuss ways it can go wrong—from
subtle cryptographic oversights to broader forms of cybersecurity attacks
. Finally\, we will focus on the issue of internet voting: if you can bank
online\, why can’t you vote online? It turns out there are a few good r
easons.\n
LOCATION:https://researchseminars.org/talk/SAC2020-School/3/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Jeremy Clark (Concordia University (Montreal))
DTSTART:20201019T210000Z
DTEND:20201019T220000Z
DTSTAMP:20260315T021731Z
UID:SAC2020-School/4
DESCRIPTION:Title: Can crypto help enhance democracy? (Part 2)\nby Jeremy Clark (C
oncordia University (Montreal)) as part of SAC 2020 "Summer" School\n\n\nA
bstract\nIn this workshop\, we will explore the world of voting technology
. We will show you how cryptography can enhance the verifiability of an el
ection\, which is a challenge when a secret ballot needs to be obtained. W
e will discuss some real-world attempts at putting this type of cryptograp
hic voting into practice. We will also discuss ways it can go wrong—from
subtle cryptographic oversights to broader forms of cybersecurity attacks
. Finally\, we will focus on the issue of internet voting: if you can bank
online\, why can’t you vote online? It turns out there are a few good r
easons.\n
LOCATION:https://researchseminars.org/talk/SAC2020-School/4/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Antoine Joux (CISPA Helmholtz-Zentrum)
DTSTART:20201020T140000Z
DTEND:20201020T150000Z
DTSTAMP:20260315T021731Z
UID:SAC2020-School/5
DESCRIPTION:Title: Polynomial systems of equations and their cryptographic aspects (Pa
rt 1)\nby Antoine Joux (CISPA Helmholtz-Zentrum) as part of SAC 2020 "
Summer" School\n\n\nAbstract\nIn this lecture\, we will discuss several as
pects of polynomial equations and their use in cryptography. We will first
motivate the topic be showing some uses of such systems in cryptography.
Then\, we will turn to the cryptanalytic aspects\, describing algorithmic
techniques to solve such systems. In this part\, we start be recalling the
easy special cases before turning to the general case of non-linear multi
variate systems (over finite fields). We will discuss three different appr
oaches\, exhaustive search\, algebraic methods (aka as Groebner bases or X
L computations) and probabilistic degree reduction (introduced by Lokshtan
ov et al.).\n
LOCATION:https://researchseminars.org/talk/SAC2020-School/5/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Antoine Joux (CISPA Helmholtz-Zentrum)
DTSTART:20201020T160000Z
DTEND:20201020T170000Z
DTSTAMP:20260315T021731Z
UID:SAC2020-School/6
DESCRIPTION:Title: Polynomial systems of equations and their cryptographic aspects (Pa
rt 2)\nby Antoine Joux (CISPA Helmholtz-Zentrum) as part of SAC 2020 "
Summer" School\n\n\nAbstract\nIn this lecture\, we will discuss several as
pects of polynomial equations and their use in cryptography. We will first
motivate the topic be showing some uses of such systems in cryptography.
Then\, we will turn to the cryptanalytic aspects\, describing algorithmic
techniques to solve such systems. In this part\, we start be recalling the
easy special cases before turning to the general case of non-linear multi
variate systems (over finite fields). We will discuss three different appr
oaches\, exhaustive search\, algebraic methods (aka as Groebner bases or X
L computations) and probabilistic degree reduction (introduced by Lokshtan
ov et al.).\n\nUnfortunately the first 10-15 minutes of this talk are miss
ing in the video. Complete slides are available.\n
LOCATION:https://researchseminars.org/talk/SAC2020-School/6/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Vanessa Teague (Thinking Cybersecurity and Australian National Uni
versity)
DTSTART:20201020T190000Z
DTEND:20201020T200000Z
DTSTAMP:20260315T021731Z
UID:SAC2020-School/7
DESCRIPTION:Title: Can crypto help enhance democracy? (Part 3)\nby Vanessa Teague
(Thinking Cybersecurity and Australian National University) as part of SAC
2020 "Summer" School\n\n\nAbstract\nIn this workshop\, we will explore th
e world of voting technology. We will show you how cryptography can enhanc
e the verifiability of an election\, which is a challenge when a secret ba
llot needs to be obtained. We will discuss some real-world attempts at put
ting this type of cryptographic voting into practice. We will also discuss
ways it can go wrong—from subtle cryptographic oversights to broader fo
rms of cybersecurity attacks. Finally\, we will focus on the issue of inte
rnet voting: if you can bank online\, why can’t you vote online? It turn
s out there are a few good reasons.\n
LOCATION:https://researchseminars.org/talk/SAC2020-School/7/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Vanessa Teague (Thinking Cybersecurity and Australian National Uni
versity)
DTSTART:20201020T210000Z
DTEND:20201020T220000Z
DTSTAMP:20260315T021731Z
UID:SAC2020-School/8
DESCRIPTION:Title: Can crypto help enhance democracy? (Part 4)\nby Vanessa Teague
(Thinking Cybersecurity and Australian National University) as part of SAC
2020 "Summer" School\n\n\nAbstract\nIn this workshop\, we will explore th
e world of voting technology. We will show you how cryptography can enhanc
e the verifiability of an election\, which is a challenge when a secret ba
llot needs to be obtained. We will discuss some real-world attempts at put
ting this type of cryptographic voting into practice. We will also discuss
ways it can go wrong—from subtle cryptographic oversights to broader fo
rms of cybersecurity attacks. Finally\, we will focus on the issue of inte
rnet voting: if you can bank online\, why can’t you vote online? It turn
s out there are a few good reasons.\n
LOCATION:https://researchseminars.org/talk/SAC2020-School/8/
END:VEVENT
END:VCALENDAR