1. Shuchi Chawla, Cynthia Dwork, Frank McSherry, Adam Smith, Larry Stockmeyer, Hoeteck Wee work done at Microsoft Research, SVC From Idiosyncratic to Stereotypical: Toward Privacy in Public Databases

2. Shuchi Chawla 2 Database Privacy  Census data – a prototypical example Individuals provide information Census bureau publishes sanitized records Privacy is legally mandated; what utility can we achieve?  Inherent Privacy vs Utility trade-off One extreme – complete privacy; no information Other extreme – complete information; no privacy  Goals: Find a middle path preserve macroscopic properties “disguise” individual identifying information Change the nature of discourse Establish framework for meaningful comparison of techniques

3. Shuchi Chawla 3 Current solutions  Statistical approaches Alter the frequency ( PRAN/DS/PERT ) of particular features, while preserving means. Additionally, erase values that reveal too much  Query-based approaches Perturb output or disallow queries that breach privacy  Unsatisfying Overly constrained definitions; ad-hoc techniques Ad-hoc treatment of external sources of info Erasure can disclose information; Refusal to answer may be revelatory

4. Shuchi Chawla 4 Our Approach  Crypto-flavored definitions Mathematical characterization of Adversary’s goal Precise definition of when sanitization procedure fails Intuition: seeing sanitized DB gives Adversary an “advantage”  Statistical Techniques Perturbation of attribute values Differs from previous work: perturbation amounts depend on local densities of points  Highly abstracted version of problem If we can’t understand this, we can’t understand real life. If we get negative results here, the world is in trouble.

5. Shuchi Chawla 5 An outline of this talk  A mathematical formalism What do we mean by privacy? An abstract model of datasets Isolation Good sanitizations  A candidate sanitization Privacy for the 2-point case General argument for privacy of n-point datasets A brief overview of results  Open issues; moving on to real-world applications

6. Shuchi Chawla 6 What do WE mean by privacy?  [Ruth Gavison] Protection from being brought to the attention of others inherently valuable attention invites further privacy loss  Privacy is assured to the extent that one blends in with the crowd  Appealing definition; can be converted into a precise mathematical statement…

7. Shuchi Chawla 7 A geometric view  Abstraction : Points in a high dimensional metric space – say R d ; drawn i.i.d. from some distribution Points are unlabeled; you are your collection of attributes Distance is everything points are similar if and only if they are close (L 2 norm)  Real Database (RDB) – private n unlabeled points in d-dimensional space.  Sanitized Database (SDB) – public n’ new points possibly in a different space.

8. Shuchi Chawla 8 The adversary or Isolator  Using SDB and auxiliary information (AUX), outputs a point q  q “isolates” a real point x, if it is much closer to x than to x’s neighbors. Even if q looks similar to x, it may fail to isolate x if it looks as similar to x’s neighbors as well. Tightly clustered points have a smaller radius of isolation RDB Non-isolating Isolating

9. Shuchi Chawla 9 (c-1)   I(SDB,AUX) = q  x is isolated if B(q,c  ) contains less than T points  T-radius of x – distance to its T-nearest neighbor  x is “safe” if  x > (T-radius of x)/(c-1) B(q,c  x ) contains x’s entire T-neighborhood c – privacy parameter; eg. 4 q x  cc The adversary or Isolator large T and small c is good

10. Shuchi Chawla 10 A good sanitization  No way of obtaining privacy if AUX already reveals too much!  Sanitizing algorithm compromises privacy if the adversary is able to increase his probability of isolating a point considerably by looking at its output  Definition of “considerably” can be forgiving, say, n -2  A rigorous definition  I  D  aux z  x  I’ | Pr[I(SDB,z) succeeds on x ] – Pr[I’(z) succeeds on x] | is small Provides a framework for describing the power of a sanitization method, and hence for comparisons

11. Shuchi Chawla 11 The Sanitizer  The privacy of x is linked to its T-radius  Randomly perturb it in proportion to its T-radius  x’ = San(x)  R B(x,T-rad(x)) T=1

12. Shuchi Chawla 12 The Sanitizer  The privacy of x is linked to its T-radius  Randomly perturb it in proportion to its T-radius  x’ = San(x)  R B(x,T-rad(x))  Intuition: We are blending x in with its crowd If the number of dimensions (d) is large, there are “many” pre-images for x’. The adversary cannot conclusively pick any one. We are adding random noise with mean zero to x, so several macroscopic properties should be preserved.

13. Shuchi Chawla 13 Flavor of Results (Preliminary)  Assumptions Data arises from a mixture of Gaussians dimensions d, num of points n are large; d =  (log n)  Results Privacy: An adversary who knows the Gaussians and some auxiliary information cannot isolate any point with probability more than 2 -  (d) (Several special cases; General result not yet proved) Utility: An honest user who does not know the Gaussians, can compute the means with a high probability

