arXiv:2510.03662cs.LGcs.AI2025-10被引 10

提出可量化隐私最小化的框架,让大模型只说必要信息

Operationalizing Data Minimization for Privacy-Preserving LLM Prompting

  • 构建隐私有序变换空间,用优先队列搜索最优披露点
  • 大模型可容忍85.7%信息删减仍保质量,小模型仅19.3%
  • 发现模型普遍过度暴露信息,暴露能力缺陷而非仅隐私不足

大型语言模型在消费应用中频繁交互个人数据,用户常因获取有用响应而提供过多信息,增加通过记忆、上下文个性化或安全漏洞泄露隐私的风险。本文提出一个形式化并可操作的数据最小化框架:针对给定用户提示与响应模型,量化维持任务效用所需的最低隐私泄露披露量,并设计基于优先队列的树搜索算法,在隐私有序变换空间中定位最优披露点。我们在四个数据集上评估,涵盖开放式对话(ShareGPT、WildChat)和单答案知识密集型任务(CaseHold、MedQA),使用九个LLM作为响应模型,量化了可实现的数据最小化程度。结果表明,更大规模的前沿模型比小型开源模型更能承受强数据最小化,如GPT-5可删除85.7%信息而保持任务质量,而Qwen2.5-0.5B仅为19.3%。与我们搜索得到的基准比较发现,当前模型难以直接预测最优最小化策略,表现出抽象倾向导致的信息过度披露。这揭示的不仅是隐私差距,更是能力差距:模型可能缺乏对自身完成任务所需信息的认知。

原文摘要 · Abstract (English)

The rapid deployment of large language models (LLMs) in consumer applications has led to frequent exchanges of personal information. To obtain useful responses, users often share more than necessary, increasing privacy risks via memorization, context-based personalization, or security breaches. We present a framework to formally define and operationalize data minimization: for a given user prompt and response model, quantifying the least privacy-revealing disclosure that maintains utility, and we propose a priority-queue tree search to locate this optimal point within a privacy-ordered transformation space. We evaluated the framework on four datasets spanning open-ended conversations (ShareGPT, WildChat) and knowledge-intensive tasks with single-ground-truth answers (CaseHold, MedQA), quantifying achievable data minimization with nine LLMs as the response model. Our results demonstrate that larger frontier LLMs can tolerate stronger data minimization while maintaining task quality than smaller open-source models (85.7% redaction for GPT-5 vs. 19.3% for Qwen2.5-0.5B). By comparing with our search-derived benchmarks, we find that LLMs struggle to predict optimal data minimization directly, showing a bias toward abstraction that leads to oversharing. This suggests not just a privacy gap, but a capability gap: models may lack awareness of what information they actually need to solve a task.

隐私保护大模型数据最小化提示工程

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。