Главная
Study mode:
on
1
Introduction
2
Lattice Problems
3
Hardness
4
Why polynomial rings
5
Popular polynomial rings
6
Algebraic structure
7
Fully homomorphic encryption
8
A word of caution
9
Zeroknowledge
10
snore protocol
11
extractor protocol
12
noise drowning
13
rejection sampling
14
extraction
15
roadmap
16
Proof of Knowledge
Description:
Explore the foundations and applications of lattice-based cryptography in this comprehensive lecture. Delve into lattice problems, hardness, and the significance of polynomial rings in cryptographic systems. Examine popular polynomial rings and their algebraic structures, with a focus on fully homomorphic encryption. Gain insights into zero-knowledge protocols, including Schnorr protocols, extractor protocols, and noise drowning techniques. Learn about rejection sampling, extraction methods, and the concept of Proof of Knowledge. Discover how these theoretical concepts translate into practical applications in modern cryptography.

Signatures, Commitments, Zero-Knowledge, and Applications

Simons Institute
Add to list
0:00 / 0:00