BriefGPT.xyz
Jul, 2023
利用填充和置换指纹码的差分隐私算法平滑下界
Smooth Lower Bounds for Differentially Private Algorithms via Padding-and-Permuting Fingerprinting Codes
HTML
PDF
Naty Peter, Eliad Tsfadia, Jonathan Ullman
TL;DR
本论文提出了一种简单的方法来生成困难实例,并利用该方法在不同情境下提供了新的差分隐私(DP)下界,其中主要的技术是将padding-and-permuting变换应用于fingerprinting code。
Abstract
fingerprinting arguments
, first introduced by Bun, Ullman, and Vadhan (STOC 2014), are the most widely used method for establishing
lower bounds
on the sample complexity or error of approximately differentially p
→