datamatters24 commited on
Commit
ef3c046
·
verified ·
1 Parent(s): 31d08e1

Remove legacy .txt artifact (superseded by .md)

Browse files
Files changed (1) hide show
  1. cano_paper_v2.txt +0 -478
cano_paper_v2.txt DELETED
@@ -1,478 +0,0 @@
1
- ================================================================================
2
- CANO: Context-Aware Noise Optimization for Adversarial Privacy Protection
3
- ================================================================================
4
-
5
- AUTHORS: Ted Rubin
6
- AFFILIATION: Independent Researcher
7
- EMAIL: ted@theorubin.com
8
-
9
- ================================================================================
10
- ABSTRACT
11
- ================================================================================
12
-
13
- We present CANO (Context-Aware Noise Optimization), an adaptive noise injection
14
- system that optimizes the privacy-utility tradeoff in adversarial privacy
15
- protection. Unlike uniform noise strategies, CANO allocates noise proportionally
16
- to each feature's contribution to re-identification, concentrating protection
17
- where it matters most while preserving utility on low-impact features.
18
-
19
- We evaluate CANO against five baseline strategies (Gaussian, FGSM, PGD,
20
- Carlini-Wagner, and Laplace) across 68,885 experimental configurations
21
- spanning 12 datasets (11 after excluding the 2-user cybersec_intrusion dataset
22
- from aggregate statistics), 3 attack models, and 6 noise budgets. Aggregate
23
- statistics are computed over 54,281 in-scope configurations, including a
24
- complete 540-row block on the real FP-Stalker browser-fingerprint corpus
25
- (Vastel et al. [10]; 776 users, 13,674 fingerprints, 34 attributes).
26
-
27
- Against a known adaptive attacker, CANO achieves a mean accuracy reduction of
28
- 0.112 +/- 0.178 (see Fig. 1, Fig. 3) -- below
29
- Gaussian noise (0.395) but above C&W (0.001).
30
- However, two findings reframe this aggregate result. First, on the FP-Stalker
31
- real browser-fingerprint corpus the CANO/Gaussian gap collapses from the
32
- typical small-synthetic ratio of 100:1 (e.g., synth_50u_20s: CANO 0.003 vs
33
- Gaussian 0.514) to roughly 4:5 (CANO 0.276 vs Gaussian 0.340), suggesting
34
- that importance-weighted allocation is much closer to competitive when
35
- feature importance reflects realistic attribute redundancy rather than
36
- hand-crafted synthetic noise. Second, CANO achieves a strong transfer-attack
37
- profile: a transfer-to-adaptive ratio of 2.35x (transfer reduction 0.263 vs
38
- adaptive 0.112), compared to 1.04x for Gaussian. CANO's feature-importance
39
- allocation produces perturbations that generalize better across unseen
40
- attack models (see Fig. 2 Pareto front) -- the realistic deployment setting.
41
- CANO also produces lower noise magnitude than Gaussian/FGSM while retaining
42
- higher SNR.
43
-
44
- In adversarial co-evolutionary training, the DQN policy reduces attacker
45
- re-identification accuracy from 74.8% to 20.8% within 30 rounds (Fig. 6),
46
- converging to near-uniform allocation (Gini coefficient: 0.009) -- empirically
47
- demonstrating that uniform noise is the game-theoretic equilibrium against
48
- adaptive adversaries.
49
-
50
- Keywords: privacy protection, adversarial noise, reinforcement learning,
51
- browser fingerprinting, context-aware optimization, transfer attacks
52
-
53
-
54
- ================================================================================
55
- 1. INTRODUCTION
56
- ================================================================================
57
-
58
- Browser fingerprinting poses a significant threat to user privacy. Attackers
59
- construct unique device fingerprints from browser attributes -- canvas
60
- rendering, WebGL, screen resolution, installed fonts -- to track users across
61
- sessions without cookies [1].
62
-
63
- Privacy-preserving systems combat fingerprinting by injecting noise. A
64
- fundamental unresolved tension: whether uniform noise injection or
65
- feature-weighted injection provides superior protection. A further practical
66
- challenge: privacy systems are typically deployed without knowledge of the
67
- adversary's exact attack model.
68
-
69
- CANO addresses this through:
70
- (1) Feature importance analysis.
71
- (2) Proportional noise allocation with a minimum weight floor preventing
72
- exploitable zero-noise features.
73
- (3) RL that adapts allocation through adversarial co-evolution.
74
- (4) Empirical analysis of the adaptive-vs-transfer tradeoff.
75
-
76
- Our central finding is counterintuitive: while CANO does not maximize accuracy
77
- reduction against a known adaptive attacker (Gaussian dominates), CANO achieves
78
- a 2.35x transfer-to-adaptive ratio -- notably higher than Gaussian's
79
- 1.04x. In real deployments, defenders cannot tailor their noise to
80
- the adversary's model.
81
-
82
- 1.1 Related Work
83
-
84
- Browser fingerprinting was popularized by Eckersley's Panopticlick study [7],
85
- which showed that the combination of routine browser attributes -- user
86
- agent, screen resolution, time zone, plugin list -- is enough to uniquely
87
- identify the vast majority of users. Subsequent work expanded the attack
88
- surface to canvas rendering, WebGL hashes, font metrics, and JavaScript-
89
- exposed APIs; Laperdrix et al.'s 2020 survey [1] catalogues 17 distinct
90
- categories of fingerprinting signals and remains the standard reference.
91
- FP-Stalker (Vastel et al. [10]) introduced longitudinal evaluation by
92
- tracking how individual fingerprints evolve over weeks, which is why we
93
- adopt its 776-user corpus as our reference real-data benchmark in
94
- Section 3.5. On the defensive side, BrFAST (Andriamilanto & Allard [8])
95
- and FPSelect [9] focus on attribute *selection* -- which fingerprint
96
- attributes a privacy-conscious browser should expose at all -- whereas
97
- CANO operates on a complementary axis: given that an attribute is exposed,
98
- how much per-attribute noise to inject and how to allocate that noise
99
- across the attribute set.
100
-
101
- The privacy-utility tradeoff via random perturbation has a long lineage in
102
- differential privacy (Dwork et al. [5]), where uniform additive Gaussian or
103
- Laplace noise is calibrated to a per-query sensitivity bound. The
104
- adversarial-examples literature complements this by showing that targeted
105
- perturbations can dramatically reduce classifier accuracy under L2 or
106
- L-infinity budgets: FGSM [2] is a single-step gradient attack, PGD [3]
107
- iterates it under projection, and Carlini-Wagner [4] casts the same
108
- problem as constrained optimization. CANO sits between these two
109
- traditions. It borrows the budget-controlled framing from adversarial
110
- examples but allocates the budget by a *static* feature-importance prior,
111
- rather than by per-input gradient (FGSM/PGD) or by uniform calibration
112
- (DP). The minimum-weight floor (min_weight = 0.1, Section 2.2) is a
113
- defensive concession to the same observation that motivates DP's worst-
114
- case framing: any feature that receives systematically less noise becomes
115
- the attacker's preferred discriminator.
116
-
117
- A defense's robustness to *adaptive* adversaries -- those that retrain on
118
- protected outputs rather than the clean distribution -- is typically much
119
- weaker than its initial efficacy [3]. We confirm this in our adversarial
120
- co-evolutionary training (Section 3.7): the DQN policy converges to a
121
- near-uniform allocation (Gini = 0.009 after 30 rounds), consistent with the
122
- intuition that under retraining pressure the optimal defense distributes
123
- noise broadly. The orthogonal axis is *transferability*: a perturbation
124
- crafted against one attacker model may or may not generalize to a different
125
- one (cross-model transfer is a long-standing topic in adversarial ML).
126
- Our central empirical contribution measures the transfer-vs-adaptive gap
127
- explicitly across all six strategies, and finds that CANO's importance-
128
- weighted allocation produces perturbations with a 2.35x transfer-to-
129
- adaptive ratio versus 1.04x for Gaussian -- the realistic deployment
130
- regime, since defenders typically do not know the deployed attack model
131
- and must rely on transfer.
132
-
133
-
134
- ================================================================================
135
- 2. METHODOLOGY
136
- ================================================================================
137
-
138
- 2.1 Feature Importance Analysis
139
-
140
- Random Forest (100 trees) on simulated fingerprint samples; permutation
141
- importance (10 repeats). 9-dimensional feature space of normalized browser
142
- fingerprint attributes. Baseline re-identification accuracy: 100% on synthetic
143
- corpus.
144
-
145
- Feature importance is highly concentrated: feature_0 (0.303) and feature_1
146
- (0.302) account for ~99% of total importance; features 2-5 have exactly 0.000
147
- permutation importance (Fig. 5). This motivates the minimum weight floor
148
- (min_weight = 0.1) in Section 2.2.
149
-
150
- [NOTE: Synthetic proxies, not real browser API measurements. Real-world
151
- validation is in progress against the FP-Stalker corpus (Vastel et al.,
152
- IEEE S&P 2018 [10]; ~21,809 real browser fingerprints across 40
153
- attributes) with per-attribute instability and memory costs from BrFAST
154
- (Andriamilanto & Allard, WWW '21 Companion [8]) supplying usability
155
- weights directly to CANO's per-feature allocation.]
156
-
157
- 2.2 CANO Noise Allocation
158
-
159
- Given feature importance weights w_i and noise budget epsilon:
160
-
161
- delta_i = epsilon * (w_i * n_features) * sign(z_i)
162
-
163
- where z_i ~ N(0,1) or gradient direction when available. The n_features scaling
164
- factor ensures equal total noise energy to baselines. The minimum weight floor
165
- (min_weight = 0.1) prevents attackers from exploiting negligibly-noised
166
- features.
167
-
168
- 2.3 DQN Policy Training
169
-
170
- Adversarial co-evolution (Fig. 6): 50 simulated users, 20 samples/user,
171
- 9 features.
172
-
173
- State: [feature_values, attack_confidence, privacy_budget, query_count]
174
- Action: per-feature noise allocation weights (softmax-normalized)
175
- Reward: alpha * privacy_gain - (1-alpha) * utility_cost
176
-
177
- Training alternates defender (CANO) and attacker (GradientBoosting retraining).
178
-
179
- 2.4 Experimental Setup
180
-
181
- Strategies: Gaussian, FGSM, PGD, Carlini-Wagner, Laplace, CANO
182
- Noise budgets: epsilon in {0.05, 0.10, 0.15, 0.20, 0.30, 0.50}
183
- Attack models: Random Forest, Gradient Boosting, MLP
184
- Datasets: 12 total -- 3 controlled synthetic (synth_small/medium/large),
185
- 6 overlap/size-stress variants, 1 public keystroke
186
- (CMU 51-users), 1 real browser-fingerprint corpus (FP-Stalker,
187
- 776 users), and cybersec_intrusion (2-user, OUT-OF-SCOPE)
188
- Total configs: 68,885 (aggregate statistics over
189
- 54,281 in-scope configs; utility
190
- metrics from the 3,529-row subset
191
- for which sparsity/KL/deviation/sensitivity were recorded).
192
-
193
- Scope note: cybersec_intrusion has 2 users (binary) -- not a valid k-class
194
- fingerprinting benchmark. It is retained in the per-dataset breakdown
195
- (Section 3.5) for completeness but excluded from all aggregate statistics,
196
- comparison tables, and significance tests.
197
-
198
- Data provenance. The 68,885 raw configurations span 19 evaluation runs from
199
- 2026-03-22 through 2026-04-25. The paper quotes three different N values,
200
- which can otherwise look inconsistent:
201
-
202
- N = 68,885 raw configurations across all 19 runs and all 12 datasets.
203
- N = 54,281 in-scope configurations after excluding the 2-user
204
- cybersec_intrusion dataset (the basis for Tables 1, 4, 5,
205
- 6 and Section 3 in general).
206
- N = 3,529 utility-metric subset for which sparsity, KL divergence,
207
- deviation, and sensitivity were recorded in-line (the
208
- noise-quality fields were added to the evaluation script
209
- in the 2026-04-05 run; earlier runs predate the
210
- instrumentation and therefore do not contribute to
211
- Table 3).
212
-
213
- Per-strategy row counts in Table 1 (range 8,460-10,423) differ because
214
- historical runs covered evolving subsets of the six strategies as the
215
- codebase matured (Laplace and PGD were added later than the original
216
- Gaussian/FGSM/CANO trio). All comparisons are strategy-paired within their
217
- own (dataset, attacker, epsilon, rep) tuples, so the unequal n's do not
218
- bias within-strategy means; they do, however, mean that the Table 1 totals
219
- should not be summed.
220
-
221
-
222
- ================================================================================
223
- 3. RESULTS
224
- ================================================================================
225
-
226
- 3.1 Overall Strategy Comparison (Adaptive Attack) [See Figure 1, Figure 3]
227
-
228
- Table 1: Strategy comparison -- aggregate over in-scope datasets only.
229
-
230
- Strategy AccReduction XferRed NoiseL2 SNR(dB) n
231
- ------------------------------------------------------------------------
232
- Gaussian 0.395 +/- 0.281 +0.411 0.595 9.7 10,423
233
- Laplace 0.239 +/- 0.222 +0.391 0.556 11.2 8,460
234
- FGSM 0.212 +/- 0.212 +0.472 0.642 9.8 9,641
235
- PGD 0.129 +/- 0.171 +0.134 0.271 17.5 8,789
236
- CANO (ours) 0.112 +/- 0.178 +0.263 0.435 15.5 8,508
237
- C&W 0.001 +/- 0.011 -0.018 0.003 53.7 8,460
238
-
239
- Gaussian is the strongest adaptive-attack strategy. CANO outperforms only C&W
240
- on that metric. See Table 6 for significance.
241
-
242
- 3.2 Transfer Attack Analysis [See Figure 2]
243
-
244
- Table 2: Adaptive vs. transfer attack accuracy reduction (aggregate, in-scope).
245
-
246
- Strategy Adaptive Transfer Ratio Gap
247
- ------------------------------------------------------
248
- CANO (ours) 0.112 +0.263 2.35x +0.151
249
- FGSM 0.212 +0.472 2.23x +0.260
250
- Laplace 0.239 +0.391 1.64x +0.152
251
- PGD 0.129 +0.134 1.04x +0.005
252
- Gaussian 0.395 +0.411 1.04x +0.016
253
- C&W 0.001 -0.018 n/a -0.019
254
-
255
- (Transfer numbers are from the 2026-04-05 utility-metric subset; the new
256
- fpstalker block does not yet have transfer values computed -- backfill
257
- planned. Adaptive numbers are aggregate over all 54,281 in-scope rows.)
258
-
259
- CANO's 2.35x transfer-to-adaptive ratio reflects more
260
- model-agnostic perturbations. Gaussian provides little additional transfer
261
- protection. C&W is counterproductive (negative transfer reduction).
262
-
263
- 3.3 Noise Utility Metrics
264
-
265
- Table 3: Per-strategy noise-quality metrics (n=3,529
266
- in-scope rows for which metrics were recorded; all CANO rows now report valid
267
- values after the evaluation-script fix).
268
-
269
- FGSM sparsity=1.000 KL=0.946 deviation=0.1824 sensitivity=-0.200 (n=649)
270
- CANO (ours) sparsity=1.000 KL=0.581 deviation=0.1690 sensitivity=-0.190 (n=540)
271
- Gaussian sparsity=1.000 KL=0.511 deviation=0.1423 sensitivity=+0.110 (n=720)
272
- Laplace sparsity=1.000 KL=0.440 deviation=0.1750 sensitivity=-0.185 (n=540)
273
- PGD sparsity=0.825 KL=0.156 deviation=0.0730 sensitivity=-0.071 (n=540)
274
- C&W sparsity=1.000 KL=0.008 deviation=0.0009 sensitivity=-0.027 (n=540)
275
-
276
- CANO's noise structure is distinguishable from Gaussian: similar KL divergence
277
- but different sensitivity signature (negative for CANO, positive for Gaussian),
278
- reflecting CANO's intentional concentration on importance-ranked (not
279
- variance-ranked) features.
280
-
281
- 3.4 Epsilon Sensitivity [See Figure 1]
282
-
283
- Table 4: Accuracy reduction by noise budget (aggregate, in-scope).
284
-
285
- Epsilon CANO FGSM Gaussian Laplace PGD C&W
286
- ----------------------------------------------------------
287
- 0.05 0.010 0.054 0.104 0.013 0.018 0.001
288
- 0.10 0.035 0.103 0.195 0.060 0.037 0.001
289
- 0.15 0.084 0.183 0.312 0.152 0.048 0.001
290
- 0.20 0.131 0.258 0.431 0.253 0.072 0.001
291
- 0.30 0.188 0.317 0.609 0.382 0.178 0.001
292
- 0.50 0.226 0.374 0.750 0.576 0.433 0.002
293
-
294
- CANO's ratio to Gaussian goes from 0.09 at epsilon=0.05 to
295
- 0.30 at epsilon=0.50.
296
-
297
- 3.5 Per-Dataset Analysis [See Figure 5]
298
-
299
- Table 5: Mean accuracy reduction by dataset.
300
-
301
- cybersec_intrusion users= 2 CANO= 0.034 Gauss= 0.192 FGSM= 0.094 Lap= 0.122 PGD= 0.088 [OUT-OF-SCOPE: 2-user binary task; excluded from aggregates]
302
- fpstalker (real) users=776 CANO= 0.276 Gauss= 0.340 FGSM= 0.282 Lap= 0.291 PGD= 0.176
303
- keystroke_cmu_51users users= 51 CANO= n/a Gauss= 0.657 FGSM= 0.357 Lap= n/a PGD= 0.413
304
- overlap_10u_50s users= 10 CANO= 0.046 Gauss= 0.307 FGSM= 0.247 Lap= n/a PGD= n/a
305
- overlap_20u_30s users= 20 CANO= 0.041 Gauss= 0.218 FGSM= 0.187 Lap= n/a PGD= n/a
306
- synth_10u_50s users= 10 CANO= 0.001 Gauss= 0.270 FGSM= 0.057 Lap= n/a PGD= n/a
307
- synth_20u_50s users= 20 CANO= 0.001 Gauss= 0.378 FGSM= 0.135 Lap= n/a PGD= n/a
308
- synth_50u_20s users= 50 CANO= 0.003 Gauss= 0.514 FGSM= 0.356 Lap= n/a PGD= n/a
309
- synth_5u_30s users= 5 CANO=-0.006 Gauss= 0.208 FGSM= 0.072 Lap= n/a PGD= n/a
310
- synth_large users= 20 CANO= 0.135 Gauss= 0.416 FGSM= 0.234 Lap= 0.304 PGD= 0.152
311
- synth_medium users= 10 CANO= 0.082 Gauss= 0.306 FGSM= 0.153 Lap= 0.198 PGD= 0.090
312
- synth_small users= 5 CANO= 0.116 Gauss= 0.287 FGSM= 0.190 Lap= 0.215 PGD= 0.109
313
-
314
- cybersec_intrusion is shown for completeness only. fpstalker is the real
315
- browser-fingerprint corpus (Vastel et al. [10]) and is the closest dataset
316
- to deployment conditions; on it, CANO closes most of the gap to Gaussian
317
- (0.276 vs 0.340), in contrast to the wider gaps on small-synthetic datasets.
318
-
319
- 3.6 Statistical Significance (aggregate, in-scope) [See Figure 4]
320
-
321
- Table 6: CANO vs each baseline, Welch t-test and Cohen's d.
322
-
323
- CANO vs C&W d= +0.880 p < 0.001 ***
324
- CANO vs FGSM d= -0.510 p < 0.001 ***
325
- CANO vs Gaussian d= -1.202 p < 0.001 ***
326
- CANO vs Laplace d= -0.631 p < 0.001 ***
327
- CANO vs PGD d= -0.093 p < 0.001 ***
328
-
329
- 3.7 Adversarial Training Results (DQN Policy) [See Figure 6]
330
-
331
- DQN policy trained over 30 adversarial rounds with 50 users:
332
-
333
- Baseline attack accuracy: 74.8%
334
- Final attack accuracy: 20.8%
335
- Accuracy reduction: 54.0 percentage points
336
- Noise magnitude: 0.6061
337
- DQN training steps: 31,500
338
- Final Gini coefficient: 0.009 (near-uniform)
339
-
340
- Uniform allocation emerges as the game-theoretic equilibrium against adaptive
341
- adversaries.
342
-
343
-
344
- ================================================================================
345
- 4. DISCUSSION
346
- ================================================================================
347
-
348
- 4.1 Key Findings
349
-
350
- (1) Noise scaling (n_features multiplier) is the most impactful design choice.
351
- (2) Gaussian is the strongest adaptive-attacker defense (d = -1.20
352
- vs CANO).
353
- (3) CANO achieves a 2.35x transfer/adaptive ratio.
354
- (4) RL equilibrium is uniform allocation (Gini = 0.009).
355
- (5) CANO uses less noise than Gaussian (L2 = 0.435 vs
356
- 0.595) with higher SNR (15.5
357
- vs 9.7 dB).
358
- (6) On the real FP-Stalker corpus (776 users, 34 attributes), CANO closes most
359
- of the gap to Gaussian (0.276 vs 0.340) -- a notably tighter result than
360
- the typical small-synthetic gap (e.g., synth_50u_20s: CANO 0.003 vs
361
- Gaussian 0.514). This suggests the importance-weighted allocation
362
- generalizes better when feature importance reflects real attribute
363
- redundancy rather than synthetic noise.
364
-
365
- 4.2 Limitations
366
-
367
- - One real browser-fingerprint dataset (FP-Stalker, 776 users) plus
368
- synthetic/semi-synthetic plus CMU keystroke. Larger real-world fingerprint
369
- corpora (HTillmann; BrFAST extended) are the next integration.
370
- - 9 synthetic features with artificial importance concentration.
371
- - cybersec_intrusion (2 users) excluded from aggregates.
372
- - Utility metrics reported on 3,529-row subset
373
- (most-recent run only). Backfill re-run planned for older configs.
374
- - RL at 50 users; scaling TBD.
375
-
376
- 4.3 Future Work
377
-
378
- (1) Backfill transfer-attack and noise-utility metrics (sparsity, KL,
379
- deviation, sensitivity) for the new fpstalker block; the older
380
- synthetic-only utility-metric subset (n=3,529) does not yet include
381
- fpstalker rows, so Tables 2 and 3 are still computed on that subset
382
- while Tables 1, 4, 5, 6 use the full 54,281-row aggregate.
383
- (2) Extend utility-metric coverage across all historical evaluation runs.
384
- (3) Formal DP guarantees for CANO's allocation mechanism.
385
- (4) Larger RL training (1,000+ users); online policy updates in deployment.
386
- (5) Theoretical analysis of conditions under which feature-weighted noise
387
- achieves higher transfer efficiency than uniform noise.
388
-
389
-
390
- ================================================================================
391
- 5. CONCLUSION
392
- ================================================================================
393
-
394
- CANO does not match Gaussian in raw adaptive-attack accuracy reduction
395
- (0.112 vs 0.395), but achieves a 2.35x
396
- transfer-to-adaptive ratio -- better model-agnostic behavior than Gaussian
397
- (1.04x) in the transfer setting, which better reflects real-world
398
- deployment. On the real FP-Stalker browser-fingerprint corpus the
399
- adaptive-attack gap also narrows substantially (CANO 0.276 vs Gaussian 0.340),
400
- reinforcing the case that importance-weighted allocation generalizes better
401
- under realistic conditions than the small-synthetic aggregate suggests.
402
-
403
- Contributions:
404
- (1) Noise scaling correction: equal total noise energy while redistributing
405
- by importance.
406
- (2) Transfer efficiency result: feature-importance weighting produces more
407
- model-agnostic perturbations.
408
- (3) RL equilibrium finding: uniform noise is the game-theoretic equilibrium
409
- against adaptive adversaries (Gini = 0.009 after 30 rounds).
410
- (4) Real-world validation: the 540-row complete block on FP-Stalker
411
- (776 users, 13,674 fingerprints) shows the synthetic CANO/Gaussian gap
412
- narrows substantially under realistic feature distributions.
413
-
414
-
415
- ================================================================================
416
- FIGURES
417
- ================================================================================
418
-
419
- Figure 1: Accuracy reduction vs. noise budget epsilon, per strategy.
420
- File: results/figures/fig1_accuracy_reduction_vs_epsilon.png
421
- Figure 2: Privacy-utility Pareto front.
422
- File: results/figures/fig2_pareto_front.png
423
- Figure 3: Per-strategy heatmap of accuracy reduction across datasets.
424
- File: results/figures/fig3_strategy_heatmap.png
425
- Figure 4: Statistical significance of CANO vs each baseline.
426
- File: results/figures/fig4_statistical_significance.png
427
- Figure 5: Per-dataset accuracy reduction bars.
428
- File: results/figures/fig5_per_dataset.png
429
- Figure 6: DQN adversarial training progress (attacker accuracy vs round).
430
- File: results/figures/rl_training_progress.png
431
-
432
-
433
- ================================================================================
434
- REFERENCES
435
- ================================================================================
436
-
437
- [1] Laperdrix, P. et al. "Browser Fingerprinting: A Survey." ACM CSUR, 2020.
438
- [2] Goodfellow, I. et al. "Explaining and Harnessing Adversarial Examples."
439
- ICLR, 2015.
440
- [3] Madry, A. et al. "Towards Deep Learning Models Resistant to Adversarial
441
- Attacks." ICLR, 2018.
442
- [4] Carlini, N. & Wagner, D. "Towards Evaluating the Robustness of Neural
443
- Networks." IEEE S&P, 2017.
444
- [5] Dwork, C. et al. "The Algorithmic Foundations of Differential Privacy."
445
- Foundations and Trends in TCS, 2014.
446
- [6] Mnih, V. et al. "Human-level Control through Deep Reinforcement Learning."
447
- Nature, 2015.
448
- [7] Eckersley, P. "How Unique Is Your Web Browser?" PETS, 2010.
449
- [8] Andriamilanto, N. and Allard, T. "BrFAST: a Tool to Select Browser
450
- Fingerprinting Attributes for Web Authentication According to a
451
- Usability-Security Trade-off." Companion Proceedings of the Web
452
- Conference 2021 (WWW '21 Companion), pp. 1-4, ACM, Ljubljana, Slovenia,
453
- April 2021. DOI: 10.1145/3442442.3458610.
454
- Source + data assets: github.com/tandriamil/BrFAST (MIT License).
455
- [9] Andriamilanto, N., Allard, T., and Le Guelvouit, G. "FPSelect:
456
- Low-Cost Browser Fingerprints for Mitigating Dictionary Attacks
457
- against Web Authentication Mechanisms." ACM CCS 2020.
458
- DOI: 10.1145/3427228.3427297. arXiv:2010.06404.
459
- [10] Vastel, A., Laperdrix, P., Rudametkin, W., and Rouvoy, R.
460
- "FP-STALKER: Tracking Browser Fingerprint Evolutions."
461
- IEEE Symposium on Security and Privacy (S&P), pp. 728-741, 2018.
462
- DOI: 10.1109/SP.2018.00008.
463
- Raw dataset (~21,809 fingerprints, 40 attributes):
464
- github.com/Spirals-Team/FPStalker.
465
- [11] Tillmann, H. "Browser Fingerprinting: 93% der Nutzer hinterlassen
466
- eindeutige Spuren." Technical report, henning-tillmann.de, October
467
- 2013. Dataset redistributed as part of the BrFAST assets [8].
468
-
469
-
470
-
471
- ================================================================================
472
- Generated: 2026-04-26 02:30:00
473
- Data source: 19 merged eval_*.jsonl files (68,885 raw configs from
474
- overnight runs 2026-03-22 through 2026-04-25, including the
475
- complete 540-row fpstalker block from the systemd-service
476
- resume run 2026-04-19); excluding cybersec_intrusion from
477
- aggregates (54,281 in-scope configs).
478
- ================================================================================