Jalaj Upadhyay

Publication Activity (10 Years)

Years Active: 2010-2024
Publications (10 Years): 36

Top Venues

CoRR

IACR Cryptol. ePrint Arch.

SODA

ICML

University of Waterloo, Ontario, Canada (PHD)

Education History

University of Waterloo, Ontario, Canada

PHD

Publications

Jingcheng Liu, Jalaj Upadhyay, Zongrui Zou
-metric. CoRR (2024)
Greg Bodwin, Chengyuan Deng, Jie Gao, Gary Hoppenworth, Jalaj Upadhyay, Chen Wang
The Discrepancy of Shortest Paths. ICALP (2024)
Greg Bodwin, Chengyuan Deng, Jie Gao, Gary Hoppenworth, Jalaj Upadhyay, Chen Wang
The Discrepancy of Shortest Paths. CoRR (2024)
Jingcheng Liu, Jalaj Upadhyay, Zongrui Zou
Almost linear time differentially private release of synthetic graphs. CoRR (2024)
Monika Henzinger, Jalaj Upadhyay, Sarvagya Upadhyay
A Unifying Framework for Differentially Private Sums under Continual Observation. SODA (2024)
Jingcheng Liu, Jalaj Upadhyay, Zongrui Zou
Optimal Bounds on Private Graph Approximation. SODA (2024)
Edwige Cyffers, Aurélien Bellet, Jalaj Upadhyay
Differentially Private Decentralized Learning with Random Walks. CoRR (2024)
Joel Daniel Andersson, Monika Henzinger, Rasmus Pagh, Teresa Anna Steiner, Jalaj Upadhyay
Continual Counting with Gradual Privacy Expiration. CoRR (2024)
Chengyuan Deng, Jie Gao, Jalaj Upadhyay, Chen Wang
Differentially Private Range Query on Shortest Paths. WADS (2023)
Monika Henzinger, Jalaj Upadhyay, Sarvagya Upadhyay
Almost Tight Error Bounds on Differentially Private Continual Counting. SODA (2023)
Monika Henzinger, Jalaj Upadhyay, Sarvagya Upadhyay
A Unifying Framework for Differentially Private Sums under Continual Observation. CoRR (2023)
Jingcheng Liu, Jalaj Upadhyay, Zongrui Zou
Optimal Bounds on Private Graph Approximation. CoRR (2023)
Hendrik Fichtenberger, Monika Henzinger, Jalaj Upadhyay
Constant Matters: Fine-grained Error Bound on Differentially Private Continual Observation. ICML (2023)
Arun Ganesh, Abhradeep Thakurta, Jalaj Upadhyay
Universality of Langevin Diffusion for Private Optimization, with Applications to Sampling from Rashomon Sets. COLT (2023)
Monika Henzinger, Jalaj Upadhyay
Constant matters: Fine-grained Complexity of Differentially Private Continual Observation Using Completely Bounded Norms. IACR Cryptol. ePrint Arch. 2022 (2022)
Arun Ganesh, Abhradeep Thakurta, Jalaj Upadhyay
Langevin Diffusion: An Almost Universal Algorithm for Private Euclidean (Convex) Optimization. CoRR (2022)
Monika Henzinger, Jalaj Upadhyay, Sarvagya Upadhyay
Almost Tight Error Bounds on Differentially Private Continual Counting. CoRR (2022)
Monika Henzinger, Jalaj Upadhyay
Constant matters: Fine-grained Complexity of Differentially Private Continual Observation Using Completely Bounded Norms. CoRR (2022)
Jalaj Upadhyay, Sarvagya Upadhyay
A Framework for Private Matrix Analysis in Sliding Window Model. ICML (2021)
Jalaj Upadhyay, Sarvagya Upadhyay, Raman Arora
Differentially Private Analysis on Graph Streams. AISTATS (2021)
Jalaj Upadhyay, Sarvagya Upadhyay
A Framework for Private Matrix Analysis. CoRR (2020)
Vladimir Braverman, Petros Drineas, Cameron Musco, Christopher Musco, Jalaj Upadhyay, David P. Woodruff, Samson Zhou
Near Optimal Linear Algebra in the Online and Sliding Window Models. FOCS (2020)
Jalaj Upadhyay
Sublinear Space Private Algorithms Under the Sliding Window Model. ICML (2019)
Raman Arora, Jalaj Upadhyay
On Differentially Private Graph Sparsification and Applications. NeurIPS (2019)
Jalaj Upadhyay
The Price of Privacy for Low-rank Factorization. NeurIPS (2018)
Maura B. Paterson, Douglas R. Stinson, Jalaj Upadhyay
Multi-prover proof of retrievability. J. Math. Cryptol. 12 (4) (2018)
Vladimir Braverman, Petros Drineas, Cameron Musco, Christopher Musco, Jalaj Upadhyay, David P. Woodruff, Samson Zhou
Near Optimal Linear Algebra in the Online and Sliding Window Models CoRR (2018)
Raman Arora, Vladimir Braverman, Jalaj Upadhyay
Differentially Private Robust Low-Rank Approximation. NeurIPS (2018)
Adam D. Smith, Abhradeep Thakurta, Jalaj Upadhyay
Is Interaction Necessary for Distributed Private Learning? IEEE Symposium on Security and Privacy (2017)
Nishanth Chandran, Vipul Goyal, Pratyay Mukherjee, Omkant Pandey, Jalaj Upadhyay
Block-Wise Non-Malleable Codes. ICALP (2016)
Maura B. Paterson, Douglas R. Stinson, Jalaj Upadhyay
Multi-prover Proof-of-Retrievability. IACR Cryptol. ePrint Arch. 2016 (2016)
Maura B. Paterson, Douglas R. Stinson, Jalaj Upadhyay
Multi-prover Proof-of-Retrievability. CoRR (2016)
Jalaj Upadhyay
On Low-Space Differentially Private Low-rank Factorization in the Spectral Norm. CoRR (2016)
Jalaj Upadhyay
Review of: Distributed Computing Through Combinatorial Topology by Maurice Herlihy and Dmitry Kozlov and Sergio Rajsbaum. SIGACT News 47 (2) (2016)
Jalaj Upadhyay
Fast and Space-optimal Low-rank Factorization in the Streaming Model With Application in Differential Privacy. CoRR (2016)
Nishanth Chandran, Vipul Goyal, Pratyay Mukherjee, Omkant Pandey, Jalaj Upadhyay
Block-wise Non-Malleable Codes. IACR Cryptol. ePrint Arch. 2015 (2015)
Jalaj Upadhyay
Circulant Matrices and Differential Privacy. CoRR (2014)
Douglas R. Stinson, Jalaj Upadhyay
Is extracting data the same as possessing data? J. Math. Cryptol. 8 (2) (2014)
Jalaj Upadhyay
Differentially Private Linear Algebra in the Streaming Model. IACR Cryptol. ePrint Arch. 2014 (2014)
Jalaj Upadhyay
Differentially Private Linear Algebra in the Streaming Model. CoRR (2014)
Douglas R. Stinson, Jalaj Upadhyay
Is extracting data the same as possessing data? IACR Cryptol. ePrint Arch. 2013 (2013)
Maura B. Paterson, Douglas R. Stinson, Jalaj Upadhyay
A coding theory foundation for the analysis of general unconditionally secure proof-of-retrievability schemes for cloud storage. J. Math. Cryptol. 7 (3) (2013)
Jalaj Upadhyay
Random Projections, Graph Sparsification, and Differential Privacy. IACR Cryptol. ePrint Arch. 2013 (2013)
Jalaj Upadhyay
Random Projections, Graph Sparsification, and Differential Privacy. ASIACRYPT (1) (2013)
Maura B. Paterson, Douglas R. Stinson, Jalaj Upadhyay
A coding theory foundation for the analysis of general unconditionally secure proof-of-retrievability schemes for cloud storage. CoRR (2012)
Simon R. Blackburn, Douglas R. Stinson, Jalaj Upadhyay
On the complexity of the herding attack and some related attacks on hash functions. Des. Codes Cryptogr. 64 (1-2) (2012)
Maura B. Paterson, Douglas R. Stinson, Jalaj Upadhyay
A coding theory foundation for the analysis of general unconditionally secure proof-of-retrievability schemes for cloud storage. IACR Cryptol. ePrint Arch. 2012 (2012)
Simon R. Blackburn, Douglas R. Stinson, Jalaj Upadhyay
On the Complexity of the Herding Attack and Some Related Attacks on Hash Functions. IACR Cryptol. ePrint Arch. 2010 (2010)

Jalaj Upadhyay.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Jalaj Upadhyay