
Crypto and Privacy
On Distributed Differential Privacy and Counting Distinct Elements
Lijie Chen (MIT), Badih Ghazi (Google), Ravi Kumar (Google), Pasin Manurangsi (Google)
On Basing Auxiliary-Input Cryptography on NP-hardness via Nonadaptive Black-Box Reductions
Mikito Nanashima (Tokyo Institute of Technology)
Query complexity lower bounds for local list-decoding and hard-core predicates (even for small rate and huge lists)
Noga Ron-Zewi (University of Haifa), Ronen Shaltiel (University of Haifa), Nithin Varma (University of Haifa)
Lower Bounds for Off-Chain Protocols: Exploring the Limits of Plasma
Stefan Dziembowski (University of Warsaw), Grzegorz Fabiański (University of Warsaw), Sebastian Faust (TU Darmstadt), Siavash Riahi (TU Darmstadt)
Black-Box Uselessness: Composing Separations in Cryptography
Geoffroy Couteau (CNRS & IRIF), Pooya Farshim (University of York), Mohammad Mahmoody (University of Virginia)
ITCS 2021
Other Videos By Simons Institute for the Theory of Computing
2021-01-10 | Graph algorithms |
2021-01-10 | Algorithms |
2021-01-10 | GRADUATING BITS |
2021-01-10 | Algorithmic game theory |
2021-01-10 | Quantum information |
2021-01-10 | Quantum |
2021-01-09 | Analytic methods |
2021-01-09 | Computational complexity |
2021-01-08 | Distributed models |
2021-01-08 | Pseudorandomness |
2021-01-08 | Crypto and Privacy |
2021-01-08 | Matchings |
2021-01-08 | Introductory Remarks |
2020-12-28 | David Harold Blackwell Summer Research Institute | Interview with Jelani Nelson |
2020-12-19 | Recent Developments in Supervised Learning With Noise |
2020-12-19 | Testing and Reconstruction via Decision Trees |
2020-12-18 | An Equivalence Between Private Classification and Online Prediction |
2020-12-18 | Small Covers for Near-Zero Sets of Polynomials and Learning Latent Variable Models |
2020-12-18 | Hardness of Identity Testing for Potts models and RBMs |
2020-12-18 | Near-Optimal Learning of Tree-Structured Distributions by Chow-Liu |
2020-12-17 | Learning Some Ill-Conditioned Gaussian Graphical Models |