2016 - T1 - WS5 - Secrecy and privacy theme

Collection 2016 - T1 - WS5 - Secrecy and privacy theme

Organizer(s) Narayan, Prakash ; Roth, Aaron ; Sarwate, Anand ; Vaikuntanathan, Vinod ; Vadhan, Salil
Date(s) 21/03/2016 - 01/04/2016
linked URL https://web.archive.org/web/20221228152149/http://iss.bu.edu/bobak/csnexus//secrecy.html
00:00:00 / 00:00:00
40 41

I will present some new, nearly-optimal lower bounds on the amount of data required to release differentially private statistics on high-dimensional datasets, both in information-theoretic and computational settings. These results show that there is a significant “price of differential privacy” in high-dimensional datasets. We prove these lower bounds using two closely-related cryptographic primitives fingerprinting codes (in information theoretic setting) and traitor-tracing schemes (in the computational setting) that we show are closely connected to differentially private data analysis. I will also discuss how these lower bounds are related to realistic attacks on released datasets.

Information about the video

  • Date of recording 01/04/2016
  • Date of publication 14/04/2016
  • Institution IHP
  • Licence CC BY-NC-ND
  • Format MP4

Domain(s)

Last related questions on MathOverflow

You have to connect your Carmin.tv account with mathoverflow to add question

Ask a question on MathOverflow




Register

  • Bookmark videos
  • Add videos to see later &
    keep your browsing history
  • Comment with the scientific
    community
  • Get notification updates
    for your favorite subjects
Give feedback