MPC with Silent Preprocessing via Pseuodorandom Correlation Generators

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


Duration: 1:00:59
566 views
3

Lisa Kohl (Technion)
https://simons.berkeley.edu/talks/mpc-silent-preprocessing-pseuodorandom-correlation-generators
Lattices: New Cryptographic Capabilities



Other Videos By Simons Institute for the Theory of Computing


2020-04-01Quantum PCPs Meet Derandomization
2020-03-31MIP* = RE Part 1: The Quantum Low-Degree Test
2020-03-31Self-Testing as an Approach to Certifying Quantum Systems
2020-03-31Non-Local Binary Games With Noisy Epr States Are Decidable
2020-03-30Computational Pseudorandomness and Constraints on the Ads/Cft Duality
2020-03-30Predicting Many Properties of a Quantum System from Very Few Measurements
2020-03-30A General Introduction to Quantum Tomography -- and a Specialized Report on Property Testing...
2020-03-30Learning Many-Body Quantum Systems From Local Measurements
2020-03-27Quantum Money based on Lattices
2020-03-27Quantum FHE
2020-03-26MPC with Silent Preprocessing via Pseuodorandom Correlation Generators
2020-03-26Multi-key FHE and Spooky Encryption
2020-03-26Hardness of LWE on General Entropic Distributions
2020-03-25Mixed Functional Encryption: Applications to Traitor Tracing
2020-03-25Lockable Obfuscation
2020-03-25Cryptanalysis of Candidate Program Obfuscators
2020-03-24Obfuscation III
2020-03-24Obfuscation IV: A New Assumption enabling iO
2020-03-24Recent Advances on Foundations of Program Obfuscation
2020-03-24Obfuscation from Noisy Linear FE
2020-03-23Homomorphic Signatures and Pre-Processing NIZK


Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Lattices: New Cryptographic Capabilities
Lisa Kohl