局部差分隐私的鲁棒优化
Robust Optimization for Local Differential Privacy
摘要:
我们考虑在不泄露敏感信息的情况下发布数据的设置。我们这样做的鲁棒本地差分隐私(RLDP)的框架。这确保了不确定性集中所有数据分布的隐私性。我们制定的问题,找到最佳的数据发布协议作为一个强大的优化问题。通过推导出封闭形式的表达式,我们得到一个凸优化问题。我们比较了四种可能的优化问题的性能,这取决于我们是否需要i)效用和ii)隐私的鲁棒性。
英文摘要:
We consider the setting of publishing data without leaking sensitive information. We do so in the framework of Robust Local Differential Privacy (RLDP). This ensures privacy for all distributions of the data in an uncertainty set. We formulate the problem of finding the optimal data release protocol as a robust optimization problem. By deriving closed-form expressions for the duals of the constraints involved we obtain a convex optimization problem. We compare the performance of four possible optimization problems depending on whether or not we require robustness in i) utility and ii) privacy.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。