Lattices, Post-Quantum Security and Homomorphic Encryption

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


Duration: 58:53
1,159 views
21

Daniele Micciancio (UC San Diego)
Richard M. Karp Distinguished Lecture Series, Spring 2020
https://simons.berkeley.edu/events/rmklectures2020-spring-2

Modern cryptography relies on mathematical problems that are computationally hard to solve, and exploits their hardness to build secure applications that are equally hard to break. During the last two decades, mathematical problems on point lattices have emerged as a very attractive class of problems to build new and powerful cryptographic functions. The talk will provide an overview of lattice-based cryptography, its roots in theoretical computer science, and some of its most distinctive features: resistance against powerful quantum adversaries, and the ability carry out computations on encrypted data.



Other Videos By Simons Institute for the Theory of Computing


2020-04-23Laconic Function Evaluation
2020-04-20A Tale of Turing Machines, Quantum-Entangled Particles, and Operator Algebras
2020-04-15Robust Polynomial Method and a Sub-Volume Law for Locally Gapped Frustration-Free Spin Systems
2020-04-13Optimal Broadcast Encryption from Pairings and LWE
2020-04-09Secure Multi-party Quantum Computation with a Dishonest Majority
2020-04-09Quantum Speedup for Graph Sparsification, Cut Approximation and Laplacian Solving
2020-04-08NIZK from LPN and Trapdoor Hash via Correlation Intractability for Approximable Relations
2020-04-08Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography
2020-04-07The Digital Fence: Taiwan’s Response to COVID-19
2020-04-06Lattices, Post-Quantum Security and Homomorphic Encryption — Q&A
2020-04-06Lattices, Post-Quantum Security and Homomorphic Encryption
2020-04-03What Do Algorithmic Fairness and COVID-19 Case-Severity Prediction Have in Common?
2020-04-02Efficient Learning of Pauli Channels
2020-04-02Not All Benchmarks Are Created Equal
2020-04-02Cycle Benchmarking: The New Paradigm for Assessing All Relevant Errors and Error Correlations...
2020-04-02Cross-Platform Verification of Intermediate Scale Quantum Devices with Randomized Measurements
2020-04-01MIP* = RE: Putting Everything Together
2020-04-01MIP* = RE Part 2: PCPs and Introspection
2020-04-01The Algebraic Side of MIP* = RE
2020-04-01Quantum PCPs Meet Derandomization
2020-03-31MIP* = RE Part 1: The Quantum Low-Degree Test


Tags:
Simons Institute
Theory of Computing
Theory of Computation
Theoretical Computer Science
Computer Science
UC Berkeley
Daniele Micciancio
Richard M. Karp Distinguished Lecture Series