Review of: Distributed Computing Through Combinatorial Topology by Maurice Herlihy and Dmitry Kozlov and Sergio Rajsbaum. SIGACT News 47(2): 18-20 (2016) 

Continual Counting with Gradual Privacy Expiration (with Joel Andersson, Monika Henzinger, Rasmus Pagh, and Teresa Steiner)

Optimality of Matrix Mechanism (with Jingcheng Liu and Zongrui Zou) 

Almost linear time differentially private release of synthetic graphs (with Jingcheng Liu and Zongrui Zou)

2024

• Differentially Private Decentralized Learning with Random Walks (with Aurelien Bellet and Edwige Cyffers). In ICML, 2024.

• Discrepancy of Shortest Path (with Greg Bodwin, Chengyuan Deng, Gary Hoppenworth,  Jie Gao, and Chen Wang). In ICALP, 2024.

• A Unifying Framework for Differentially Private Sums Under Continual Observation (with Monika Henzinger and Sarvagya Upadhyay). In SODA 2024. 

• Optimal Bounds on Private Graph Approximation (with Jingcheng Liu and Zongrui Zou). In SODA 2024.

2023 

• Differentially Private Range Query on Shortest Paths (with Chengyuan Deng, Jie Gao, and Chen Wang). In WADS, 2023.

• Langevin Diffusion: An Almost Universal Algorithm for Private Euclidean (Convex) Optimization (with Arun Ganesh and Abhradeep Thakurta). In COLT, 2023.

• Constant matters: Fine-grained Complexity of Differentially Private Continual Observation (with Hendrik Fichtenberger and  Monika Henzinger). In ICML, 2023.

• Almost Exact Error Bound on Differentially Private Continual Counting (with Monika Henzinger and Sarvagya Upadhyay). In SODA, 2023

2021

• A Framework for Private Matrix Analysis (with Sarvagya Upadhyay). In ICML, 2021. 

• Differentially Private Analysis on Graph Streams (with Raman Arora and Sarvagya Upadhyay). In AISTATS, 2021 (oral presentation).

2020

• Numerical Linear Algebra in the Sliding Window Model (with Vladimir Braverman, Petros Drineas, Cameron Musco, Christopher Musco, David Woodruff, and Samson Zhou). In FOCS, 2020.

2019

• Differentially private Graph Sparsification and its Applications (with Raman Arora). In NeurIPS, 2019.

• Sublinear Space Private Algorithms Under the Sliding Window Model. In ICML, 2019.

2018

• Differentially Private Robust PCA (with Raman Arora and Vladimir Braverman). In NeurIPS, 2018.

• The Price of Differential Privacy for Low-Rank Factorization. In NeurIPS, 2018.

2017 and before 

• Is Interaction Necessary for Distributed Private Learning? (with Adam Smith and Abhradeep Thakurta) In IEEE Symposium on Security and Privacy, 2017.

• Block-Wise Non-Malleable Codes (with Nishanth Chandran, Vipul Goyal, Omkant Pandey and Pratyay Mukherjee). In ICALP, 2016.

• Random Projections, Graph Sparsification, and Differential Privacy. In ASIACRYPT, 2013. 

Multi-prover Proof-of-Retrievability (with Maura Paterson and Douglas Stinson). Journal of Mathematical Cryptology: 12 (4), 2018.

Is Extracting Data Same as Possession? (with Douglas Stinson). Journal of Mathematical Cryptology: 8(2), 2014.

A coding theory foundation for the analysis of general unconditionally secure proof-of-retrievability schemes for cloud storage (with Maura Paterson and Douglas Stinson).  Journal of Mathematical Cryptology: 7(3), 2013.

On the complexity of the herding attack and some related attacks on hash functions (with Simon Blackburn and Douglas Stinson). Design, Codes, and Cryptography: 64 (1--2), 2012.