Видео ютуба по тегу Lattices_And_Applications

Efficient Verifiable Partially-Decryptable Commitments from Lattices and Applications

Efficient Verifiable Partially-Decryptable Commitments from Lattices and Applications
Winter School on Cryptography: Ideal Lattices and Applications - Vadim Lyubashevsky

Winter School on Cryptography: Ideal Lattices and Applications - Vadim Lyubashevsky
Sampling in Polynomial Lattices, and Applications

Sampling in Polynomial Lattices, and Applications
Lattice Signatures without Trapdoors.

Lattice Signatures without Trapdoors.
Building an Efficient Lattice Gadget Toolkit: Subgaussian Sampling and More

Building an Efficient Lattice Gadget Toolkit: Subgaussian Sampling and More
Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller

Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
FINAL: Faster FHE instantiated with NTRU and LWE

FINAL: Faster FHE instantiated with NTRU and LWE
Lattice Coding Theory 1.3

Lattice Coding Theory 1.3
Shorter Lattice-Based Zero-Knowledge Proofs via One-Time Commitments

Shorter Lattice-Based Zero-Knowledge Proofs via One-Time Commitments
Abstracting Gradual Typing

Abstracting Gradual Typing
The systematic normal form of lattices, and their algorithmic applications.

The systematic normal form of lattices, and their algorithmic applications.