3 citations · 8 across the 15 of their papers we have counts for
12 papers · 1 filter
-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…
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…
Optimal Tree-Based Mechanisms for Differentially Private Approximate CDFs
V. Arvind Rameshwar, Anshoo Tandon, Abhay Sharma
This paper considers the -differentially private (DP) release of an approximate cumulative distribution function (CDF) of the samples in a dataset. We assume that the…
On the Bee-Identification Error Exponent with Absentee Bees
Anshoo Tandon, Vincent Y. F. Tan, Lav R. Varshney
The "bee-identification problem" was formally defined by Tandon, Tan and Varshney [IEEE Trans. Commun. (2019) [Online early access]], and the error exponent was studied. This work…
Error Exponent Bounds for the Bee-Identification Problem
Anshoo Tandon, Vincent Y. F. Tan, Lav R. Varshney
Consider the problem of identifying a massive number of bees, uniquely labeled with barcodes, using noisy measurements. We formally introduce this `bee-identification problem', def…
Generalized Sphere-Packing Bound for Subblock-Constrained Codes
Han Mao Kiah, Anshoo Tandon, Mehul Motani
We apply the generalized sphere-packing bound to two classes of subblock-constrained codes. A la Fazeli et al. (2015), we made use of automorphism to significantly reduce the numbe…