Sampling in Polynomial Lattices, and Applications

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=gb7Usu0WAA0


Duration: 1:06:29
878 views
18

Thomas Prest, PQ Shield
https://simons.berkeley.edu/talks/sampling-ntru-lattices
Lattices: From Theory to Practice



Other Videos By Simons Institute for the Theory of Computing


2020-05-01Amortized FHEW Bootstrapping
2020-05-01FHE and Private Set Intersection
2020-05-01Homomorphic Encryption in the SPDZ Protocol for MPC
2020-05-01Practical Lattice-based Cryptography in PALISADE
2020-04-30Practical Applications of Homomorphic Encryption
2020-04-30The iDASH Competition
2020-04-30The CKKS (a.k.a. HEAAN) FHE Scheme
2020-04-30Introduction to Practical FHE and the TFHE Scheme
2020-04-29The Mod-NTRU Problem and Applications
2020-04-29Generating NTRU trapdoors
2020-04-29Sampling in Polynomial Lattices, and Applications
2020-04-28Perception as Inference: The Brain and Computation | Theory Shorts
2020-04-28Fiat-Shamir in the QROM
2020-04-28CCA encryption in the QROM II
2020-04-28CCA encryption in the QROM I
2020-04-28LWE with Side Information: Attacks and Concrete Security Estimation
2020-04-27Quantum Secure Commitments and Collapsing Hash Functions
2020-04-27Quantum Cryptography (Beyond QKD)
2020-04-27Watermarking and Traitor Tracing for PRFs
2020-04-27New Techniques for Practical Lattice-Based Zero-Knowledge
2020-04-27Signatures, Commitments, Zero-Knowledge, and Applications


Tags:
Simons Institute
Theory of Computing
Theory of Computation
Theoretical Computer Science
Computer Science
UC Berkeley
Lattices: From Theory to Practice
Thomas Prest