강화를 통해 그룹 프라이버시를 강화하고, 샘플링을 통한 통합된 증폭을 통해 Rényi Differential Privacy를 다룹니다.
Efficiently implementing optimal K-norm mechanisms for Sum, Count, and Vote with Elliptic Gaussian Noise.
Lower bounds for differential privacy under continual observation and online threshold queries are crucial for understanding the price of privacy over time.
There can be significant differences in privacy guarantees between different batch sampling methods in DP-SGD mechanisms.
Pure-DP bounds for Gaussian selection mechanisms with bounded queries.
Synthetic trajectory data generation offers privacy while maintaining utility, but current solutions lack formal privacy guarantees and face limitations in practical evaluations.
The author explores the joint study of group privacy and amplification by subsampling in the context of Rényi-DP, providing a unified framework for deriving guarantees. This approach leads to novel and tight guarantees for various mechanisms.
The authors introduce the Independent Component Laplace Process (ICLP) mechanism to achieve pure differential privacy for functional summaries, addressing limitations of existing mechanisms by treating summaries as truly infinite-dimensional objects.