The Algorithmic Foundations of
Data Privacy
Instructor: Aaron Roth
Administrivia
http:/www.cis.upenn.edu/~aaroth/courses/privacyF11.html
Time: Tuesday/Thursday 1:303:00
Room: Here (Towne 315)
Format:
Lectures
Student Presentations of Projects
Evalu
Answering Numeric Queries
The Laplace Distribution:
Lap() is the probability distribution with p.d.f.:
1

) =
exp
2
i.e. a symmetric exponential distribution
Lap ,
=
Pr =
Answering Numeric Queries:
The Laplace Mechanism
Laplace(, : , ):
1. Let = ()
Privacy of Numeric Queries Via
Simple Value Perturbation
The Laplace Mechanism
Differential Privacy
A Basic Model
Let represent an abstract data universe and
be a multiset of elements from .
i.e. can contain multiple copies of an element
.
Convenien
CIS 800/002 The Algorithmic Foundations of Data Privacy November cfw_22, 29, 2011
Lecture 20+21
Lecturer: Aaron Roth
Scribe: Aaron Roth
Dierential Privacy and Mechanism Design
In this lecture, well give a brief introduction to mechanism design, and see ho
CIS 800/002 The Algorithmic Foundations of Data Privacy
November 17, 2011
Lecture 19
Lecturer: Aaron Roth
Scribe: Aaron Roth
Streaming Algorithms: Continual Release
In this lecture we consider a dierent problem in the context of private streaming algorith
CIS 800/002 The Algorithmic Foundations of Data Privacy
November 15, 2011
Lecture 18
Lecturer: Aaron Roth
Scribe: Aaron Roth
Streaming Algorithms: User Level Pan Privacy
Suppose we want to compute some statistic on a gigantic stream of data, that we get t
CIS 800/002 The Algorithmic Foundations of Data Privacy
November 8, 2011
Lecture 16
Lecturer: Aaron Roth
Scribe: Aaron Roth
Private Combinatorial Optimization: Vertex Cover
In this class, we will see one more approximation algorithm, this time for the ver
CIS 800/002 The Algorithmic Foundations of Data Privacy
November 3, 2011
Lecture 15
Lecturer: Aaron Roth
Scribe: Aaron Roth
Private Combinatorial Optimization: Min Cut
We have now exhausted much of what I know about the problem of private query release, s
CIS 800/002 The Algorithmic Foundations of Data Privacy
November 1, 2011
Lecture 14
Lecturer: Aaron Roth
Scribe: Aaron Roth
Query Release and Agnostic Learning
In this lecture, we will observe a simple connection between query release and agnostic learnin
CIS 800/002 The Algorithmic Foundations of Data Privacy
October 27, 2011
Lecture 13
Lecturer: Aaron Roth
Scribe: Aaron Roth
Ecient Interactive Query Release Mechanisms
Recall that last time we gave a reduction from database update algorithms to query rele
CIS 800/002 The Algorithmic Foundations of Data Privacy
October 25, 2011
Lecture 12
Lecturer: Aaron Roth
Scribe: Aaron Roth
Interactive Query Release Mechanisms
In this lecture we will revisit the query release problem, and show how the iterative construc
CIS 800/002 The Algorithmic Foundations of Data Privacy
October 20, 2011
Lecture 11
Lecturer: Aaron Roth
Scribe: Aaron Roth
The Sparse Vector Technique
Were going to take a short break from the problem of private query release to develop another fundament
CIS 800/002 The Algorithmic Foundations of Data Privacy
October 13, 2011
Lecture 9
Lecturer: Aaron Roth
Scribe: Aaron Roth
Database Update Algorithms: Multiplicative Weights
Well recall (again) some denitions from last time:
Denition 1 (Database Update Se
CIS 800/002 The Algorithmic Foundations of Data Privacy
October 6, 2011
Lecture 8
Lecturer: Aaron Roth
Scribe: Aaron Roth
Database Update Algorithms: The Median Mechanism
Well recall some denitions from last time:
Denition 1 (Database Update Sequence) Let
CIS 800/002 The Algorithmic Foundations of Data Privacy
October 4, 2011
Lecture 7
Lecturer: Aaron Roth
Scribe: Aaron Roth
Iterative Database Construction
Weve seen The Net Mechanism, which shows that by using correlated noise, we can answer queries
with m
CIS 800/002 The Algorithmic Foundations of Data Privacy
September 29, 2011
Lecture 6
Lecturer: Aaron Roth
Scribe: Aaron Roth
The Net Mechanism: A Partial Converse
Finishing up from last time.
Last time we showed:
Theorem 1 (Net Mechanism Theorem) For any
CIS 800/002 The Algorithmic Foundations of Data Privacy
September 27, 2011
Lecture 5
Lecturer: Aaron Roth
Scribe: Aaron Roth
The Net Mechanism
In this lecture we consider the query release problem:
Given a collection of queries Q1 , . . . , Qk : NX  R,
CIS 800/002 The Algorithmic Foundations of Data Privacy
September 20, 2011
Lecture 4
Lecturer: Aaron Roth
Scribe: Aaron Roth
Composition Theorems
We now have two basic ways of accessing a database privately:
1. The Laplace Mechanism: For answering nonada