Fandom

Psychology Wiki

Differential privacy

34,202pages on
this wiki
Add New Page
Talk0 Share

Ad blocker interference detected!


Wikia is a free-to-use site that makes money from advertising. We have a modified experience for viewers using ad blockers

Wikia is not accessible if you’ve made further modifications. Remove the custom ad blocker rule(s) and the page will load as expected.

Assessment | Biopsychology | Comparative | Cognitive | Developmental | Language | Individual differences | Personality | Philosophy | Social |
Methods | Statistics | Clinical | Educational | Industrial | Professional items | World psychology |

Statistics: Scientific method · Research methods · Experimental design · Undergraduate statistics courses · Statistical tests · Game theory · Decision theory


Differential privacy aims to provide means to maximize the accuracy of queries from statistical databases while minimizing the chances of identifying its records.

Situation Edit

Consider a trusted party that holds a dataset of sensitive information (e.g. medical records, voter registration information, email usage) with the goal of providing global, statistical information about the data publicly available, while preserving the privacy of the users whose information the data set contains. Such a system is called a statistical database. The notion of indistinguishability,[1] later termed Differential Privacy,[2] formalizes the notion of "privacy" in statistical databases.

ε-differential privacy Edit

The actions of the trusted server are modeled via a randomized algorithm \mathcal{A}\,\!. A randomized algorithm \mathcal{A}\,\! is \epsilon\,\!-differentially private if for all datasets D_{1}\,\! and D_{2}\,\! that differ on a single element (i.e., data of one person), and all S\subseteq \mathrm{Range}(\mathcal{A})\,\!,

\Pr[\mathcal{A}(D_{1})\in S]\leq
e^{\epsilon}\times\Pr[\mathcal{A}(D_{2})\in S]\,\!

where the probability is taken over the coins of the algorithm and \mathrm{Range}(\mathcal{A})\,\! denotes the output range of the algorithm \mathcal{A}\,\!.

N.B.: Differential Privacy is a condition on the release mechanism and not on the dataset.

This means that for any two datasets which are close to one another (that is, which differ on a single element) a given differentially private algorithm \mathcal{A}\,\! will behave approximately the same on both data sets. The definition gives a strong guarantee that presence or absence of an individual will not affect the final output of the query significantly.

For example, assume we have a database of medical records D_{1}\,\! where each record is a pair (Name,X), where X\in\{0,1\}\,\! denotes whether a person has diabetes or not. For example:

Name Has Diabetes (X)
Ross 1
Monica 1
Joey 0
Phoebe 0
Chandler 1

Now suppose a malicious user (often termed an adversary) wants to find whether Chandler has diabetes or not. As a side information he knows in which row of the database Chandler resides. Now suppose the adversary is only allowed to use a particular form of query Q(i)\,\! which returns the partial sum of first i\,\! rows of column X\,\! in the database. In order to find Chandler's diabetes status the adversary simply executes Q(5)-Q(4)\,\!. One striking feature this example highlights is: individual information can be compromised even without explicitly querying for the specific individual information.

Let us take this example a little further. Now we construct D_{2}\,\! by replacing (Chandler,1) with (Chandler,0). Let us call the release mechanism (which releases the output of Q(i)\,\!) as \mathcal{A}\,\!. We say \mathcal{A}\,\! is \epsilon\,\!-differentially private if it satisfies the definition, where S\,\! can be thought of as a singleton set (something like \{3.5\},\{4\}\,\! etc.) if the output function of \mathcal{A}\,\! is a Discrete Random Variable (i.e. has a probability mass function (pmf)); else if it is a Continuous Random Variable (i.e. has a probability density function (pdf)), then S\,\! can be thought to be a small range of reals (something like 3.5\leq\mathcal{A}(D_{1})\leq3.7\,\!).

In essence if such an \mathcal{A}\,\! exist then a particular individual's presence or absence in the database will not alter the distribution of the output of the query by a significant amount and thus assures privacy of individual information in an information theoretic sense.

Motivation Edit

In the past, various ad-hoc approaches to anonymizing public records have failed when researchers managed to identify personal information by linking two or more separately innocuous databases. Two well-known instances of successful "Linkage Attacks" have been the Netflix Database and the Massachusetts Group Insurance Commission (GIC) medical encounter database.

