Accurate privacy evaluation of textual data remains a critical challenge in privacy-preserving natural language processing. Recent work has shown that large language models (LLMs) can serve as reliable privacy evaluators, achieving strong agreement with human judgments; however, their computational cost and impracticality for processing sensitive data at scale limit real-world deployment. We address this gap by distilling the privacy assessment capabilities of Mistral Large 3 (675B) into lightweight encoder models with as few as 150M parameters. Leveraging a large-scale dataset of privacy-annotated texts spanning 10 diverse domains, we train efficient classifiers that preserve strong agreement with human annotations while dramatically reducing computational requirements. We validate our approach on human-annotated test data and demonstrate its practical utility as an evaluation metric for de-identification systems.
Figures & tables
Dataset
Avg tokens
Sˉ
% Priv.
MHB
272
3.31
77.4
RMHP
225
2.92
64.7
RC
306
2.89
60.6
RLA
283
2.84
60.3
MQ
136
2.34
44.6
EE
332
2.16
33.5
Table 2: Per-dataset statistics, sorted by mean privacy score. Avg tokens: mean BPE token count. Sˉ : mean teacher-assigned privacy score (1–5). % Priv.: percentage of texts rated ≥3 (Somewhat private or above).
Model
Params
Acc. ↑
Macro F1 ↑
MAE ↓
Per-class F1 ↑
C1
C2
C3
C4
C5
Ettin-150M
149M
74.9
68.1
0.28
91.5
58.3
58.5
63.6
68.6
ModernBERT-base
149M
73.7
67.2
0.28
91.9
57.4
57.7
62.8
68.2
BERT-base
110M
73.3
65.9
0.29
91.3
55.4
55.7
60.6
66.4
Ettin-17M
17M
71.1
62.5
0.34
90.1
51.2
52.8
57.5
60.7
Table 4: Classification performance on the held-out test set. Accuracy and F1 scores are in %. MAE is the mean absolute error on the 1–5 ordinal scale (range: 0–4). All encoder models are trained with identical hyperparameters. For reference, a Majority Class baseline achieves 45.9% accuracy (12.5 macro F1), while a Random baseline achieves 20.0% accuracy (18.0 macro F1).
Condition
Sˉ
Δ
% Class 1
Original
3.25
–
25.2
Mask direct
2.91
0.34
30.5
Mask quasi
3.02
0.23
28.5
Mask ALL
1.39
1.86
84.1
Mask 30% random
3.56
-0.31
17.3
Table 6: Privacy scores on TAB test set. Sˉ : mean score (1–5). Δ : reduction from original. % Class 1: proportion rated “Harmless.”
Current LLM-based services typically require users to submit raw text regardless of its sensitivity. While intuitive, such practice introduces substantial privacy risks, as unauthorized access may expose personal, medical, or legal information. Although prior defenses strived to mitigate these risks, they often incur substantial computational overhead and degrade model performance. To overcome this privacy-efficiency trade-off, we introduce Privacy-Preserving Fine-Tuning (PPFT), a novel training pipeline that eliminates the need for transmitting raw prompt text while maintaining a favorable balance between privacy preservation and model utility for both clients and service providers. Our approach operates in two stages: first, we train a client-side encoder together with a server-side projection module and LLM, enabling the server to condition on k-pooled prompt embeddings instead of raw text; second, we fine-tune the projection module and LLM on private, domain-specific data using noise-injected embeddings, allowing effective adaptation without exposing plain text prompts and requiring access to the decoder's internal parameters. Extensive experiments on domain-specific and general benchmarks demonstrate that PPFT achieves a striking balance between privacy and utility, maintaining competitive performance with minimal degradation compared to noise-free upper bounds.
Jeongho Yoon, Chanhee Park, Yongchan Chun +2
Department of Computer Science and Engineering, Korea University · Samsung Mobile eXperience Business
Assessing the privacy of large language models (LLMs) presents significant challenges. In particular, most existing methods for auditing differential privacy require the insertion of specially crafted canary data during training, making them impractical for auditing already-trained models without costly retraining. Additionally, dataset inference, which audits whether a suspect dataset was used to train a model, is infeasible without access to a private non-member held-out dataset. Yet, such held-out datasets are often unavailable or difficult to construct for real-world cases since they have to be from the same distribution (IID) as the suspect data. These limitations severely hinder the ability to conduct scalable, post-hoc audits. To enable such audits, this work introduces natural identifiers (NIDs) as a novel solution to the above-mentioned challenges. NIDs are structured random strings, such as cryptographic hashes and shortened URLs, naturally occurring in common LLM training datasets. Their format enables the generation of unlimited additional random strings from the same distribution, which can act as alternative canaries for audits and as same-distribution held-out data for dataset inference. Our evaluation highlights that indeed, using NIDs, we can facilitate post-hoc differential privacy auditing without any retraining and enable dataset inference for any suspect dataset containing NIDs without the need for a private non-member held-out dataset.
Lorenzo Rossi, Bartłomiej Marek, Franziska Boenisch +1
Large language model (LLM)-based personal agents are increasingly deployed to handle everyday tasks on users' behalf. These agents have access to private user information, while their tasks involve communicating with third parties; this raises a critical privacy concern that agents may inappropriately reveal sensitive user information to these recipients. Existing benchmarks primarily assess direct privacy leakage, where an agent explicitly states a pre-specified secret or attribute. However, they do not capture inferential leakage, where the model leaves indirect cues in the reply that implicitly leaks sensitive attributes. We introduce InferPriv, a benchmark that measures whether an honest-but-curious recipient can infer a user's sensitive attributes from an LLM's reply on routine task. Evaluating five frontier models, we find that inferential leakage substantially exceeds direct leakage across models and prompts. Under a privacy-aware system prompt, GPT-6.1-Sol, Sonnet-5.5, and Gemini-3.8-Flash achieve near-zero direct leakage, yet the inferential leakage rate remains between 16.2--25.2%. These findings suggest that evaluating explicit leakage alone can substantially understate the privacy risks.
Pengrun Huang, Yiwei Fu, Luoxi Meng +1
UC San Diego · University of Illinois Urbana-Champaign