arXiv:2604.12431cs.CRcs.DB2026-04

让数据外包匿名化过程可验证,防篡改且保留数据价值。

VeriX-Anon: A Multi-Layered Framework for Mathematically Verifiable Outsourced Target-Driven Data Anonymization

  • 分三层验证:哈希树、边界哨兵与双胞胎、可解释AI指纹比对。
  • 28种场景中检测出27处异常,零误报,单层无法达成此效果。
  • 适合需严格验证数据安全的金融、医疗等高隐私领域使用。

组织日益将敏感数据处理外包给云服务商,但缺乏有效机制验证其是否按约执行。VeriX-Anon 是一个针对目标驱动 k-匿名化的多层可验证框架,融合三种独立机制:通过认证决策树的梅尔克式哈希实现确定性验证;通过边界哨兵与带加密标识的完全重复双胞胎实现概率验证;通过可解释AI指纹比对(用沃尔瑟斯坦距离比较匿名前后的SHAP值分布)实现效用验证。在七个跨域数据集和四种云配置(共28个场景)下,面对懒惰型(丢弃记录)、愚笨型(伪造哈希)、近似型(有效哈希)攻击者,固定阈值下检出25/28偏差,调参后达27/28,无误报。单一层级无法达成此效果。XAI层是唯一识别近似型攻击的机制,在七数据集中成功六次,仅在高维情况下因诚实泛化导致的SHAP变化掩盖了攻击。目标驱动匿名化显著优于盲切分,平均F1提升0.058至0.362,六组数据显著性检验p≤0.001。客户端验证耗时低于1秒(百万行数据)。威胁模型涵盖三类实证攻击及一种理论上的知情攻击(无法破解加密盐)。哨兵规避概率为0至0.82(最不平衡数据),孪生层在所有场景中均予以补偿。

原文摘要 · Abstract (English)

Organisations increasingly outsource privacy-sensitive data transformations to cloud providers, yet no practical mechanism lets the data owner verify that the contracted algorithm was faithfully executed. VeriX-Anon is a multi-layered verification framework for outsourced Target-Driven k-anonymization combining three orthogonal mechanisms: deterministic verification via Merkle-style hashing of an Authenticated Decision Tree, probabilistic verification via Boundary Sentinels and exact-duplicate Twins with cryptographic identifiers, and utility-based verification via Explainable AI fingerprinting that compares SHAP value distributions before and after anonymization using the Wasserstein distance. Across seven cross-domain datasets and four cloud profiles (28 scenarios), against Lazy (drops records), Dumb (fake hash), and Approximate (valid hash) adversaries, VeriX-Anon detects 25 of 28 deviations under a fixed threshold and 27 of 28 once the threshold is calibrated per dataset, with no false alarms. No single layer achieved this alone. The XAI layer was the only mechanism that caught the Approximate adversary, succeeding on six of seven datasets and missing only a high-dimensional case where honest generalization shifts SHAP as much as the attack. Target-Driven anonymization preserved significantly more utility than blind splitting, with mean F1 gaps of +0.058 to +0.362 and Wilcoxon p <= 0.001 on six of seven datasets. Client-side verification completes under one second at one million rows. The threat model covers three empirically evaluated profiles and one theoretical Informed Attacker unable to defeat the cryptographic salt. Sentinel evasion probability ranges from near-zero to 0.82 for the most imbalanced data, which the twin layer offsets in every scenario.

数据匿名化可验证计算隐私保护AI可解释性

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