Noisy Connections: A Survey of Interactive Coding and Its Borders with Other Topics

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


Duration: 1:08:48
365 views
4

Allison Bishop, Columbia University
The Mathematics of Modern Cryptography
http://simons.berkeley.edu/talks/allison-bishop-2015-07-09



Other Videos By Simons Institute for the Theory of Computing


2015-08-31On Algorithmic Game Theory II
2015-08-31Scarf's Lemma and Applications II
2015-08-31On Algorithmic Game Theory I
2015-08-31Scarf's Lemma and Applications I
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-15Noisy Connections: A Survey of Interactive Coding and Its Borders with Other Topics
2015-07-15Homomorphic Commitments & Signatures
2015-07-15Attribute-based and Predicate Encryption
2015-07-15Cryptography from Ideal Lattices
2015-07-15Output-Compressing Randomized Encodings and Applications
2015-07-15Cryptography via Burnside Groups
2015-07-15Multilinear Maps Over the Integers: From Design to Security
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


Tags:
Simons Institute
UC Berkeley
computer science
theory of computing
Cryptography
Allison Bishop