Quantum Secure Commitments and Collapsing Hash Functions

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


Duration: 1:10:12
626 views
8

Fermi Ma (Princeton University)
Lattices: Algorithms, Complexity, and Cryptography
Quantum Cryptography for Dummies



Other Videos By Simons Institute for the Theory of Computing


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
2020-04-23Post-Quantum Multi-Party Computation in Constant Rounds
2020-04-23Quantum Coupon Collector
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


Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing