Graph-Induced Multilinear Maps from Lattices
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=JgVOIKhG2XA
Shai Halevi, IBM T.J. Watson Research Center
The Mathematics of Modern Cryptography
http://simons.berkeley.edu/talks/shai-halevi-2015-07-10
Other Videos By Simons Institute for the Theory of Computing
2015-08-31 | On Algorithmic Game Theory II |
2015-08-31 | Scarf's Lemma and Applications II |
2015-08-31 | On Algorithmic Game Theory I |
2015-08-31 | Scarf's Lemma and Applications I |
2015-08-31 | Near-Optimal Equilibria II |
2015-08-13 | Data Structures and Cryptography: from UOWHFs to PSRs |
2015-08-13 | 20 years of PIR |
2015-08-06 | Hash Proof Systems, Old and New |
2015-08-05 | Non-Malleable Cryptography |
2015-07-15 | Arithmetic Cryptography |
2015-07-15 | Graph-Induced Multilinear Maps from Lattices |
2015-07-15 | Homomorphic Commitments & Signatures |
2015-07-15 | Attribute-based and Predicate Encryption |
2015-07-15 | Cryptography from Ideal Lattices |
2015-07-15 | Output-Compressing Randomized Encodings and Applications |
2015-07-15 | Cryptography via Burnside Groups |
2015-07-15 | Multilinear Maps Over the Integers: From Design to Security |
2015-07-15 | Attribute-based Encryption for Circuits |
2015-07-15 | Fully Homomorphic Encryption |
2015-07-15 | How Diffie-Hellman Fails in Practice |
2015-07-15 | Finding Short Generators of Principal Ideals |
Tags:
Simons Institute
UC Berkeley
computer science
theory of computing
Cryptography
Shai Halevi