Netflix Prize Edit

Netflix has offered $1,000,000 prize for a 10% improvement in its recommendation system. Netflix has also released a training dataset for the competing developers to train their systems. While releasing this dataset they had provided a disclaimer: To protect customer privacy, all personal information identifying individual customers has been removed and all customer ids have been replaced by randomly assigned ids. Netflix is not the only available movie rating portal on the web; there are many others, including IMDB. On IMDB individuals can register and rate movies and they have the option of not keeping their details anonymous. Narayanan and Shmatikov linked the Netflix anonymized training database with the Imdb database (using the date of rating by a user) to partially de-anonymize the Netflix training database.[3] Thus, it is clear that the individual information of a user was compromised.

Massachusetts Group Insurance Commission (GIC) medical encounter database Edit

In this case[2] Latanya Sweeney from Carnegie Mellon University linked the anonymized GIC database (which retained the birthdate, sex, and ZIP code of each patient) and voter registration records to identify the medical record of the governor of Massachusetts.

Sensitivity Edit

Getting back on the main stream discussion on Differential Privacy, the sensitivity [1] (\Delta f\,\! ) of a function f:\mathcal{D}\rightarrow\mathbb{R}^{d}\,\! is

\Delta f=\max_{D_1,D_2} \lVert f(D_1)-f(D_2) \rVert_{1}\,\!

for all D_1\,\!,D_2\,\! differing in at most one element, and D_{1},D_{2}\in\mathcal{D}\,\!.

To get more intuition into this let us return to the example of the medical database and a query Q(i)\,\! (which can also be seen as the function  f \,\! ) to find how many people in the first i\,\! rows of the database have diabetes. Clearly, if we change one of the entries in the database then the output of the query Q(i)\,\! will change by at most one. So, the sensitivity of this query is one. It so happens that there are techniques (which are described below) using which we can create a differentially private algorithm for functions with low sensitivity.

Trade-off between utility and privacyEdit

A trade-off between the accuracy of the statistics estimated in a privacy-preserving manner, and the privacy parameter ε. This trade-off is studied in [4] and .[5]

Laplace noise Edit

Many differentially private algorithms rely on adding controlled noise[1] to functions with low sensitivity. We will elaborate this point by taking a special kind of noise (whose kernel is a Laplace distribution i.e. the probability density function \text{noise}(y)\propto \exp(-|y|/\lambda)\,\!, mean zero and standard deviation \lambda\,\!). Now in our case we define the output function of \mathcal{A}\,\! as a real valued function (called as the transcript output by \mathcal{A}\,\!) \mathcal{T}_{\mathcal{A}}(x)=f(x)+Y\,\!, where Y \sim \text{Lap}(\lambda)\,\!\,\! and f\,\! is the original real valued query/function we plan to execute on the database. Now clearly \mathcal{T}_{\mathcal{A}}(x)\,\! can be considered to be a continuous random variable, where

\frac{\mathrm{pdf}(\mathcal{T}_{\mathcal{A},D_1}(x)=t)}{\mathrm{pdf}(\mathcal{T}_{\mathcal{A},D_2}(x)=t)}=\frac{\text{noise}(t-f(D_1))}{\text{noise}(t-f(D_2))}\,\!

which is at most e^{\frac{|f(D_{1})-f(D_{2})|}{\lambda}}\leq e^{\frac{\Delta(f)}{\lambda}}\,\!. We can consider \frac{\Delta(f)}{\lambda}\,\! to be the privacy factor \epsilon\,\!. Thus \mathcal{T}\,\! follows a differentially private mechanism (as can be seen from the definition). If we try to use this concept in our diabetes example then it follows from the above derived fact that in order to have \mathcal{A}\,\! as the \epsilon\,\!-differential private algorithm we need to have \lambda=1/\epsilon\,\!. Though we have used Laplacian noise here but we can use other forms of noises which also allows to create a differentially private mechanism, such as the Gaussian Noise (where of course a slight relaxation of the definition of differential privacy [2] is needed).

Composability Edit

Sequential composition [6] Edit

If we query an ε-differential privacy mechanism t times, and the randomization of the mechanism is independent for each query, then the result would be \epsilon t-differentially private. In the more general case, if there are n independent mechanisms: \mathcal{M}_1,\dots,\mathcal{M}_n, whose privacy guarantees are \epsilon_1,\dots,\epsilon_n differential privacy, respectively, then any function g of them: g(\mathcal{M}_1,\dots,\mathcal{M}_n) is (\sum\limits_{i=1}^{n} \epsilon_i)-differentially private.

Parallel composition [6] Edit

Furthermore, if the previous mechanisms are computed on disjoint subsets of the private database then the function g would be (\max_i \epsilon_i)-differentially private instead.

Group privacy Edit

In general, ε-differential privacy is designed to protect the privacy between neighboring databases which differ only in one row. This means that no adversary with arbitrary auxiliary information can know if one particular participant submitted his information. However this is also extendable if we want to protect databases differing in c rows, which amounts to adversary with arbitrary auxiliary information can know if c particular participants submitted their information. This can be achieved because if c items change, the probability dilation is bounded by \exp ( \epsilon c ) instead of \exp ( \epsilon ),[2] i.e. for D1 and D2 differing on c items:

\Pr[\mathcal{A}(D_{1})\in S]\leq
\exp(\epsilon c)\times\Pr[\mathcal{A}(D_{2})\in S]\,\!

Thus setting ε instead to \epsilon/c achieves the desired result (protection of c items). In other words, instead of having each item ε-differentially private protected, now every group of c items is ε-differentially private protected (and each item is (\epsilon/c)-differentially private protected).

Proof idea Edit

For three datasets D1, D2, and D3, such that D1 and D2 differ on one item, and D2 and D3 differ on one item (implicitly D1 and D3 differ on at most 2 items), the following holds for an ε-differentially private mechanism \mathcal{A}:

\Pr[\mathcal{A}(D_{1})\in S] \leq \exp(\epsilon)\times\Pr[\mathcal{A}(D_{2})\in S]\,\!, and \Pr[\mathcal{A}(D_{2})\in S] \leq \exp(\epsilon)\times\Pr[\mathcal{A}(D_{3})\in S]\,\!

hence:

\Pr[\mathcal{A}(D_{1})\in S] \leq \exp(\epsilon)\times ( \exp(\epsilon)\times\Pr[\mathcal{A}(D_{3})\in S]) = \exp(2 \epsilon)\times\Pr[\mathcal{A}(D_{3})\in S] \,\!

The proof can be extended to c instead of 2.

Stable transformations Edit

A transformation T is c-stable if the hamming distance between T(A) and T(B) is at most c-times the hamming distance between A and B for any two databases A,B. Theorem 2 in [6] asserts that if there is a mechanism M that is \epsilon-differentially private, then the composite mechanism M\circ T is (\epsilon \times c)-differentially private.

This could be generalized to group privacy, as the group size could be thought of as the hamming distance h between A and B (where A contains the group and B doesn't). In this case M\circ T is (\epsilon \times c \times h)-differentially private.

See alsoEdit

NotesEdit

  1. 1.0 1.1 1.2 Dwork, McSherry, Nissim and Smith, 2006.
  2. 2.0 2.1 2.2 2.3 Dwork, ICALP 2006.
  3. Arvind Narayanan, Vitaly Shmatikov. Robust De-anonymization of Large Sparse Datasets. In IEEE Symposium on Security and Privacy 2008, p. 111–125.
  4. A. Ghosh, T. Roughgarden, and M. Sundararajan. Universally utility-maximizing privacy mechanisms. In Proceedings of the 41st annual ACM Symposium on Theory of Computing, pages 351–360. ACM New York, NY, USA, 2009.
  5. H. Brenner and K. Nissim. Impossibility of Differentially Private Universally Optimal Mechanisms. In Proceedings of the 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2010.
  6. 6.0 6.1 6.2 McSherry, SIGMOD 2009 (Theorem 3 and 4).

ReferencesEdit

External linksEdit

This page uses Creative Commons Licensed content from Wikipedia (view authors).

Also on Fandom

Random Wiki