3 citations · 8 across the 15 of their papers we have counts for
Showing 2025Show all
2 papers · 1 filter
cs.IT2025
-Diversity: Linkage-Robustness via a Composition Theorem
V. Arvind Rameshwar, Anshoo Tandon
In this paper, we consider the problem of degradation of anonymity upon linkages of anonymized datasets. We work in the setting where an adversary links together anonymiz…
cs.IT2025
Bounding User Contributions for User-Level Differentially Private Mean Estimation
V. Arvind Rameshwar, Anshoo Tandon
We revisit the problem of releasing the sample mean of bounded samples in a dataset, privately, under user-level -differential privacy (DP). We aim to derive the optim…