14. Shuchi Chawla 14 The “simplest” interesting case  RDB = {x, y} x, y 2 R B(o,  ) where o – “origin”  T=1; c=4; SDB = { x’, y’ }  The adversary knows x’, y’,  and  = |x-y|  We show: There are m=2  (d) “decoy” pairs (x i,y i ) (x i,y i ) are legal pre-images of (x’,y’) that is, |x i -y i |=  and Pr[ x i,y i | x’,y’ ] = Pr[ x,y | x’,y’ ] Adversary cannot know which of the (x i, y i ) represents reality The adversary can only isolate one point in {x 1,y 1, … x m, y m } at a time

15. Shuchi Chawla 15 The “simplest” interesting case  Consider a hyperplane H through x’, y’ and o  x H, y H – mirror reflections of x, y through H Note: reflections preserve distances!  The world of x H, y H looks identical to the world of x, y x y y’ x’ xHxH yHyH Pr[ x H,y H | x’,y’ ] = Pr[ x,y | x’,y’ ] H

16. Shuchi Chawla 16 The “simplest” interesting case  Consider a hyperplane H through x’, y’ and o  x H, y H – mirror reflections of x, y through H Note: reflections preserve distances!  The world of x H, y H looks identical to the world of x, y  How many different H such that the corresponding x H are pairwise distant? 2r sin  r 22 Sufficient to pick r= 2/3  and  = 30° Fact: There are 2  (d) vectors in d-dim, at angle 60° from each other.  Probability that adversary wins ≤ 2 -  (d) x x1x1 x2x2 = 2/3  r

17. Shuchi Chawla 17 The general case… n points  The adversary is given n-1 real points x 2,…,x n and one sanitized point x’ 1 ; T = 1; flat prior  Reflections do not work – too many constraints  A more direct argument – examine posterior distribution on x 1  Let Z = { p  R d | p is a legal pre-image for x’ 1 } Q = { p | if x 1 =p then x 1 is isolated by q }  We show that Pr[ Q ∩ Z | x’ 1 ] ≤ 2 -  (d) Pr[ Z | x’ 1 ] Pr[x 1 in Q ∩ Z | x’ 1 ] = prob mass contribution from Q ∩ Z / contribution from Z = 2 1-d /(1/4)

18. Shuchi Chawla 18 Q The general case… n points Z = { p | p is a legal pre-image for x’ 1 } Q = { p | x 1 =p is isolated by q } q x’ x2x2 x3x3 x4x4 x5x5 Z Key observation: As |q-x’| increases, Q becomes larger. But, larger distance from x’ implies smaller probability mass, because x is randomized over a larger area Q∩ZQ∩Z x6x6 Probability depends only on the solid angle subtended at x’

19. Shuchi Chawla 19 The general case… n sanitized points  Privacy does not follow immediately from the previous analysis with real points!  Problem: Sanitization is non-oblivious Other sanitized points reveal information about x, if x is their nearest neighbor  Solution: Decouple the two kinds of information – from x’ and x’ i L R

20. Shuchi Chawla 20 The general case… n sanitized points  Claim 1 (Privacy for L): Given all sanitizations, all points in R, and all but one point in L, adversary cannot isolate last point Follows from the proof for n-1 real points  Claim 2 (Privacy for R): Given all sanitizations, all points in L and all but one point in R, adversary cannot isolate last point Work under progress L R Idea: Show that the adversary cannot distinguish between whether R contains some point x or not. (Information-theoretic argument)

21. Shuchi Chawla 21 Results on privacy.. An overview DistributionNum. of points Revealed to adversary Auxiliary information Uniform on surface of sphere 2Both sanitized pointsDistribution, 1-radius Uniform over a bounding box or surface of sphere nOne sanitized point, all other real points Distribution Uniform over a bounding box nn/2 sanitized pointsDistribution, all but one real points

22. Shuchi Chawla 22 Results on utility… An overview Distributional/ Worst-case ObjectiveAssumptionsResult Worst-caseFind K clusters minimizing largest diameter - Optimal diameter as well as approximations increase by at most a factor of 3 DistributionalFind k maximum likelihood clusters Mixture of k Gaussians Correct clustering with high probability as long as means are pairwise sufficiently far Skip

23. Shuchi Chawla 23 Learning mixtures of Gaussians (Spectral methods)  Observation: Top eigenvectors of a matrix span a low- dimensional space that yields a good approximation of complex data sets, in particular Gaussian data.  Intuition Sampled points are “close” to means of the corresponding Gaussians in any subspace Span of top k singular vectors approximates span of the means Distances between means of Gaussians are preserved Other distances shrink by a factor of √ (k/n)  Our goal: show that the same algorithm works for clustering sanitized data.

