- PAC Privacy: Automatic Priv...
- Edit Event
- Cancel Event
- Preview Reminder
- Send Reminder
- Other events happening in September 2023
PAC Privacy: Automatic Privacy Measurement and Control of Data Processing
Speaker:
Hanshen Xiao
, CSAIL MIT
Date: Friday, September 29, 2023
Time: 10:30 AM to 12:00 PM Note: all times are in the Eastern Time Zone
Public: Yes
Location: G-882, Hewlett Room
Event Type: Seminar
Room Description:
Host: Vinod Vaikuntanathan , CSAIL & EECS
Contact: Felicia Raton, fraton@csail.mit.edu
Relevant URL:
Speaker URL: None
Speaker Photo:
None
Reminders to:
cis-seminars@csail.mit.edu, seminars@lists.csail.mit.edu
Reminder Subject:
TALK: PAC Privacy: Automatic Privacy Measurement and Control of Data Processing
In this talk, I will introduce a new privacy definition, termed Probably Approximately Correct (PAC) Privacy. PAC Privacy characterizes the information-theoretic hardness to recover sensitive data given arbitrary information disclosure/leakage during/after any processing. Unlike the classic cryptographic definition and Differential Privacy (DP), which consider the adversarial (input-independent) worst case, PAC Privacy is a simulatable metric that quantifies the instance-based impossibility of inference. A fully automatic analysis and proof generation framework are proposed: security parameters can be produced with arbitrarily high confidence via Monte-Carlo simulation for any black-box data processing oracle. This appealing automation property enables analysis of complicated data processing, where the worst-case proof in the classic privacy regime could be loose or even intractable. Moreover, we show that the produced PAC Privacy guarantees enjoy simple composition bounds and the automatic analysis framework can be implemented in an online fashion to analyze the composite PAC Privacy loss even under correlated randomness. On the utility side, the magnitude of (necessary) perturbation required in PAC Privacy is not lower bounded by Theta(\sqrt{d}) for a d-dimensional release but could be O(1) for many practical data processing tasks, which is in contrast to the input-independent worst-case information-theoretic lower bound. I will also talk about practical applications to complicated data processing, including end-to-end privacy analysis of deep learning and clustering.
Research Areas:
Impact Areas:
Created by Megan F Farmer at Sunday, September 24, 2023 at 4:32 PM.