让大模型当数据管家,按规则回答问题不泄露敏感信息
DAVE: A Policy-Enforcing LLM Spokesperson for Secure Multi-Document Data Sharing
- 用自然语言接口代替直接传文档,查询时动态屏蔽敏感内容
- 通过策略约束确保回答不越界,支持多机构数据安全共享
- 适合需要精细控权的跨组织数据协作场景
当前跨组织数据空间中,使用政策通常在资产级别强制执行:整个文档或数据集要么共享,要么不共享。当文档仅部分敏感时,提供方为避免泄露受保护信息,通常需手动删减文档再共享,这成本高、粒度粗且难以维护。本文提出DAVE,一个政策强制的大语言模型发言人,代表数据提供方回答私有文档相关的问题。提供方不发布文档,而是开放一个受机器可读策略约束的自然语言接口。我们形式化了该场景下的违规信息泄露问题,结合使用控制与信息流安全理论,引入虚拟删减机制:在查询时动态抑制敏感信息,无需修改源文档。我们描述了将此类发言人集成到Eclipse Dataspace Components与ODRL风格策略中的架构,并初步实现提供方侧原型,其中问答请求经由发言人服务处理,而非触发原始文档传输。贡献主要在于架构设计,尚未实现完整执行管道的实证评估。因此,我们提出一种评估方法,用于未来系统性研究良性与对抗性查询下安全、可用性与性能的权衡。
原文摘要 · Abstract (English)
In current inter-organizational data spaces, usage policies are enforced mainly at the asset level: a whole document or dataset is either shared or withheld. When only parts of a document are sensitive, providers who want to avoid leaking protected information typically must manually redact documents before sharing them, which is costly, coarse-grained, and hard to maintain as policies or partners change. We present DAVE, a usage policy-enforcing LLM spokesperson that answers questions over private documents on behalf of a data provider. Instead of releasing documents, the provider exposes a natural language interface whose responses are constrained by machine-readable usage policies. We formalize policy-violating information disclosure in this setting, drawing on usage control and information flow security, and introduce virtual redaction: suppressing sensitive information at query time without modifying source documents. We describe an architecture for integrating such a spokesperson with Eclipse Dataspace Components and ODRL-style policies, and outline an initial provider-side integration prototype in which QA requests are routed through a spokesperson service instead of triggering raw document transfer. Our contribution is primarily architectural: we do not yet implement or empirically evaluate the full enforcement pipeline. We therefore outline an evaluation methodology to assess security, utility, and performance trade-offs under benign and adversarial querying as a basis for future empirical work on systematically governed LLM access to multi-party data spaces.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。