24. Shuchi Chawla 24 Spectral techniques for perturbed data  A sanitized point is the sum of two Gaussian variables – sample + noise  w.h.p. the 1-radius of a point is less than the “radius” of its Gaussian  Variance of the noise is small  Sanitized points are still close to their means (uses independence of direction)  Span of top k singular vectors still approximates the span of means of Gaussians  Distances between means are preserved; others shrink

25. Shuchi Chawla 25 Future directions  Extend the privacy argument to other “nice” distributions Can revealing the distribution hurt privacy?  Characterize the kind of auxiliary information that is acceptable Depends on the distribution on the datapoints  The low-dimensional case Is it inherently impossible? Dinur & Nissim show impossibility for the 1-dimensional case  Extend the utility argument to other interesting macroscopic properties

26. Shuchi Chawla 26 What about the real world?  Lessons from the abstract model High dimensionality is our friend Gaussian/spherically symmetric perturbations seem to be the right thing to do Need to scale different attributes appropriately, so that data is well rounded  Moving towards real data Outliers – Our notion of c-isolation deals with them - Existence of outlier may be disclosed Discrete attributes – Convert them into real-valued attributes - e.g. Convert a binary variable into a probability

27. Shuchi Chawla 27 Questions?

28. Shuchi Chawla 28 So far…  A rigorous definition of privacy  Candidate sanitization procedure that displays resistance to breach of privacy preserves utility to a large extent  Rest of this talk… open issues and food for thought The low-dimensional case Inherently “bad” distributions Privacy and Kernel Density Estimation Lessons learnt from the abstract case

29. Shuchi Chawla 29 The low-dimensional case  High-dimensional data  more randomness in perturbation  Crucial to our approach of showing “many possible pre-images”  Supporting evidence – Dinur-Nissim lower bound on one-dimensional data  Likewise, we require data to be well-rounded Preprocess data to increase spread in all dimensions

30. Shuchi Chawla 30 Inherently “bad” distributions  Can knowing the distribution hurt privacy?  Utility implies knowledge of the distribution

31. Shuchi Chawla 31  The low-dimensional case seems problematic because there’s very little randomness is there an inherent difficulty? Same problem with data lying in a low dimensional manifold we should first preprocess it so that it becomes well rounded. but what we are really doing is to add noise in proportion to the spread in each dimension

32. Shuchi Chawla 32  can we even achieve privacy and utility simultaneously?  what if the distribution lets you isolate a point  what kind of AUX can we handle?  if AUX + D => isolation, then we cannot sanitize D and allow AUX because sanitization may reveal D while AUX does not contain it. So modify the definition to say that Pr[I(SDB,AUX)=1]-Pr[I’(D,AUX, utility)=1]=negligible

33. Shuchi Chawla 33  outliers

34. Shuchi Chawla 34  kernel density estimation?  our goal is similar to kde because we also reconstruct the distribution and sample from it. if we could show this sampling did not depend on the actual points, we would be done

35. Shuchi Chawla 35 A good sanitization: candidate definition   Aux  D  I  I ’ ( RDB  R D ) Pr[ I( SDB, Aux ) ] – Pr[ I ’ ( Aux ) ] ≤ 1/poly(n)  Probability is over the choices of the sanitizing algorithm, and random process that picks RDB.  May need to restrict Aux somewhat.

36. Shuchi Chawla 36 Some notation  Points in RDB – x 1,x 2,…  Points in SDB – x’ 1,x’ 2,…  Adversary’s guess – q  T-radius of x –  x  We use T=1; c=4 i.e. We perturb points randomly to within their 1-radius The isolating adversary must get closer to a point x than its distance to its nearest neighbor. i.e. |q-x| ≤  x /3

37. Shuchi Chawla 37 The general case… n points  The adversary is given n-1 real points x 2,…,x n and one sanitized point x’ 1  Reflections do not work – too many constraints  A more direct argument – examine posterior distribution on x 1  Show that for any point q, the total probability mass of points isolated by q is exponentially small

38. Shuchi Chawla 38 Results on privacy.. An overview DistributionNum. of points Revealed to adversary Auxiliary information Uniform on surface of sphere 2Both sanitized pointsDistribution, 1-radius Uniform over a bounding box or surface of sphere nOne sanitized point, all other real points Distribution Uniform over a bounding box nn/2 sanitized pointsDistribution, all but one real points

39. Shuchi Chawla 39 The rest of this talk…  A geometric view; Isolation  Our contributions The sanitizing algorithm Proof sketch for privacy – n=2 Extending the proof to larger n Results on utility  Future directions

40. Shuchi Chawla 40 The general case… n sanitized points  Privacy does not follow immediately from the previous analysis with real points!  Problem: Sanitization is non-oblivious Other sanitized points reveal information about x, if x is their nearest neighbor  Idea: Decouple the two kinds of information – from x’ and x’ i