| 2026 | ICALP | Mind the Gap? Not for SVP Hardness Under ETH! | Divesh Aggarwal, Rishav Gupta, Aditya Morolia, Chuanqi Zhang |
| 2025 | CRYPTO | Efficient Randomized Strong 2-Source Non-malleable Extractor for Any Linear Min-Entropy. | Divesh Aggarwal, Pranjal Dutta, Saswata Mukherjee, Satyajeet Nagargoje, Maciej Obremski |
| 2024 | TCC | Worst-Case to Average-Case Hardness of LWE: An Alternative Perspective. | Divesh Aggarwal, Leong Jin Ming, Alexandra Veliche |
| 2023 | CCS | Unforgeability in Stochastic Gradient Descent. | Teodora Baluta, Ivica Nikolic, Racchit Jain, Divesh Aggarwal, Prateek Saxena |
| 2023 | CRYPTO | Extractors: Low Entropy Requirements Colliding with Non-malleability. | Divesh Aggarwal, Eldon Chung, Maciej Obremski |
| 2023 | FOCS | Why we couldn't prove SETH hardness of the Closest Vector Problem for even norms! | Divesh Aggarwal, Rajendra Kumar |
| 2023 | IJCAI | Engineering an Efficient Approximate DNF-Counter. | Mate Soos, Divesh Aggarwal, Sourav Chakraborty, Kuldeep S. Meel, Maciej Obremski |
| 2023 | STOC | Lattice Problems beyond Polynomial Time. | Divesh Aggarwal, Huck Bennett, Zvika Brakerski, Alexander Golovnev, Rajendra Kumar, Zeyong Li, Spencer Peters, Noah Stephens-Davidowitz, Vinod Vaikuntanathan |
| 2022 | STOC | Rate one-third non-malleable codes. | Divesh Aggarwal, Bhavana Kanukurthi, Sai Lakshmi Bhavana Obbattu, Maciej Obremski, Sruthi Sekar |
| 2022 | TCC | On Secret Sharing, Randomness, and Random-less Reductions for Secret Sharing. | Divesh Aggarwal, Eldon Chung, Maciej Obremski, Joo Ribeiro |
| 2021 | EuroCrypt | A 2 | Divesh Aggarwal, Zeyong Li, Noah Stephens-Davidowitz |
| 2021 | SODA | Fine-grained hardness of CVP(P) - Everything that we can prove (and nothing else). | Divesh Aggarwal, Huck Bennett, Alexander Golovnev, Noah Stephens-Davidowitz |
| 2021 | SODA | Dimension-Preserving Reductions Between SVP and CVP in Different | Divesh Aggarwal, Yanlin Chen, Rajendra Kumar, Zeyong Li, Noah Stephens-Davidowitz |
| 2021 | STACS | Improved (Provable) Algorithms for the Shortest Vector Problem via Bounded Distance Decoding. | Divesh Aggarwal, Yanlin Chen, Rajendra Kumar, Yixin Shen |
| 2020 | CRYPTO | Slide Reduction, Revisited - Filling the Gaps in SVP Approximation. | Divesh Aggarwal, Jianwei Li, Phong Q. Nguyen, Noah Stephens-Davidowitz |
| 2020 | EuroCrypt | How to Extract Useful Randomness from Unreliable Sources. | Divesh Aggarwal, Maciej Obremski, Joo Ribeiro, Luisa Siniscalchi, Ivan Visconti |
| 2020 | FOCS | A constant rate non-malleable code in the split-state model. | Divesh Aggarwal, Maciej Obremski |
| 2019 | CRYPTO | Stronger Leakage-Resilient and Non-Malleable Secret Sharing Schemes for General Access Structures. | Divesh Aggarwal, Ivan Damgrd, Jesper Buus Nielsen, Maciej Obremski, Erick Purwanto, Joo Ribeiro, Mark Simkin |
| 2019 | EuroCrypt | A Quantum-Proof Non-malleable Extractor - With Application to Privacy Amplification Against Active Quantum Adversaries. | Divesh Aggarwal, Kai-Min Chung, Han-Hsuan Lin, Thomas Vidick |
| 2019 | EuroCrypt | Continuous Non-Malleable Codes in the 8-Split-State Model. | Divesh Aggarwal, Nico Dttling, Jesper Buus Nielsen, Maciej Obremski, Erick Purwanto |
| 2018 | CRYPTO | A New Public-Key Cryptosystem via Mersenne Numbers. | Divesh Aggarwal, Antoine Joux, Anupam Prakash, Miklos Santha |
| 2018 | ISAAC | Improved Algorithms for the Shortest Vector Problem and the Closest Vector Problem in the Infinity Norm. | Divesh Aggarwal, Priyanka Mukhopadhyay |
| 2018 | ISIT | Leakage-Resilient Algebraic Manipulation Detection Codes with Optimal Parameters. | Divesh Aggarwal, Tomasz Kazana, Maciej Obremski |
| 2018 | SODA | Just Take the Average! An Embarrassingly Simple 2^n-Time Algorithm for SVP (and CVP). | Divesh Aggarwal, Noah Stephens-Davidowitz |
| 2018 | STOC | (Gap/S)ETH hardness of SVP. | Divesh Aggarwal, Noah Stephens-Davidowitz |
| 2017 | TCC | Inception Makes Non-malleable Codes Stronger. | Divesh Aggarwal, Tomasz Kazana, Maciej Obremski |
| 2016 | ISIT | Revisiting the Sanders-Bogolyubov-Ruzsa theorem in Fp | Divesh Aggarwal, Jop Brit |
| 2016 | ISIT | Affine-malleable extractors, spectrum doubling, and application to privacy amplification. | Divesh Aggarwal, Kaave Hosseini, Shachar Lovett |
| 2016 | TCC | Optimal Computational Split-state Non-malleable Codes. | Divesh Aggarwal, Shashank Agrawal, Divya Gupta, Hemanta K. Maji, Omkant Pandey, Manoj Prabhakaran |
| 2015 | FOCS | Solving the Closest Vector Problem in 2^n Time - The Discrete Gaussian Strikes Again! | Divesh Aggarwal, Daniel Dadush, Noah Stephens-Davidowitz |
| 2015 | ITW | A note on lower bounds for non-interactive message authentication using weak keys. | Divesh Aggarwal, Alexander Golovnev |
| 2015 | STOC | Non-malleable Reductions and Applications. | Divesh Aggarwal, Yevgeniy Dodis, Tomasz Kazana, Maciej Obremski |
| 2015 | STOC | Solving the Shortest Vector Problem in 2 | Divesh Aggarwal, Daniel Dadush, Oded Regev, Noah Stephens-Davidowitz |
| 2015 | TCC | Leakage-Resilient Non-malleable Codes. | Divesh Aggarwal, Stefan Dziembowski, Tomasz Kazana, Maciej Obremski |
| 2014 | CRYPTO | Amplifying Privacy in Privacy Amplification. | Divesh Aggarwal, Yevgeniy Dodis, Zahra Jafargholi, Eric Miles, Leonid Reyzin |
| 2014 | STOC | Non-malleable codes from additive combinatorics. | Divesh Aggarwal, Yevgeniy Dodis, Shachar Lovett |
| 2011 | ASIACRYPT | The Leakage-Resilience Limit of a Computational Problem Is Equal to Its Unpredictability Entropy. | Divesh Aggarwal, Ueli Maurer |
| 2009 | EuroCrypt | Breaking RSA Generically Is Equivalent to Factoring. | Divesh Aggarwal, Ueli M. Maurer |
| 2006 | ISAAC | Algorithms on Graphs with Small Dominating Targets. | Divesh Aggarwal, Chandan K. Dubey, Shashank K. Mehta |
| 2005 | WG | Domination Search on Graphs with Low Dominating-Target-Number. | Divesh Aggarwal, Shashank K. Mehta, Jitender S. Deogun |