Data Privacy | Polylogues

Data Privacy | Polylogues

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


Category:
Vlog
Duration: 57:30
586 views
25

Privacy is vitally important to a free society. But experts don’t always even agree on how to define it, let alone why it matters so much. In this episode of Polylogues, computer scientist Adam Smith, statistician Frauke Kreuter, and philosopher Helen Nissenbaum discuss how their disciplines approach one of the central technosocial issues of our time, and their own work to protect privacy in the digital age, in a conversation hosted by Science Communicator in Residence Konstantin Kakaes.

Interviews recorded in Spring 2019, during the Simons Institute research program on Data Privacy: Foundations and Applications.

© Simons Institute for the Theory of Computing, 2021



Other Videos By Simons Institute for the Theory of Computing


2021-05-06Using Program Synthesis to Build Compilers
2021-05-05Preprocessing SAT, MaxSAT, and QBF 3
2021-05-05Preprocessing SAT, MaxSAT, and QBF 2
2021-05-05Preprocessing SAT, MaxSAT, and QBF 1
2021-05-05Panel Discussion on The Role of Proofs in MIP* = RE | Quantum Colloquium
2021-05-05The Role of Proofs in MIP* = RE | Quantum Colloquium
2021-05-04Towards ML for Quantification in SMT
2021-05-03Data-Driven Synthesis of a Provably Sound Side-Channel Analysis
2021-05-03Synthesizing Network Configuration Updates
2021-04-30Computational Aspects of Equilibria and Fixed Points
2021-04-30Data Privacy | Polylogues
2021-04-29Symmetric Properties and Boolean Complexity
2021-04-29Constraint Satisfaction and Expansion
2021-04-29Theoretically Speaking — Market Design through the Lens of Approximation
2021-04-28Learning to Solve SMT Formulas
2021-04-28Extensions of CDCL Branching Heuristics by Exploration during Conflict Depression
2021-04-28Learning to Schedule Heuristics in Branch and Bound
2021-04-28Predicting Satisfiability at the Phase Transition via End-to-End Learning
2021-04-28Can the PvsNP Question Be Independent of the Axioms of Mathematical Reasoning?
2021-04-28TAUT, TFNP and SAT
2021-04-28P, NP and Proof Complexity


Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing