In Differential Privacy, There is Truth: On Vote Leakage in Ensemble Private Learning
Abstract
When learning from sensitive data, care must be taken to ensure that training algorithms address privacy concerns.
The canonical Private Aggregation of Teacher
Ensembles, or PATE, computes output labels by aggregating the predictions of a (possibly distributed) collection of teacher models via a voting mechanism.
The mechanism adds noise to attain a differential privacy guarantee with respect to the teachers’ training data.
In this work, we observe that this use of noise, which makes PATE predictions stochastic, enables new forms of leakage of sensitive information.
For a given input, our adversary exploits this stochasticity to extract high-fidelity histograms of the votes submitted by the underlying teachers.
From these histograms, the adversary can learn sensitive attributes of the input such as race, gender, or age.
Although this attack does not directly violate the differential privacy guarantee, it clearly violates privacy norms and expectations, and would not be possible at all without the noise inserted to obtain differential privacy.
In fact, counter-intuitively, the attack becomes easier as we add more noise to provide stronger differential privacy.
We hope this encourages future work to consider privacy holistically rather than treat differential privacy as a panacea.
Introduction
The canonical Private Aggregation of Teacher Ensembles, PATE, is a model-agnostic approach to obtaining differential privacy guarantees for the training data of ML models [1], [2], that is widely applied [3], [4] and adapted [5]–[7] due to its comparatively favorable trade-off between differential privacy, utility and ease of decentralization [6].
In PATE, one considers an ensemble of independently trained teacher models.
To generate a prediction, PATE first collects the predictions of these teachers to form a histogram of votes.
It then adds Gaussian noise to the histogram and only reveals the label achieving plurality.
This label can be used directly as a prediction or to supervise the training of a student model—in a form of knowledge transfer.
Because PATE only reveals the label receiving the most votes, it comes with guarantees of differential privacy, i.e., the noisy voting mechanism allows us to bound how much information from the training data is potentially exposed [8].
But PATE does not explicitly protect from leakage of a key element in its inference procedure: the histogram of votes submitted by teachers.
While the histogram is used internally and not directly exposed to clients, a careful examination of PATE reveals that information about the histogram leaks to clients via query answers.
The histogram can contain highly sensitive information, not the least of which is membership in minority groups which, if revealed, can be used to discriminate against individuals.
We demonstrate this by showing how an attacker, using the vote histogram of a PATE ensemble trained to predict an individual’s income, can infer wholly different attributes such as their level of education, even when the attacker’s instance does not contain any information related to education-level.
Why is this possible?
At a high level, the histogram of votes can be interpreted as a relatively rich representation of the instance, that reveals attributes beyond what the ensemble was designed to predict.
Next, we ask, is this attack a realistic threat?
We answer this in the affirmative by designing an attack that extracts PATE histograms by repeatedly querying PATE, and showing that it reconstructs internal histograms to near perfection.
Our attack builds on the fact that repeated executions of the same query produce the same internal histogram and a consistent distribution of PATE’s noised answers corresponding to this histogram.
Our adversary can thus sample this distribution many times via querying, and use it to reconstruct the histogram.
This implies that our attack relies on the stochasticity of PATE’s output, which is a product of Gaussian noise, the very mechanism that was intended to protect privacy.
In fact, we find that the larger the variance of noise added to the histogram votes, the more successful our adversary is in reconstructing the histogram.
This is in sharp contrast with the known and expected effect in differential privacy, that higher noise scale generally leads to stronger privacy.
Put simply: differential privacy makes our attack possible.
An astute reader may observe that histogram leakage does not violate the differential privacy guarantee, which only protects individual users in the training data, which is not compromised here.
While it is absolutely true that our attack does not violate differential privacy, it clearly violates societal norms and user expectations that differential privacy is often incorrectly assumed to protect.
The fact that differential privacy enables the leakage we exploit nicely underscores the distinction between technical definitions of privacy and common conceptions of privacy.
The attack is difficult to mitigate.
Particularly, we show that it is stealthy in the sense that PATE’s own accounting of “privacy cost” considers our attacker’s set of queries “cheap”, meaning that revealing their answers has a relatively small effect in terms of differential privacy.
Consequently,
PATE’s privacy-spending monitoring does not prevent our attack.
Our attack also performs only a moderate number of queries in absolute numbers, the same number used by common legitimate
PATE clients, so a hard limit on queries would impede PATE’s utility.
We will discuss other mitigation approraches, which are not robust and/or not always usable.
To summarize, our contributions are as follows:
• We posit the novel threat of extracting PATE’s internal vote histograms.
We observe and show that those contain sensitive information such as minority-group membership.
• We show that differential privacy is the cause for histogram-information leakage to PATE’s querying clients.
• We exploit this leakage to reconstruct the vote histogram.
We achieve this by minimizing the difference between (a) the probability distribution of outcomes observed by repeatedly querying PATE and (b) an analytical counterpart that we derive.
• We experiment with standard PATE benchmarks, showing that the attack can recover highfidelity histograms while using a low number of queries that remain well within PATE’s budget intended to control leakage.
Vote Histograms are Sensitive Information
We consider an ensemble’s vote histogram, such as those computed internally in PATE.
Clearly, such histograms contain a lot more information on PATE’s innerworkings than simply its revealed decision, but it is important to clarify that there are common contexts in which this leakage can actually be used to hurt individuals as they contain sensitive information about them.
As a prominent example, minority-group membership often leaks via histograms, and can of course be used to discriminate against group members.
To understand this, let’s consider a minority group that is under-represented in the training data distributed across PATE’s teachers.
Each teacher observes some outliers and mis-representitive phenomena such as coincidental correlations or out-ofdistribution examples.
When data on group members is scarce, each model will tend to over-fit to the outlier phenomena within its own data, creating inter-model inconsistencies and resulting in disagreement, or low consensus, when predicting on similar inputs at test time—which readily presents itself on vote histograms.
Thus, we expect histograms to reveal members of minority group members via low consensus values .
Next, we illustrate this via a simple experiment.
Extracting sensitive attributes from UCI Adult-Income histograms.
We now simulate an attack that receives the vote histogram of a salary-predictor ensemble and uses it to detect a small minority of the population, specifically, PhD holders.
Following the above observation, our attack will simply classify all highly-consensus (consensus > 75% ) predictions as non-PhD-holders, whereas low-consensus ( < 75% ) predictions will be classified as PhD holders.
This is a heuristic attack that relies on intuition rather than learning the ensemble’s behavior using a labeled dataset.
On one hand, it may underestimate the attacker’s ability to detect PhD holders; on the other hand, it does not require a labeled dataset and only assumes that the attacker sees the votes histogram.
We use UCI Adult-Income dataset [9], containing around 41,000 data points with basic personal information on people such as age, work hours, weight, education, marital status, and more.
PhD holders form about 1% of this dataset.
We randomly selected 80% of the dataset for training, and held out the rest for testing.
We randomly partitioned the data into 250 disjoint sets.
For each, we fitted a random forest model (using a hyperparameter grid search, see Appendix D) predicting whether income is above or below $50,000.
For both training and test data, we removed the data columns explicitly indicating education levels, that is, training and test individuals do not contain any feature that directly distinguishes PhD from non-PhD holders.
[Figure]
distributions al lowing an attacker to identify them
Figure 1 shows the distribution of high-consensus and low-consensus on the test set (to make the effect clearer, we balanced the minority and majority groups in the test set by randomly removing most of the non-PhD samples).
We observe that low consensus indeed indicates minoritygroup membership.
Our attacker’s precision is not particularly high (75% on the balanced set), but they can still use this signal to discriminate against minority groups.
End-to-end scenario and other attacks.
Appendix E presents this attack in an end-to-end scenario where the attacker does not have direct access to the histogram, and has to first query a PATE instance to infer it, using our methodology in Section 3.
More sophisticated attackers can look for distinctive histogram patterns that characterize certain groups; the attack should become more accurate as more models are added to the ensemble, refining the attacker’s histogram measurement; and precision can be amplified if the attacker holds multiple samples that are known to belong to the same group.
Further, we note that sensitive-attribute extraction is not the only example for when vote histograms leak sensitive information: an attack could use votes to try to infer dataset properties [10] or distinguish between different partitions of the data associated with the different teachers in the ensemble.
How to Extract PATE Histograms
Having established that vote histogram leakage poses a risk to privacy and fairness, we proceed to provide a generic method for extracting vote histograms from PATE.
3.1 Problem Formulation and Attack Model
A primer on PATE.
The PATE framework begins by independently training an ensemble of models, called teachers, on partitions of the private data.
There is no particular requirement for the training procedure of each of these teacher models; the only constraint is that the partitions be disjoint.
Queries made by clients are answered as follows: (1) each teacher model predicts a label on the instance, (2) the PATE aggregator builds a histogram of class votes submitted by teachers, (3)
Gaussian noise is added to this histogram, and (4) the client receives the noised histogram’s argmax class (henceforth result class ).
This noisy voting mechanism gives PATE its differential privacy (DP) guarantee, in what is an application of the Gaussian mechanism [11].
To preserve differential privacy, PATE tracks the privacy cost of the set of past queries, and stops answering queries once the cost surpasses the privacy budget .
The cost computation is parameterized by a size δ .
The key differential privacy guarantee of PATE can be stated as follows: for a given set of queries with cost ε , PATE is ( ε, δ ) differentially private.
Put succinctly, ε bounds an adversary’s ability to distinguish between any adjacent training datasets, whereas δ bounds the (usually small) probability, over PATE’s randomness, of this bound not holding.
We defer additional details on differential privacy in PATE to Appendix A.
[Figure]
Attacker’s motivation.
Our attacker’s goal is to recover the histogram of the vote counts when PATE labels an instance.
Formally, given N predictors { P 1 , ..., P N } and a target input a , our attacker wants to infer H ≡ Count ( P 1 ( a ) , . .
P N ( a ))
=
[ h 1 , . . .
, h c ] where Count counts the number of appearances of each element in [ c ] .
Vote histograms can be used to extract potentially-sensitive information about an instance, such as its race, gender, or religion (see Section 2).
Attacker’s access and knowledge.
Our attacker can send queries to the aggregator and receive the label predicted by PATE (i.e., the output of the noisy voting mechanism).
This may be possible because the aggregator willfully exposes the predictions of
PATE, e.g., through a MLaaS API.
Alternatively, fully-decentralized implementations of PATE have been proposed where the central aggregator is replaced with a cryptographic multi-party computation protocol [6], and its output is exposed directly.
Figure 2 visualizes the workflow of our attack.
In PATE, the parameters (mean, variance) of the noise added during aggregation are public domain [2]; we therefore assume the attacker knows them.
We also assume the attacker knows the number of teacher models N , which may or may not be public.
This assumption is only necessary to shift the attacker’s learned distribution by a constant to attain a low L 1 approximation error when reconstructing histograms (Section 3).
We note that the attacker could just as easily exploit the leakage (e.g. to learn sensitive attributes or differentiate between training sets) without it
but we chose to instead make this assumption to simplify result presentation and interpretation.
3.2 Our histogram reconstruction attack
The idea behind the attack, given in pseudo-code in Algorithm 2, is as follows: let Q be a function that computes output-class probability distribution of PATE given a vote histogram H .
First, our attacker will sample PATE to find an estimate for this distribution ¯ q ≈ Q ( H ) .
Second, the attacker will use gradient descent to find ˆ H that minimizes the Euclidean distance between Q ( ˆ H ) and ¯ q .
Finally, they shift the estimated histogram ˆ H by a constant to account for the number of teachers (this step assumes the number of teachers is known, but is done mostly for presentation purposes, see Section 3.1).
We now detail these 3 steps.
Step 1: Monte Carlo approximation.
The first step will sample PATE M times and estimate the distribution over PATE’s outputs ¯ q ≈ Q ( H ) by setting each class probability as its Monte Carlo estimated mean frequency, i.e. ¯ q
i ← 1 M (cid:80) Mj =
1 q ji where q ji indicates whether class i was sampled in the j th step.
By the law of large numbers, as M increases, ¯ q i converges to i ’s sampling probability [ Q ( H )]
i , and we can expect the attacker’s estimate produced in the next steps to be more accurate.
Our attacker would want to increase M as much as possible, until they exceed PATE’s privacy budget.
Indeed, in PATE, the privacy leakage expended by each individual query can then be composed over multiple queries to obtain the total privacy cost ε needed to answer the set of queries.
Once the total privacy cost ε exceeds a maximum tolerable privacy budget, PATE must stop answering queries to preserve differential privacy.
Section 4 shows that the attack succeeds for values of M that remain well below PATE’s privacy budget, and are also moderate in absolute value, as they are similar to the query number of student models that use PATE.
Algorithm
Input: 1: N ∈ N ▷ total number of teachers (see
Section 3.1 for why this is needed) 2: O ▷ PATE instance 3: T, λ ▷ optimization termination threshold and learning rate
Output: ˆ H 4: S ← sample ( O , M )
▷ sampling PATE M times and storing into S ∈ 1 , ..., K M 5: for i = 1 , 2 , . .
, M do 6: for j = 1 , 2 , . . .
, c do 7: q ij = int ( S i ==
j )
▷ q ij = 1 if
S i =
j , 0 otherwise 8: end for 9: end for 10: ¯ q ← 0 c ▷ initialization of ¯ q with a 0 vector 11: for i = 1 , 2 , . .
, M do 12: ¯ q [ i ] ← 1 M (cid:80) Mj
=1 q ji 13: end for 14: ˆ H ← 0 c
▷ initialization of ˆ H , here we use an all-zero array of length c 15: while (cid:13)(cid:13)(cid:13) Q ( ˆ H )
− ¯ q (cid:13)(cid:13)(cid:13)
> T do 16:
ˆ H ← ˆ H − λ ∇ ˆ H (cid:13)(cid:13)(cid:13) Q ( ˆ H ) − ¯ q (cid:13)(cid:13)(cid:13)17: end while 18: ˆ H ←
ˆ H + [ N − (cid:80) ˆ H c ]
c ▷ shift ˆ H to sum to N return ˆ H
Step 2: constructing the optimization objective.
Our attacker wants to find ˆ H such that (cid:13)(cid:13)(cid:13)
[Equation]
2 is minimized where ∥·∥ 2 denotes the Euclidean norm.
Given a (differentiable) closed-form expression for Q , it becomes natural to program and solve this with modern gradient-based optimization frameworks.
Theorem 1 provides a closed form expression; and our attacker will use a differentiable approximation of this expression, as explained below.
Theorem 1.
Let H =
[ H 1 , . .
, H c ] be the vote histogram for the c classes, and let PATE’s
Gaussian-mechanism function Agg ( H ) ≡ argmax { H
i + S i } where S =
[ S 1 , . . .
, S M ] is a vector of M samples from a zeromean normal distribution with variance σ 2 .
Then the probability that the randomized aggregator outputs the class k is given by [ Q ( H )]
k
[Equation] [Equation]
1 Φ i ( α ) ϕ
k
( α )
d α where Φ i ( · ) is the cumulative probability distribution (CDF) of
N ( H i , σ 2 ) (normal distribution with mean H i and variance σ ) and ϕ k ( · ) is the probability density function (PDF) of N ( H k , σ 2 ) .
Proof.
Q ( H ) =
P ( Agg ( H ) = k ) , is the probability that H k + S k = max { Agg ( H ) } .
For any k , H k + S k is a random variable that follows a normal distribution with mean equal to H k and variance equal to σ 2 .
Let g k
= H k + S k , then g k ∼ N ( H k , σ 2 ) .
[ Q ( H )] k is the probability of g k is greater than g j , ∀ j ∈ { 1 , . . .
k − 1 , k + 1 , . . .
c } [ Q ( H )]
k = P ( Agg ( H ) =
k )
=
P ( g k > g 1 , . .
, g k > g k − 1 , g k > g k +1 , . .
. , g k > g c ) = (cid:90) ∞
−∞ c,i ̸
= k (cid:89) i =
P ( g i < α | g k = α ) P ( g k = α )d α = (cid:90) ∞
−∞ c,i ̸
= k (cid:89) i =
Φ i ( α ) ϕ
k
( α )d α
The expression in Theorem 1 is not usable in automatic differentiation and optimization frameworks; we therefore use an approximation of the integral by the trapezoid formula.
We select points with higher probability and sum up their values to get an approximation of the integral with infinite bounds.
Then we decide what values to select.
In the integral (cid:82) ∞ −∞ (cid:81) m,i ̸
= k i =
Φ i ( α ) ϕ
k
( α
)d α , α is the value of g k ∼ N ( H k , σ 2 ) .
Therefore α has the highest probability at H k , and has the higher probability closer to H k .
More specifically, properties of the normal distribution give us that µ ± 6 ∗ σ covers 99% of the values of Gaussian random variable z ∼ N ( µ, σ ) .
Therefore values of α between
[Figure]
c
[Figure]
un
[Figure]
v
[Figure]
un
[Figure]
H k ± 6 ∗ σ cover 99% of the integral area.
Therefore,
[Equation]
which is differentiable and is handled well by most automatic differentiation packages.
Step 3: accounting for the number of teachers.
The distribution estimate produced by our optimization may be skewed by a constant because [ Q ( H )] k only depends on the differences between g k and g 1 , . . .
, g k − 1 , g k +1 , . .
. , g c , so the attacker shifts each element of ˆ H by ( N − (cid:80) ˆ H ) /c
so that the new histogram ˆ H sums up to (cid:80)
ˆ H + c ∗ ( N − (cid:80) ˆ H ) /c
= N .
Theorem 2 in Appendix B provides proof that shifting Q ( ˆ H ) by a constant does not affect Q ( ˆ H ) .
Evaluation
We evaluate our attack against instantiations of PATE on common benchmarks.
We show that the extracted histograms only differ slightly from the true ones underlying PATE’s decision.
This is despite the low privacy cost of the attacker’s queries, which remains well within budgets enforced by common PATE instantiations.
We also quantify the impact of the choice of scale for the noise being added to preserve DP: we show that higher noise values result in increased attack success for a given number of queries.
We offer an hypothesis to explain this ostensibly surprising observation.
4.1 Experimental Setup
Data.
We use the experimental results from Papernot et al.
[1] to simulate our attack environment.
Papernot et al.
released the histograms obtained by PATE using 250 teachers for two 10-class computer-vision benchmarks, MNIST [12] and SVHN [13].
There are 9,000 histograms generated by MNIST experiments and 26,032 histograms generated by SVHN experiments, corresponding to the sizes of these datasets’ test sets.
We define a histogram’s consensus as its maximum value, and divide each dataset into three equalsized groups corresponding to high consensus, medium consensus, and low consensus.
Figureillustrates this.
We sample five histograms randomly from each group, and mount our attack for various noise levels.
Attack parameterization.
We simulated attackers with two types of query limits: first, an attacker limited by PATE’s canonical privacy budget; we used the parameterization from Papernot et al.
[1], i.e. budgets of 1.97 and 4.96 for MNIST and SVHN and σ = 40 .
Second, an attacker with a hard limit of 10 4 queries; this is a moderate number of queries for clients wishing to train their own “student” model using the aggregator’s labels (see [1], [2]).
We applied this attack against PATE instantiations for MNIST and SVHN with noise levels σ ∈ { 40 , 60 , 80 , 100 } .
For optimization (see Section 3), we use an adaptive learning rate: at the beginning of training, we use a learning rate of 10 ∥ ∇ ˆ H J ∥ 2 , where J = Q ( ˆ H ) − ¯ q is the optimization objective.
As the optimiza- tion starts to converge, 10 ∥ ∇ ˆ H J ∥ 2 becomes too large so we switch to a learning rate of 1 ∥ ∇ ˆ H J ∥ 2 .
This results in changes to the histogram of the magnitude of one vote for each update.
We use 0.01 as a threshold on the loss to establish convergence, and thus when ∥ J ∥ 2 < 0 .
01 , we stop optimizing.
For the attacks against canonical settings, we stopped once estimated histograms started presenting negative values, which we found to be a slightly better strategy.
(We could also try to constrain it to only-positive values; we discuss improving this optimization procedure further in Section 5).
Metrics.
For every attack, we measured the error rate and privacy cost .
The error rate is defined as the normalized L 1 distance between the ground-truth histogram H =
[ H 1 , . .
, H c ] and our attacker’s estimate ˆ H =
[ ˆ H 1 , . .
, ˆ H c ] , i.e., (cid:80) i (cid:12)(cid:12)(cid:12) H
i − ˆ H i (cid:12)(cid:12)(cid:12) /
(2 (cid:80) i | H i | ) .
(While the optimization minimizes Euclidean distance, we report L1 errors because they can be interpreted as corresponding to the number of mis-counted votes.)
We define and compute the privacy cost incurred by the adversary using established practices.
At a high level (see details in [1]), we model PATE as a R´enyi-differentially-private mechanism and leverage known privacy-preserving-composition theorems; we attain (non-R´enyi) differential privacy via a known reduction from differential privacy to R´enyi differential privacy.
The parameter δ is set as 10 − 5 for MNIST and 10 − 6 for SVHN, following Papernot et al.
Implementation Our implementation is provided in Python and the optimization uses the Jax library.
Our code is open-sourced at https://github.com/cleverhans-lab/ monte-carlo-adv .
We ran the optimization on an Intel Xeon Processor E5-2630 v4; it takes about 2.5 hours to complete for a single histogram.
4.2 Results
Our attack has high performance within canonical privacy budgets.
We first evaluate our attack on canonical PATE from Papernot et al.
Figure 4a and 4b show our attacker’s error rates for the different histograms, averaging 0.11 on the MNIST setup and 0.05 on the SVHN setup.
Our attack extracts high-fidelity histograms and has low privacy costs.
Figure 4 reports the performance of the privacy-budget limited attack; Figures 6 and 7 show our hard-query-limit attacker’s error rate and query costs for different noise levels, i.e. values of σ .
We observe that, across attacks, we attain very low error rates, often as low as 0.03, translating to 3% of the votes being miscounted.
For the hard-query-limit attack, privacy costs roughly range between 1 to 12, which is the order of magnitude for the budget one would plausibly use, for example to attain guarantees similar to Papernot et al.
[2] (which uses budgets of up to 8 in a directly comparable setting to ours) or Abadi et al.
[14] (which also employs a (8 , 10 − 5 ) -differentially private mechanism for MNIST).
[Figure] [Figure]
[Figure] [Figure]
[Figure] [Table]
[Figure]
P r i v a c y C o s t
Privacy
[Figure] [Figure]
Adding more noise helps the attacker.
Perhaps the most surprising result in this work is that the higher the noise scale, the lower the attacker’s error is.
This is not necessarily aligned with using up more of the privacy budget.
In fact, in many cases, increasing the noise decreases both the attacker’s privacy cost and their error; Figure 5 shows the correlation between cost and error
[Figure]
usually corre privacy guarantees
That is, more expected protection against attacks.
Specifically, our
Monte Carlo estimation should be less accurate when higher-variance noise is added, as convergence to the mean is slower.
Nevertheless, our attack actually performs better with higher noise levels.
To explain this, consider the aggregator’s output distribution.
When it is uniform, classes are sampled with equal probabilities, contributing equal information to each
Monte Carlo estimator.
Conversely, when some classes have a lower probability than others, their estimator will receive less samples.
Sharp output distributions, for example, have a peak that essentially “eclipses” other classes.
To illustrate this, consider the case where no noise is added at all; here, the output is always the plurality vote, and a black-box querying adversary cannot learn anything about the histogram except its top-voted class, which is already known after a single query.
Our results indicate that the mitigation of this eclipsing effect by increasing the noise, can be more dominant than the adverse effect that increasing noise has on Monte Carlo convergence.
Interestingly, this is not always reflected in PATE’s privacy-cost score, which is often lower for setups that leak more on vote histograms.
Technically, there is no contradiction: privacy cost measures differential privacy, which does not necessarily translate to protection against vote-histogram leakage.
Discussion
Mitigation.
The possibility of this attack is inherent to PATE’s aggregation mechanism, as long as the attacker can make multiple queries to PATE.
Our experiments in Section 4 show that (1) using tighter privacy budgets does not necessarily mitigate the attack, as there is no strong correspondence between the privacy cost and the attack’s success, and (2) it would be hard to limit the number of queries some other way without crippling PATE’s utility, because our attack is successful while using the same number of queries used in common scenarios from the literature.
Theoretically, the attack would be mitigated if PATE returned a consistent answer for each query.
PATE can thus try to cache answers to past queries and not recalculate them.
Unfortunately, this defense would be exposed to adversarial perturbations that try to evade the caching mechanism without affecting predictions, and would not be possible for settings that keep queries confidential and/or include decentralized aggregation [6].
Finally, we can try to prevent sensitive information from leaking onto vote histograms.
Particularly, models that generalize well across subgroups will be more immune to an attacker inferring group membership via consensus.
This reduces to the problem of subgroup fairness , an active line of work with many proposed approaches [15]–[19] but no silver-bullet solutions.
Limitations.
Empirical analysis of sensitive-attribute leakage onto vote histograms (Section 2) can be expanded to improve more sophisticated attackers, other scenarios, and also other forms of sensitive information that can leak onto histograms.
We instead focus our work on extracting histograms from PATE, noting that this can be used as a foundation for various different attacks.
A full optimization procedure takes a noticeably long time (roughly 10 minutes for a single step and 13 hours to convergence on a histogram), which prevented us from fully optimizing its hyperparameter choices.
This is however a limitation of our current experimental setup, not of the attack, bearing the main consequence that we are potentially under-estimating our attack’s capabilities.
Related work.
PATE is a widely-adopted framework for differentially-private ML, with myriad applications [3], [4] and extensions [5]–[7]; our attack is generally applicable to many of those frameworks, which inherit their privacy analysis from PATE.
Another prominent decentralized ML framework, Federated Learning (FL) [20], has been extensively investigated from a privacy perspective.
As we did for PATE in this work, prior work attacking
FL uncovered numerous forms of leakage.
For example, Hitaj et al.
[21] reconstructed the average training set representation of each classes;
Geiping et al.
[22] reconstructed training data with high fidelity; Nasr et al.
[23] mounted a membership inference attack against the clients; Wang et al.[24] showed how a malicious server could distinguish multiple properties of data simultaneously; and
Melis et al.
[25] inferred the clients’ training data sensitive properties.
These prior efforts all focus on FL, and are orthogonal to ours.
We are the first to evaluate any attack against PATE.
Conclusion We are the first to audit the confidentiality of PATE from an adversarial perspective.
Our attack extracts histograms of votes, which can reveal attributes of the input such as race or gender, or help attackers characterize teacher partitions.
The attacker’s success is not highly correlated with their queries’ privacy cost, which is monitored by PATE.
Thus, mitigations of this attack are nontrivial and/or significantly hinder prediction utility.
Particularly, using larger Gaussian noise, even when it fortifies the differential privacy guarantee, actually increases risk to the confidentiality of the vote histogram.
This surprising tension demonstrates that care must be taken to analyze the protection differential privacy provides within a given threat model, rather than treat it as a silver bullet protecting against any form of leakage.
Broader Impact Our work studies information leakage in a widely-adopted system, thus promoting our understanding of its risks.
Our adversarial method can be used by developers and auditors to evaluate the confidentiality and privacy promises of PATE-based frameworks.
Our observation that differential privacy does not prevent but rather enables the attack is the first of its kind in that it reveals a discrepancy between differential privacy and societal norms of privacy.
Characterizing this distinction is essential to building technology that uses technical definitions of privacy as an instrument to protect privacy norms.
Acknowledgments
We would like to acknowledge our sponsors, who support our research with financial and in-kind contributions:
Amazon, CIFAR through the Canada CIFAR AI Chair program, DARPA through the
GARD program, Intel, Meta, Microsoft, NFRF through an Exploration grant, NSERC through the Discovery Grant, the OGS Scholarship Program, a Tier 1 Canada Research Chair and the COHESA Strategic Alliance.
Resources used in preparing this research were provided, in part, by the Province of Ontario, the Government of Canada through CIFAR and companies sponsoring the Vector Institute.
We also thank members of the CleverHans Lab for their feedback
A Differential Privacy
An algorithm is said to be differentially private if its outputs on adjacent inputs (in our case, datasets) are statistically indistinguishable.
Informally, the framework of differential privacy requires that the probabilities of an algorithm making specific outputs be indistinguishible on two adjacent input datasets.
Two datasets are said to be adjacent if they only differ by at most one training record.
The degree of indistinguishibility is bounded by a parameter denoted ε .
The lower ε is, the stronger the privacy guarantee is for the algorithm because it is harder for an adversary to distinguish adjacent datasets given access to the algorithm’s predictions on these datasets.
In the variant of differential privacy we use, we can also tolerate that the guarantee not hold with probability δ .
This allows us to achieve higher utility.
B Shifting Distributions
In Section 3, we explain that we shift our histogram estimate by a constant to account for the number of teachers known to the attacker.
The following theorem shows that the number of teachers does not affect the attacker’s computation
Theorem 2.
For two histograms, H 1 =
[ h 11 , . . .
, h 1 m ] and H 2 =
[ h 21 , . .
h 2 m ] , Q H 1 ,σ = Q H 2 ,σ if
h 1 i − h 2 i
=
h
j − h 2 j for all i, j = 1 , . . .
, m .
Proof.
let
d = h 1 i − h 2 i
=
h
j − h 2 j for all i, j = 1 , . . .
, m .
P ( g 2 i > g 2 j ) ∼ N (( h 2 i − h 2 j ) , 2 σ 2 ) =
N (( h 1 i + d ) − ( h 1 j + d ) , 2 σ 2 ) =
N ( h 1 i − h 2 j , 2 σ 2 ) =
P ( g 1 i > g 1 j ) for all i, j = 1 , . . .
, m .
Q H 1 ,σ k = P ([ g 1 k > g 11 , . .
, g 1 k > g 1 k − 1 , g 1 k > g 1 k +1 , . .
, g 1 k >
[Equation]
What Theorem 2 states is, if the difference between two histograms is uniform, then the probability distribution of the outcomes is the same.
With the support of Theorem 2, H can be safely shifted by a constant amount to sums up to the number of teachers, N .
C Chosen histograms for evaluation
Table 1 shows the histograms we chose for evaluation in the 3 consensus-level categories.
[Table]
D Fittig Random Forests
Every one of our teachers in Section 2 fits a random forest classifier using the sklearn package; each teacher performed a grid search over the following hyperparameters
[Table]
and picked the values that lead to the lowest training loss.
• max depth : the maximum number of levels that a tree has, an integer chosen betweenand 11 inclusively; • max features : the maximum number of features, while splitting a node, one of sqrt(number of features), log(number of features), 0.1*(number of features), 0.2*(number of features), 0.3*(number of features), 0.4*(number of features), 0.5*(number of features), 0.6*(number of features), 0.7*(number of features), 0.8*(number of features), 0.9*(number of features); • n estimators : the number of trees that the forest has, an integer chosen between log(9.5) and log(300.5); • criterion: the loss function, one of gini impurity and entropy; • min samples split : the minimum number of instance for a node to split, one of 2, 5, 10; • bootstrap: one of True or False
E End-to-end sensitive-attribute inference
In Section 2, we showed that histograms leak by mounting an attack that classifies histograms to low-consensus and high-consensus groups, which reveals information about minority-group membership.
In Section 4, we showed that we can extract histograms by querying PATE instances.
Now, we combine these two attacks, to extract minority-group membership information directly from a
PATE instance.
Our setting mirrors the setting from Section 2, but the attacker does not have direct access to histograms of individuals, and instead they extract them from PATE’s answers using our methodology (Section 3).
We used the same ensemble from Section 2, but this time, theteachers’ vote histogram was noised, again using σ = 40 , δ = 0 .
00001 and a privacy budget of 1.
as in [2].
We sampled 10 low-consensus and 10 high-consensus members of the test set, and ran the attack on them: we queried PATE with each member’s data record until exhausting the privacy budget, computed the Monte Carlo estimators, ran the optimization to recover the vote histogram, and then classified it to low-consensus/high-consensus as in Section 2.
Results are given in Figure 8, and indeed, they mirror the results of the attack in Section 2.
[Figure]
F Edge values for noise
Here, our purpose is to evaluate our attack given extremely low and extremely high values of σ .
We repeated the query-number-limited attack from Section 4.1 where adversaries perform 10 4 queries.
This time, we used a σ value approaching 0 and a very high one (400).
Figure 9 shows that when noise is close to 0, the error rate is the highest, it then drops and climbs again as we increase the error.
This is consistent with what we would expect: we know that when σ = 0 , the attacker cannot learn anything but the argmax class, whereas if σ is infinitely large, PATE’s output distribution is uniform regardless of the underlying votes, and the attacker again cannot learn anything.
[Figure]