arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2610.15972cs.ITmath.IT
收藏

支持受限随机响应的精确隐私-失真设计

Exact Privacy--Distortion Design of Support-Constrained Randomized Response

KTH Royal Institute of Technology(皇家理工学院);UNSW Canberra(新南威尔士大学堪培拉分校)

Amirreza Zamani, Parastoo Sadeghi, Mikael Skoglund

AI总结:

针对有序字母表上全支持局部随机化器的不必要报告失真问题,研究输出受限的随机响应机制,推导其精确hockey-stick缺陷,求解联合设计并刻画隐私与失真的权衡关系。

摘要:

全支持局部随机化器在有序字母表上会产生不必要的报告失真。我们研究输出被限制在私有输入的半径为t邻域内的随机响应。依赖输入的支持在其边界处造成隐私泄露,因此普通似然比校准不再足够。在限制于距离至多为H的输入对的近似局部隐私下,我们推导了该机制的精确 hockey-stick 缺陷。随后我们求解真实概率、非真实概率和支持半径的联合设计。固定半径的最优解以闭式形式存在,而全局最优解仅需一维整数搜索。我们刻画了隐私下限及其倒数,即报告失真预算下可达到的最小缺陷。我们进一步证明,严格的近似隐私迫使支持规模按Ω(H/δ)缩放。确定性评估说明了由此产生的权衡。

英文摘要:

Full-support local randomizers can incur unnecessary reporting distortion on ordered alphabets. We study randomized response whose output is restricted to a radius-$t$ neighborhood of the private input. Input-dependent supports create privacy leakage at their boundaries, so ordinary likelihood-ratio calibration is no longer sufficient. Under approximate local privacy restricted to input pairs at distance at most $H$, we derive the exact hockey-stick defect of the mechanism. We then solve the joint design of the truthful probability, off-truth probability, and support radius. The fixed-radius optimum is available in closed form, while the global optimum requires only a one-dimensional integer search. We characterize both the privacy floor and its inverse, namely the smallest defect attainable under a reporting-distortion budget. We further prove that stringent approximate privacy forces the support size to scale as $Ω(H/δ)$. Deterministic evaluations illustrate the resulting tradeoff.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