Hardness of the Shortest Vector Problem: A Simplified Proof and a Survey

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


Duration: 1:06:20
1,117 views
15

Huck Bennett (Oregon State University)
https://simons.berkeley.edu/talks/hardness-shortest-vector-problem-new-proof-and-retrospective
Quantum and Lattices Joint Reunion Workshop



Other Videos By Simons Institute for the Theory of Computing


2022-06-28Goals And Interpretable Variables In Neuroscience
2022-06-18Continuous LWE is as Hard as LWE
2022-06-18Batch Arguments for NP and SNARGs for P from LWE
2022-06-18Lattice-based Zero-knowledge Proofs
2022-06-18Candidate Witness Encryption from Lattice Techniques
2022-06-17Optimal Broadcast Encryption and More from Evasive LWE
2022-06-17Single-Server Private Information Retrieval with Sublinear Amortized Time
2022-06-17Doubly Efficient Private Information Retrieval
2022-06-17Some Recent Results Showing that Lattice Problems Are (sort of) Equivalent in All Norms
2022-06-17Bourgain’s Slicing Problem and KLS Isoperimetry up to Polylog
2022-06-16Hardness of the Shortest Vector Problem: A Simplified Proof and a Survey
2022-06-16Quantum Rewinding Tutorial, Part 3: Zero Knowledge Simulation Beyond Watrous
2022-06-16Quantum Rewinding Tutorial, Part 2: How to Run a Quantum Attacker Many Times
2022-06-15Quantum Rewinding Tutorial, Part 1: Motivation and Early Rewinding Techniques
2022-06-15Quantum Benchmarking
2022-06-15New Quantum Cryptographic Primitives II
2022-06-15New Quantum Cryptographic Primitives I
2022-06-14Learning from Quantum Experiments
2022-06-14Quantum Linear Algebra Using Subspace States
2022-06-14Dequantizing the Quantum Singular Value Transform
2022-06-14The Hidden Subgroup Problem for Infinite Groups


Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Quantum and Lattices Joint Reunion Workshop
Huck Bennett