paperbot · PL 论文追踪

全部论文 待读 收藏

P2 Deciding Differential Privacy for Programs with Finite Inputs and Outputs

判定具有有限输入和输出的程序的差分隐私
LICS Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science2020匹配度 4/10 · 论文属于程序形式化分析与隐私验证,涉及逻辑/自动机方法判定差分隐私,与用户关注的程序分析和形式化验证有间接关联;但它不涉及 LLM/Agent、浮点程序分析或贝叶斯程序分析,也不是面向 ML 系统与 Agentic 程序的静态分析主线,因此匹配度有限。引用 24 inbox
Gilles Barthe, Rohit Chadha, Vishal Jagannath, A. Prasad Sistla, Mahesh Viswanathan
crossref: 2026-09-12

AI 速览

一句话:针对有限输入输出程序,研究差分隐私判定的可判定性,填补逻辑与统计方法回避的基础问题。

差分隐私是含私有数据数据库统计计算的事实标准,其优势在于同时保障个体隐私与提供准确统计结果。由于其数学定义,差分隐私也适合形式分析:已有大量工作用逻辑方法证明隐私,近期又有统计方法发现隐私违反,但这些方法虽实用,却回避了根本的可判定性问题。本文聚焦输入和输出均有限的程序,研究其差分隐私判定问题的可判定性。论文旨在从判定角度弥补现有逻辑证明与统计检测之间的理论空白,为有限输入输出程序上的隐私验证提供可判定性基础。

问题
现有逻辑方法可证明差分隐私,统计方法可发现违反,但二者都未回答差分隐私判定是否可判定;论文研究有限输入输出程序上的这一根本问题。
方法
从可判定性角度形式化有限输入输出程序的差分隐私判定问题,并分析其可判定性。
评估
摘要未报告实验评估;论文以可判定性理论分析为核心。
原文摘要(Abstract)

Differential privacy is a de facto standard for statistical computations over databases that contain private data. Its main and rather surprising strength is to guarantee individual privacy and yet allow for accurate statistical results. Thanks to its mathematical definition, differential privacy is also a natural target for formal analysis. A broad line of work develops and uses logical methods for proving privacy. A more recent and complementary line of work uses statistical methods for finding privacy violations. Although both lines of work are practically successful, they elide the fundamental question of decidability.

链接与引用

DOI 原文 ·

BibTeX
@inproceedings{paperbot5545,
  title = {Deciding Differential Privacy for Programs with Finite Inputs and Outputs},
  author = {Gilles Barthe and Rohit Chadha and Vishal Jagannath and A. Prasad Sistla and Mahesh Viswanathan},
  booktitle = {LICS},
  year = {2020},
  doi = {10.1145/3373718.3394796}
}