The Short Integer Solutions Problem and Cryptographic Applications

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


Duration: 1:31:41
3,774 views
41

Daniele Micciancio (UC San Diego)

Lattices: Algorithms, Complexity, and Cryptography Boot Camp
https://simons.berkeley.edu/talks/sis-worst-case-average-case-reductions-and-minicrypt



Other Videos By Simons Institute for the Theory of Computing


2020-01-24Lattices, Multilinear Maps and Program Obfuscation
2020-01-24How to Use Lattice Trapdoors: IBE, ABE and More
2020-01-24Lattice Trapdoors
2020-01-24Lattices and Encrypted Computation
2020-01-23Lattices and the NIST PQ-crypto Standardization Process
2020-01-23Using Lattices for Cryptanalysis
2020-01-23Algorithms for Lattice Problems, in Practice
2020-01-23Algorithms for Algebraic Lattices: Classical and Quantum
2020-01-22Algebraic Lattices and Ring Learning with Errors
2020-01-22The Learning With Errors Problem and Cryptographic Applications
2020-01-22The Short Integer Solutions Problem and Cryptographic Applications
2020-01-21Complexity of Lattice Problems
2020-01-21Algorithms for Lattice Problems
2020-01-21Mathematics of Lattices
2019-12-11Artificial Stupidity: The New AI and the Future of Fintech
2019-12-03Average-Case Complexity through the Lens of Interactive Arguments
2019-11-22Zexe: Enabling Decentralized Private Computation
2019-11-22BDoS: Blockchain Denial of Service
2019-11-22Regulatory Incentives Towards Decentralization
2019-11-21Blockchains and Publicly-Verifiable Lotteries
2019-11-21Blockchain Intermediation


Tags:
Simons Institute
Theory of Computing
Theory of Computation
Theoretical Computer Science
Computer Science
UC Berkeley
Daniele Micciancio
Lattices: Algorithms
Complexity
and Cryptography Boot Camp