BibTeX records: Jalaj Upadhyay

download as .bib file

@article{DBLP:journals/corr/abs-2401-15781,
  author       = {Greg Bodwin and
                  Chengyuan Deng and
                  Jie Gao and
                  Gary Hoppenworth and
                  Jalaj Upadhyay and
                  Chen Wang},
  title        = {The Discrepancy of Shortest Paths},
  journal      = {CoRR},
  volume       = {abs/2401.15781},
  year         = {2024},
  url          = {https://doi.org/10.48550/arXiv.2401.15781},
  doi          = {10.48550/ARXIV.2401.15781},
  eprinttype    = {arXiv},
  eprint       = {2401.15781},
  timestamp    = {Tue, 06 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2401-15781.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2402-07471,
  author       = {Edwige Cyffers and
                  Aur{\'{e}}lien Bellet and
                  Jalaj Upadhyay},
  title        = {Differentially Private Decentralized Learning with Random Walks},
  journal      = {CoRR},
  volume       = {abs/2402.07471},
  year         = {2024},
  url          = {https://doi.org/10.48550/arXiv.2402.07471},
  doi          = {10.48550/ARXIV.2402.07471},
  eprinttype    = {arXiv},
  eprint       = {2402.07471},
  timestamp    = {Fri, 16 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2402-07471.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/GaneshTU23,
  author       = {Arun Ganesh and
                  Abhradeep Thakurta and
                  Jalaj Upadhyay},
  editor       = {Gergely Neu and
                  Lorenzo Rosasco},
  title        = {Universality of Langevin Diffusion for Private Optimization, with
                  Applications to Sampling from Rashomon Sets},
  booktitle    = {The Thirty Sixth Annual Conference on Learning Theory, {COLT} 2023,
                  12-15 July 2023, Bangalore, India},
  series       = {Proceedings of Machine Learning Research},
  volume       = {195},
  pages        = {1730--1773},
  publisher    = {{PMLR}},
  year         = {2023},
  url          = {https://proceedings.mlr.press/v195/ganesh23a.html},
  timestamp    = {Wed, 06 Sep 2023 17:49:05 +0200},
  biburl       = {https://dblp.org/rec/conf/colt/GaneshTU23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/FichtenbergerHU23,
  author       = {Hendrik Fichtenberger and
                  Monika Henzinger and
                  Jalaj Upadhyay},
  editor       = {Andreas Krause and
                  Emma Brunskill and
                  Kyunghyun Cho and
                  Barbara Engelhardt and
                  Sivan Sabato and
                  Jonathan Scarlett},
  title        = {Constant Matters: Fine-grained Error Bound on Differentially Private
                  Continual Observation},
  booktitle    = {International Conference on Machine Learning, {ICML} 2023, 23-29 July
                  2023, Honolulu, Hawaii, {USA}},
  series       = {Proceedings of Machine Learning Research},
  volume       = {202},
  pages        = {10072--10092},
  publisher    = {{PMLR}},
  year         = {2023},
  url          = {https://proceedings.mlr.press/v202/fichtenberger23a.html},
  timestamp    = {Mon, 28 Aug 2023 17:23:08 +0200},
  biburl       = {https://dblp.org/rec/conf/icml/FichtenbergerHU23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/HenzingerUU23,
  author       = {Monika Henzinger and
                  Jalaj Upadhyay and
                  Sarvagya Upadhyay},
  editor       = {Nikhil Bansal and
                  Viswanath Nagarajan},
  title        = {Almost Tight Error Bounds on Differentially Private Continual Counting},
  booktitle    = {Proceedings of the 2023 {ACM-SIAM} Symposium on Discrete Algorithms,
                  {SODA} 2023, Florence, Italy, January 22-25, 2023},
  pages        = {5003--5039},
  publisher    = {{SIAM}},
  year         = {2023},
  url          = {https://doi.org/10.1137/1.9781611977554.ch183},
  doi          = {10.1137/1.9781611977554.CH183},
  timestamp    = {Fri, 17 Feb 2023 09:28:57 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/HenzingerUU23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/DengGUW23,
  author       = {Chengyuan Deng and
                  Jie Gao and
                  Jalaj Upadhyay and
                  Chen Wang},
  editor       = {Pat Morin and
                  Subhash Suri},
  title        = {Differentially Private Range Query on Shortest Paths},
  booktitle    = {Algorithms and Data Structures - 18th International Symposium, {WADS}
                  2023, Montreal, QC, Canada, July 31 - August 2, 2023, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {14079},
  pages        = {340--370},
  publisher    = {Springer},
  year         = {2023},
  url          = {https://doi.org/10.1007/978-3-031-38906-1\_23},
  doi          = {10.1007/978-3-031-38906-1\_23},
  timestamp    = {Mon, 04 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/wads/DengGUW23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2307-08970,
  author       = {Monika Henzinger and
                  Jalaj Upadhyay and
                  Sarvagya Upadhyay},
  title        = {A Unifying Framework for Differentially Private Sums under Continual
                  Observation},
  journal      = {CoRR},
  volume       = {abs/2307.08970},
  year         = {2023},
  url          = {https://doi.org/10.48550/arXiv.2307.08970},
  doi          = {10.48550/ARXIV.2307.08970},
  eprinttype    = {arXiv},
  eprint       = {2307.08970},
  timestamp    = {Tue, 25 Jul 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2307-08970.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2309-17330,
  author       = {Jingcheng Liu and
                  Jalaj Upadhyay and
                  Zongrui Zou},
  title        = {Optimal Bounds on Private Graph Approximation},
  journal      = {CoRR},
  volume       = {abs/2309.17330},
  year         = {2023},
  url          = {https://doi.org/10.48550/arXiv.2309.17330},
  doi          = {10.48550/ARXIV.2309.17330},
  eprinttype    = {arXiv},
  eprint       = {2309.17330},
  timestamp    = {Tue, 17 Oct 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2309-17330.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2202-11205,
  author       = {Monika Henzinger and
                  Jalaj Upadhyay},
  title        = {Constant matters: Fine-grained Complexity of Differentially Private
                  Continual Observation Using Completely Bounded Norms},
  journal      = {CoRR},
  volume       = {abs/2202.11205},
  year         = {2022},
  url          = {https://arxiv.org/abs/2202.11205},
  eprinttype    = {arXiv},
  eprint       = {2202.11205},
  timestamp    = {Wed, 02 Mar 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2202-11205.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2204-01585,
  author       = {Arun Ganesh and
                  Abhradeep Thakurta and
                  Jalaj Upadhyay},
  title        = {Langevin Diffusion: An Almost Universal Algorithm for Private Euclidean
                  (Convex) Optimization},
  journal      = {CoRR},
  volume       = {abs/2204.01585},
  year         = {2022},
  url          = {https://doi.org/10.48550/arXiv.2204.01585},
  doi          = {10.48550/ARXIV.2204.01585},
  eprinttype    = {arXiv},
  eprint       = {2204.01585},
  timestamp    = {Wed, 06 Apr 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2204-01585.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2211-05006,
  author       = {Monika Henzinger and
                  Jalaj Upadhyay and
                  Sarvagya Upadhyay},
  title        = {Almost Tight Error Bounds on Differentially Private Continual Counting},
  journal      = {CoRR},
  volume       = {abs/2211.05006},
  year         = {2022},
  url          = {https://doi.org/10.48550/arXiv.2211.05006},
  doi          = {10.48550/ARXIV.2211.05006},
  eprinttype    = {arXiv},
  eprint       = {2211.05006},
  timestamp    = {Tue, 15 Nov 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2211-05006.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/HenzingerU22,
  author       = {Monika Henzinger and
                  Jalaj Upadhyay},
  title        = {Constant matters: Fine-grained Complexity of Differentially Private
                  Continual Observation Using Completely Bounded Norms},
  journal      = {{IACR} Cryptol. ePrint Arch.},
  pages        = {225},
  year         = {2022},
  url          = {https://eprint.iacr.org/2022/225},
  timestamp    = {Tue, 22 Mar 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iacr/HenzingerU22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aistats/UpadhyayUA21,
  author       = {Jalaj Upadhyay and
                  Sarvagya Upadhyay and
                  Raman Arora},
  editor       = {Arindam Banerjee and
                  Kenji Fukumizu},
  title        = {Differentially Private Analysis on Graph Streams},
  booktitle    = {The 24th International Conference on Artificial Intelligence and Statistics,
                  {AISTATS} 2021, April 13-15, 2021, Virtual Event},
  series       = {Proceedings of Machine Learning Research},
  volume       = {130},
  pages        = {1171--1179},
  publisher    = {{PMLR}},
  year         = {2021},
  url          = {http://proceedings.mlr.press/v130/upadhyay21a.html},
  timestamp    = {Wed, 14 Apr 2021 16:51:37 +0200},
  biburl       = {https://dblp.org/rec/conf/aistats/UpadhyayUA21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/UpadhyayU21,
  author       = {Jalaj Upadhyay and
                  Sarvagya Upadhyay},
  editor       = {Marina Meila and
                  Tong Zhang},
  title        = {A Framework for Private Matrix Analysis in Sliding Window Model},
  booktitle    = {Proceedings of the 38th International Conference on Machine Learning,
                  {ICML} 2021, 18-24 July 2021, Virtual Event},
  series       = {Proceedings of Machine Learning Research},
  volume       = {139},
  pages        = {10465--10475},
  publisher    = {{PMLR}},
  year         = {2021},
  url          = {http://proceedings.mlr.press/v139/upadhyay21a.html},
  timestamp    = {Wed, 25 Aug 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/icml/UpadhyayU21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BravermanDMMUWZ20,
  author       = {Vladimir Braverman and
                  Petros Drineas and
                  Cameron Musco and
                  Christopher Musco and
                  Jalaj Upadhyay and
                  David P. Woodruff and
                  Samson Zhou},
  editor       = {Sandy Irani},
  title        = {Near Optimal Linear Algebra in the Online and Sliding Window Models},
  booktitle    = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
                  2020, Durham, NC, USA, November 16-19, 2020},
  pages        = {517--528},
  publisher    = {{IEEE}},
  year         = {2020},
  url          = {https://doi.org/10.1109/FOCS46700.2020.00055},
  doi          = {10.1109/FOCS46700.2020.00055},
  timestamp    = {Wed, 15 Dec 2021 10:49:16 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/BravermanDMMUWZ20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2009-02668,
  author       = {Jalaj Upadhyay and
                  Sarvagya Upadhyay},
  title        = {A Framework for Private Matrix Analysis},
  journal      = {CoRR},
  volume       = {abs/2009.02668},
  year         = {2020},
  url          = {https://arxiv.org/abs/2009.02668},
  eprinttype    = {arXiv},
  eprint       = {2009.02668},
  timestamp    = {Thu, 17 Sep 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2009-02668.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/Upadhyay19,
  author       = {Jalaj Upadhyay},
  editor       = {Kamalika Chaudhuri and
                  Ruslan Salakhutdinov},
  title        = {Sublinear Space Private Algorithms Under the Sliding Window Model},
  booktitle    = {Proceedings of the 36th International Conference on Machine Learning,
                  {ICML} 2019, 9-15 June 2019, Long Beach, California, {USA}},
  series       = {Proceedings of Machine Learning Research},
  volume       = {97},
  pages        = {6363--6372},
  publisher    = {{PMLR}},
  year         = {2019},
  url          = {http://proceedings.mlr.press/v97/upadhyay19a.html},
  timestamp    = {Tue, 11 Jun 2019 15:37:38 +0200},
  biburl       = {https://dblp.org/rec/conf/icml/Upadhyay19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/AroraU19,
  author       = {Raman Arora and
                  Jalaj Upadhyay},
  editor       = {Hanna M. Wallach and
                  Hugo Larochelle and
                  Alina Beygelzimer and
                  Florence d'Alch{\'{e}}{-}Buc and
                  Emily B. Fox and
                  Roman Garnett},
  title        = {On Differentially Private Graph Sparsification and Applications},
  booktitle    = {Advances in Neural Information Processing Systems 32: Annual Conference
                  on Neural Information Processing Systems 2019, NeurIPS 2019, December
                  8-14, 2019, Vancouver, BC, Canada},
  pages        = {13378--13389},
  year         = {2019},
  url          = {https://proceedings.neurips.cc/paper/2019/hash/e44e875c12109e4fa3716c05008048b2-Abstract.html},
  timestamp    = {Mon, 16 May 2022 15:41:51 +0200},
  biburl       = {https://dblp.org/rec/conf/nips/AroraU19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jmc/PatersonSU18,
  author       = {Maura B. Paterson and
                  Douglas R. Stinson and
                  Jalaj Upadhyay},
  title        = {Multi-prover proof of retrievability},
  journal      = {J. Math. Cryptol.},
  volume       = {12},
  number       = {4},
  pages        = {203--220},
  year         = {2018},
  url          = {https://doi.org/10.1515/jmc-2018-0012},
  doi          = {10.1515/JMC-2018-0012},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jmc/PatersonSU18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/AroraBU18,
  author       = {Raman Arora and
                  Vladimir Braverman and
                  Jalaj Upadhyay},
  editor       = {Samy Bengio and
                  Hanna M. Wallach and
                  Hugo Larochelle and
                  Kristen Grauman and
                  Nicol{\`{o}} Cesa{-}Bianchi and
                  Roman Garnett},
  title        = {Differentially Private Robust Low-Rank Approximation},
  booktitle    = {Advances in Neural Information Processing Systems 31: Annual Conference
                  on Neural Information Processing Systems 2018, NeurIPS 2018, December
                  3-8, 2018, Montr{\'{e}}al, Canada},
  pages        = {4141--4149},
  year         = {2018},
  url          = {https://proceedings.neurips.cc/paper/2018/hash/a9813e9550fee3110373c21fa012eee7-Abstract.html},
  timestamp    = {Mon, 16 May 2022 15:41:51 +0200},
  biburl       = {https://dblp.org/rec/conf/nips/AroraBU18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/Upadhyay18,
  author       = {Jalaj Upadhyay},
  editor       = {Samy Bengio and
                  Hanna M. Wallach and
                  Hugo Larochelle and
                  Kristen Grauman and
                  Nicol{\`{o}} Cesa{-}Bianchi and
                  Roman Garnett},
  title        = {The Price of Privacy for Low-rank Factorization},
  booktitle    = {Advances in Neural Information Processing Systems 31: Annual Conference
                  on Neural Information Processing Systems 2018, NeurIPS 2018, December
                  3-8, 2018, Montr{\'{e}}al, Canada},
  pages        = {4180--4191},
  year         = {2018},
  url          = {https://proceedings.neurips.cc/paper/2018/hash/2eace51d8f796d04991c831a07059758-Abstract.html},
  timestamp    = {Thu, 21 Jan 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/nips/Upadhyay18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1805-03765,
  author       = {Vladimir Braverman and
                  Petros Drineas and
                  Cameron Musco and
                  Christopher Musco and
                  Jalaj Upadhyay and
                  David P. Woodruff and
                  Samson Zhou},
  title        = {Near Optimal Linear Algebra in the Online and Sliding Window Models},
  journal      = {CoRR},
  volume       = {abs/1805.03765},
  year         = {2018},
  url          = {http://arxiv.org/abs/1805.03765},
  eprinttype    = {arXiv},
  eprint       = {1805.03765},
  timestamp    = {Tue, 15 Sep 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1805-03765.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sp/SmithTU17,
  author       = {Adam D. Smith and
                  Abhradeep Thakurta and
                  Jalaj Upadhyay},
  title        = {Is Interaction Necessary for Distributed Private Learning?},
  booktitle    = {2017 {IEEE} Symposium on Security and Privacy, {SP} 2017, San Jose,
                  CA, USA, May 22-26, 2017},
  pages        = {58--77},
  publisher    = {{IEEE} Computer Society},
  year         = {2017},
  url          = {https://doi.org/10.1109/SP.2017.35},
  doi          = {10.1109/SP.2017.35},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/sp/SmithTU17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigact/Upadhyay16,
  author       = {Jalaj Upadhyay},
  title        = {Review of: Distributed Computing Through Combinatorial Topology by
                  Maurice Herlihy and Dmitry Kozlov and Sergio Rajsbaum},
  journal      = {{SIGACT} News},
  volume       = {47},
  number       = {2},
  pages        = {18--20},
  year         = {2016},
  url          = {https://doi.org/10.1145/2951860.2951867},
  doi          = {10.1145/2951860.2951867},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/sigact/Upadhyay16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/ChandranGMPU16,
  author       = {Nishanth Chandran and
                  Vipul Goyal and
                  Pratyay Mukherjee and
                  Omkant Pandey and
                  Jalaj Upadhyay},
  editor       = {Ioannis Chatzigiannakis and
                  Michael Mitzenmacher and
                  Yuval Rabani and
                  Davide Sangiorgi},
  title        = {Block-Wise Non-Malleable Codes},
  booktitle    = {43rd International Colloquium on Automata, Languages, and Programming,
                  {ICALP} 2016, July 11-15, 2016, Rome, Italy},
  series       = {LIPIcs},
  volume       = {55},
  pages        = {31:1--31:14},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2016},
  url          = {https://doi.org/10.4230/LIPIcs.ICALP.2016.31},
  doi          = {10.4230/LIPICS.ICALP.2016.31},
  timestamp    = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl       = {https://dblp.org/rec/conf/icalp/ChandranGMPU16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/PatersonSU16,
  author       = {Maura B. Paterson and
                  Douglas R. Stinson and
                  Jalaj Upadhyay},
  title        = {Multi-prover Proof-of-Retrievability},
  journal      = {CoRR},
  volume       = {abs/1603.02671},
  year         = {2016},
  url          = {http://arxiv.org/abs/1603.02671},
  eprinttype    = {arXiv},
  eprint       = {1603.02671},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/PatersonSU16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Upadhyay16,
  author       = {Jalaj Upadhyay},
  title        = {Fast and Space-optimal Low-rank Factorization in the Streaming Model
                  With Application in Differential Privacy},
  journal      = {CoRR},
  volume       = {abs/1604.01429},
  year         = {2016},
  url          = {http://arxiv.org/abs/1604.01429},
  eprinttype    = {arXiv},
  eprint       = {1604.01429},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/Upadhyay16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Upadhyay16a,
  author       = {Jalaj Upadhyay},
  title        = {On Low-Space Differentially Private Low-rank Factorization in the
                  Spectral Norm},
  journal      = {CoRR},
  volume       = {abs/1611.08954},
  year         = {2016},
  url          = {http://arxiv.org/abs/1611.08954},
  eprinttype    = {arXiv},
  eprint       = {1611.08954},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/Upadhyay16a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/PatersonSU16,
  author       = {Maura B. Paterson and
                  Douglas R. Stinson and
                  Jalaj Upadhyay},
  title        = {Multi-prover Proof-of-Retrievability},
  journal      = {{IACR} Cryptol. ePrint Arch.},
  pages        = {265},
  year         = {2016},
  url          = {http://eprint.iacr.org/2016/265},
  timestamp    = {Mon, 11 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/iacr/PatersonSU16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/basesearch/Upadhyay15,
  author       = {Jalaj Upadhyay},
  title        = {Integrity and Privacy of Large Data},
  school       = {University of Waterloo, Ontario, Canada},
  year         = {2015},
  url          = {https://hdl.handle.net/10012/10015},
  timestamp    = {Wed, 04 May 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/phd/basesearch/Upadhyay15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/ChandranGMPU15,
  author       = {Nishanth Chandran and
                  Vipul Goyal and
                  Pratyay Mukherjee and
                  Omkant Pandey and
                  Jalaj Upadhyay},
  title        = {Block-wise Non-Malleable Codes},
  journal      = {{IACR} Cryptol. ePrint Arch.},
  pages        = {129},
  year         = {2015},
  url          = {http://eprint.iacr.org/2015/129},
  timestamp    = {Mon, 11 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/iacr/ChandranGMPU15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jmc/StinsonU14,
  author       = {Douglas R. Stinson and
                  Jalaj Upadhyay},
  title        = {Is extracting data the same as possessing data?},
  journal      = {J. Math. Cryptol.},
  volume       = {8},
  number       = {2},
  pages        = {189--207},
  year         = {2014},
  url          = {https://doi.org/10.1515/jmc-2013-0034},
  doi          = {10.1515/JMC-2013-0034},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jmc/StinsonU14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Upadhyay14a,
  author       = {Jalaj Upadhyay},
  title        = {Differentially Private Linear Algebra in the Streaming Model},
  journal      = {CoRR},
  volume       = {abs/1409.5414},
  year         = {2014},
  url          = {http://arxiv.org/abs/1409.5414},
  eprinttype    = {arXiv},
  eprint       = {1409.5414},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/Upadhyay14a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Upadhyay14b,
  author       = {Jalaj Upadhyay},
  title        = {Circulant Matrices and Differential Privacy},
  journal      = {CoRR},
  volume       = {abs/1410.2470},
  year         = {2014},
  url          = {http://arxiv.org/abs/1410.2470},
  eprinttype    = {arXiv},
  eprint       = {1410.2470},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/Upadhyay14b.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/Upadhyay14,
  author       = {Jalaj Upadhyay},
  title        = {Differentially Private Linear Algebra in the Streaming Model},
  journal      = {{IACR} Cryptol. ePrint Arch.},
  pages        = {730},
  year         = {2014},
  url          = {http://eprint.iacr.org/2014/730},
  timestamp    = {Mon, 11 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/iacr/Upadhyay14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jmc/PatersonSU13,
  author       = {Maura B. Paterson and
                  Douglas R. Stinson and
                  Jalaj Upadhyay},
  title        = {A coding theory foundation for the analysis of general unconditionally
                  secure proof-of-retrievability schemes for cloud storage},
  journal      = {J. Math. Cryptol.},
  volume       = {7},
  number       = {3},
  pages        = {183--216},
  year         = {2013},
  url          = {https://doi.org/10.1515/jmc-2013-5002},
  doi          = {10.1515/JMC-2013-5002},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jmc/PatersonSU13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/asiacrypt/Upadhyay13,
  author       = {Jalaj Upadhyay},
  editor       = {Kazue Sako and
                  Palash Sarkar},
  title        = {Random Projections, Graph Sparsification, and Differential Privacy},
  booktitle    = {Advances in Cryptology - {ASIACRYPT} 2013 - 19th International Conference
                  on the Theory and Application of Cryptology and Information Security,
                  Bengaluru, India, December 1-5, 2013, Proceedings, Part {I}},
  series       = {Lecture Notes in Computer Science},
  volume       = {8269},
  pages        = {276--295},
  publisher    = {Springer},
  year         = {2013},
  url          = {https://doi.org/10.1007/978-3-642-42033-7\_15},
  doi          = {10.1007/978-3-642-42033-7\_15},
  timestamp    = {Tue, 14 May 2019 10:00:40 +0200},
  biburl       = {https://dblp.org/rec/conf/asiacrypt/Upadhyay13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/Upadhyay13,
  author       = {Jalaj Upadhyay},
  title        = {Random Projections, Graph Sparsification, and Differential Privacy},
  journal      = {{IACR} Cryptol. ePrint Arch.},
  pages        = {580},
  year         = {2013},
  url          = {http://eprint.iacr.org/2013/580},
  timestamp    = {Mon, 11 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/iacr/Upadhyay13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/StinsonU13,
  author       = {Douglas R. Stinson and
                  Jalaj Upadhyay},
  title        = {Is extracting data the same as possessing data?},
  journal      = {{IACR} Cryptol. ePrint Arch.},
  pages        = {614},
  year         = {2013},
  url          = {http://eprint.iacr.org/2013/614},
  timestamp    = {Mon, 11 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/iacr/StinsonU13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcc/BlackburnSU12,
  author       = {Simon R. Blackburn and
                  Douglas R. Stinson and
                  Jalaj Upadhyay},
  title        = {On the complexity of the herding attack and some related attacks on
                  hash functions},
  journal      = {Des. Codes Cryptogr.},
  volume       = {64},
  number       = {1-2},
  pages        = {171--193},
  year         = {2012},
  url          = {https://doi.org/10.1007/s10623-010-9481-x},
  doi          = {10.1007/S10623-010-9481-X},
  timestamp    = {Mon, 17 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dcc/BlackburnSU12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1210-7756,
  author       = {Maura B. Paterson and
                  Douglas R. Stinson and
                  Jalaj Upadhyay},
  title        = {A coding theory foundation for the analysis of general unconditionally
                  secure proof-of-retrievability schemes for cloud storage},
  journal      = {CoRR},
  volume       = {abs/1210.7756},
  year         = {2012},
  url          = {http://arxiv.org/abs/1210.7756},
  eprinttype    = {arXiv},
  eprint       = {1210.7756},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1210-7756.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/PatersonSU12,
  author       = {Maura B. Paterson and
                  Douglas R. Stinson and
                  Jalaj Upadhyay},
  title        = {A coding theory foundation for the analysis of general unconditionally
                  secure proof-of-retrievability schemes for cloud storage},
  journal      = {{IACR} Cryptol. ePrint Arch.},
  pages        = {611},
  year         = {2012},
  url          = {http://eprint.iacr.org/2012/611},
  timestamp    = {Mon, 11 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/iacr/PatersonSU12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/BlackburnSU10,
  author       = {Simon R. Blackburn and
                  Douglas R. Stinson and
                  Jalaj Upadhyay},
  title        = {On the Complexity of the Herding Attack and Some Related Attacks on
                  Hash Functions},
  journal      = {{IACR} Cryptol. ePrint Arch.},
  pages        = {30},
  year         = {2010},
  url          = {http://eprint.iacr.org/2010/030},
  timestamp    = {Mon, 11 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/iacr/BlackburnSU10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics