Cryptography via Burnside Groups

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


Duration: 1:09:46
362 views
2

Nelly Fazio, City University of New York
Antonio Nicolosi, Stevens Institute of Technology
The Mathematics of Modern Cryptography
http://simons.berkeley.edu/talks/antonio-nicolosi-nelly-fazio-2015-07-10



Other Videos By Simons Institute for the Theory of Computing


2015-08-31Near-Optimal Equilibria II
2015-08-13Data Structures and Cryptography: from UOWHFs to PSRs
2015-08-1320 years of PIR
2015-08-06Hash Proof Systems, Old and New
2015-08-05Non-Malleable Cryptography
2015-07-15Arithmetic Cryptography
2015-07-15Graph-Induced Multilinear Maps from Lattices
2015-07-15Lattices with Symmetry
2015-07-15Noisy Connections: A Survey of Interactive Coding and Its Borders with Other Topics
2015-07-15Non-Malleable Codes in the Split-State Model
2015-07-15Cryptography via Burnside Groups
2015-07-15Attribute-based Encryption for Circuits
2015-07-15Fully Homomorphic Encryption
2015-07-15How Diffie-Hellman Fails in Practice
2015-07-15Finding Short Generators of Principal Ideals
2015-07-15Algebraic Algorithms for LWE
2015-07-15Attacks on Ring-LWE
2015-07-15Historical Talk on Lattice-Based Cryptography
2015-07-15Solving SVP and CVP in 2^n time with Discrete Gaussian Sampling
2015-07-15Time-Lock Puzzles from Randomized Encodings
2015-07-15Solving SVP and CVP in 2^n time with Discrete Gaussian Sampling


Tags:
Simons Institute
UC Berkeley
computer science
theory of computing
Cryptography
Nelly Fazio
Antonio Nicolosi