Jalaj Upadhyay

According to our database1, Jalaj Upadhyay authored at least 31 papers between 2012 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Differentially Private Decentralized Learning with Random Walks.
CoRR, 2024

The Discrepancy of Shortest Paths.
CoRR, 2024

Optimal Bounds on Private Graph Approximation.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

A Unifying Framework for Differentially Private Sums under Continual Observation.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023
Differentially Private Range Query on Shortest Paths.
Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

Almost Tight Error Bounds on Differentially Private Continual Counting.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Constant Matters: Fine-grained Error Bound on Differentially Private Continual Observation.
Proceedings of the International Conference on Machine Learning, 2023

Universality of Langevin Diffusion for Private Optimization, with Applications to Sampling from Rashomon Sets.
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

2022
Constant matters: Fine-grained Complexity of Differentially Private Continual Observation Using Completely Bounded Norms.
IACR Cryptol. ePrint Arch., 2022

Langevin Diffusion: An Almost Universal Algorithm for Private Euclidean (Convex) Optimization.
CoRR, 2022

2021
A Framework for Private Matrix Analysis in Sliding Window Model.
Proceedings of the 38th International Conference on Machine Learning, 2021

Differentially Private Analysis on Graph Streams.
Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

2020
A Framework for Private Matrix Analysis.
CoRR, 2020

Near Optimal Linear Algebra in the Online and Sliding Window Models.
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

2019
On Differentially Private Graph Sparsification and Applications.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Sublinear Space Private Algorithms Under the Sliding Window Model.
Proceedings of the 36th International Conference on Machine Learning, 2019

2018
The Price of Privacy for Low-rank Factorization.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Differentially Private Robust Low-Rank Approximation.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

2017
Is Interaction Necessary for Distributed Private Learning?
Proceedings of the 2017 IEEE Symposium on Security and Privacy, 2017

2016
Review of: Distributed Computing Through Combinatorial Topology by Maurice Herlihy and Dmitry Kozlov and Sergio Rajsbaum.
SIGACT News, 2016

Multi-prover Proof-of-Retrievability.
IACR Cryptol. ePrint Arch., 2016

On Low-Space Differentially Private Low-rank Factorization in the Spectral Norm.
CoRR, 2016

Fast and Space-optimal Low-rank Factorization in the Streaming Model With Application in Differential Privacy.
CoRR, 2016

2015
Integrity and Privacy of Large Data.
PhD thesis, 2015

Block-wise Non-Malleable Codes.
IACR Cryptol. ePrint Arch., 2015

2014
Differentially Private Linear Algebra in the Streaming Model.
IACR Cryptol. ePrint Arch., 2014

Circulant Matrices and Differential Privacy.
CoRR, 2014

2013
Random Projections, Graph Sparsification, and Differential Privacy.
IACR Cryptol. ePrint Arch., 2013

Is extracting data the same as possessing data?
IACR Cryptol. ePrint Arch., 2013

2012
A coding theory foundation for the analysis of general unconditionally secure proof-of-retrievability schemes for cloud storage.
IACR Cryptol. ePrint Arch., 2012

On the complexity of the herding attack and some related attacks on hash functions.
Des. Codes Cryptogr., 2012


  Loading...