Andres Munoz Medina
Research Subjects
Research Interests
Andres Munoz Medina has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Alessandro Epasto
Google research
3 shared publications - Vahab Mirrokni
Google research
3 shared publications - Adel Javanmard
Department of Data Sciences and Operations University of Southern California
2 shared publications - Josh Karlin
Google Chrome, Boston, MA, USA
2 shared publications - Peilin Zhong
Google Research, New York, NY, USA
2 shared publications - Sergei Vassilvitskii
Google Research, New York, NY, USA
2 shared publications
Latest Publications
- Open Access
- 3 August 2025
- Published by Association for Computing Machinery (ACM)
- p. 5379-5390
Differentially Private Synthetic Data Release for Topics API Outputs
- 3 August 2025
- Published by Association for Computing Machinery (ACM)
- p. 5379-5390
Open AccessDifferentially Private Synthetic Data Release for Topics API Outputs
- Open Access
- 13 May 2024
- Published by Association for Computing Machinery (ACM)
- p. 621-624
Smooth Anonymity for Sparse Graphs
- 13 May 2024
- Published by Association for Computing Machinery (ACM)
- p. 621-624
Open AccessSmooth Anonymity for Sparse Graphs
- Open Access
- 13 June 2023
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 1 (2) , 1-26
Measuring Re-identification Risk
Compact user representations (such as embeddings) form the backbone of personalization services. In this work, we present a new theoretical framework to measure re-identification risk in such user representations. Our framework, based on hypothesis testing, formally bounds the probability that an attacker may be able to obtain the identity of a user from their representation. As an application, we show how our framework is general enough to model important real-world applications such as the Chrome's Topics API for interest-based advertising. We complement our theoretical bounds by showing provably good attack algorithms for re-identification that we use to estimate the re-identification risk in the Topics API. We believe this work provides a rigorous and interpretable notion of re-identification risk and a framework to measure it that can be used to inform real-world applications.
- 13 June 2023
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 1 (2) , 1-26
Open AccessMeasuring Re-identification Risk
Compact user representations (such as embeddings) form the backbone of personalization services. In this work, we present a new theoretical framework to measure re-identification risk in such user representations. Our framework, based on hypothesis testing, formally bounds the probability that an attacker may be able to obtain the identity of a user from their representation. As an application, we show how our framework is general enough to model important real-world applications such as the Chrome's Topics API for interest-based advertising. We complement our theoretical bounds by showing provably good attack algorithms for re-identification that we use to estimate the re-identification risk in the Topics API. We believe this work provides a rigorous and interpretable notion of re-identification risk and a framework to measure it that can be used to inform real-world applications.