Divesh Aggarwal

ORCID

Publication Activity (10 Years)

Years Active: 2005-2024
Publications (10 Years): 91

Top Venues

IACR Cryptol. ePrint Arch.

CoRR

Electron. Colloquium Comput. Complex.

STOC

Publications

Mate Soos, Uddalok Sarkar, Divesh Aggarwal, Sourav Chakraborty, Kuldeep S. Meel, Maciej Obremski
Engineering an Efficient Approximate DNF-Counter. CoRR (2024)
Divesh Aggarwal, Naresh Goud Boddu, Rahul Jain, Maciej Obremski
Quantum Measurement Adversary. IEEE Trans. Inf. Theory 70 (1) (2024)
Divesh Aggarwal, Leong Jin Ming, Alexandra Veliche
Worst-Case to Average-Case Hardness of LWE: A Simple and Practical Perspective. IACR Cryptol. ePrint Arch. 2024 (2024)
Divesh Aggarwal, Antoine Joux, Miklos Santha, Karol Wegrzycki
Polynomial Time Algorithms for Integer Programming and Unbounded Subset Sum in the Total Regime. CoRR (2024)
Divesh Aggarwal, Pranjal Dutta, Zeyong Li, Maciej Obremski, Sidhant Saraogi
Improved Lower Bounds for 3-Query Matching Vector Codes. Electron. Colloquium Comput. Complex. (2024)
Divesh Aggarwal, Naresh Goud Boddu, Rahul Jain
Quantum Secure Non-Malleable Codes in the Split-State Model. IEEE Trans. Inf. Theory 70 (1) (2024)
Divesh Aggarwal, Leong Jin Ming, Alexandra Veliche
Worst-Case to Average-Case Hardness of LWE: A Simple and Practical Perspective. Electron. Colloquium Comput. Complex. (2024)
Mate Soos, Divesh Aggarwal, Sourav Chakraborty, Kuldeep S. Meel, Maciej Obremski
Engineering an Efficient Approximate DNF-Counter. IJCAI (2023)
Teodora Baluta, Ivica Nikolic, Racchit Jain, Divesh Aggarwal, Prateek Saxena
Unforgeability in Stochastic Gradient Descent. CCS (2023)
Divesh Aggarwal, Eldon Chung, Maciej Obremski
Extractors: Low Entropy Requirements Colliding with Non-malleability. CRYPTO (2) (2023)
Divesh Aggarwal, Huck Bennett, Zvika Brakerski, Alexander Golovnev, Rajendra Kumar, Zeyong Li, Spencer Peters, Noah Stephens-Davidowitz, Vinod Vaikuntanathan
Lattice Problems beyond Polynomial Time. STOC (2023)
Divesh Aggarwal, Rajendra Kumar
Why we couldn't prove SETH hardness of the Closest Vector Problem for even norms! FOCS (2023)
Divesh Aggarwal, Thomas Espitau, Spencer Peters, Noah Stephens-Davidowitz
Recursive lattice reduction - A framework for finding short lattice vectors. CoRR (2023)
Divesh Aggarwal, Nico Döttling, Jesko Dujmovic, Mohammad Hajiabadi, Giulio Malavolta, Maciej Obremski
Algebraic Restriction Codes and Their Applications. Algorithmica 85 (12) (2023)
Divesh Aggarwal, Marshall Ball, Maciej Obremski
Survey: Non-malleable code in the split-state model. IACR Cryptol. ePrint Arch. 2022 (2022)
Divesh Aggarwal, Nico Döttling, Jesko Dujmovic, Mohammad Hajiabadi, Giulio Malavolta, Maciej Obremski
Algebraic Restriction Codes and Their Applications. ITCS (2022)
Divesh Aggarwal, Huck Bennett, Zvika Brakerski, Alexander Golovnev, Rajendra Kumar, Zeyong Li, Spencer Peters, Noah Stephens-Davidowitz, Vinod Vaikuntanathan
Lattice Problems Beyond Polynomial Time. CoRR (2022)
Divesh Aggarwal, Bhavana Kanukurthi, Sai Lakshmi Bhavana Obbattu, Maciej Obremski, Sruthi Sekar
Rate one-third non-malleable codes. STOC (2022)
Divesh Aggarwal, Rajendra Kumar
Why we couldn't prove SETH hardness of the Closest Vector Problem for even norms, and of the Subset Sum Problem! CoRR (2022)
Divesh Aggarwal, Eldon Chung, Maciej Obremski, João L. Ribeiro
On Secret Sharing, Randomness, and Random-less Reductions for Secret Sharing. TCC (1) (2022)
Divesh Aggarwal, Maciej Obremski, João L. Ribeiro, Mark Simkin, Luisa Siniscalchi
Privacy Amplification With Tamperable Memory via Non-Malleable Two-Source Extractors. IEEE Trans. Inf. Theory 68 (8) (2022)
Divesh Aggarwal, Marshall Ball, Maciej Obremski
Non-Malleable Code in the Split-State Model. Entropy 24 (8) (2022)
Divesh Aggarwal, Nico Döttling, Jesko Dujmovic, Mohammad Hajiabadi, Giulio Malavolta, Maciej Obremski
Algebraic Restriction Codes and their Applications. IACR Cryptol. ePrint Arch. 2021 (2021)
Eldon Chung, Maciej Obremski, Divesh Aggarwal
Extractors: Low Entropy Requirements Colliding With Non-Malleability. Electron. Colloquium Comput. Complex. 28 (2021)
Eldon Chung, Maciej Obremski, Divesh Aggarwal
Extractors: Low Entropy Requirements Colliding With Non-Malleability. CoRR (2021)
Divesh Aggarwal, Bhavana Kanukurthi, Sai Lakshmi Bhavana Obbattu, Maciej Obremski, Sruthi Sekar
Rate One-Third Non-malleable Codes. IACR Cryptol. ePrint Arch. 2021 (2021)
Divesh Aggarwal, Yanlin Chen, Rajendra Kumar, Zeyong Li, Noah Stephens-Davidowitz
-Norms. SODA (2021)
Divesh Aggarwal, Eldon Chung
A note on the concrete hardness of the shortest independent vector in lattices. Inf. Process. Lett. 167 (2021)
Eldon Chung, Maciej Obremski, Divesh Aggarwal
Extractors: Low Entropy Requirements Colliding With Non-Malleability. IACR Cryptol. ePrint Arch. 2021 (2021)
Divesh Aggarwal, Zeyong Li, Noah Stephens-Davidowitz
-Time Algorithm for $\sqrt{n}$-SVP and $\sqrt{n}$-Hermite SVP, and an Improved Time-Approximation Tradeoff for (H)SVP. EUROCRYPT (1) (2021)
Divesh Aggarwal, Eldon Chung, Maciej Obremski, João L. Ribeiro
On Secret Sharing, Randomness, and Random-less Reductions for Secret Sharing. Electron. Colloquium Comput. Complex. 28 (2021)
Divesh Aggarwal, Yanlin Chen, Rajendra Kumar, Yixin Shen
Improved (Provable) Algorithms for the Shortest Vector Problem via Bounded Distance Decoding. STACS (2021)
Divesh Aggarwal, Yanlin Chen, Rajendra Kumar, Zeyong Li, Noah Stephens-Davidowitz
Dimension-Preserving Reductions Between SVP and CVP in Different p-Norms. CoRR (2021)
Divesh Aggarwal, Eldon Chung, Maciej Obremski, João L. Ribeiro
On Secret Sharing, Randomness, and Random-less Reductions for Secret Sharing. IACR Cryptol. ePrint Arch. 2021 (2021)
Divesh Aggarwal, Naresh Goud Boddu, Rahul Jain, Maciej Obremski
Quantum Measurement Adversary. CoRR (2021)
Divesh Aggarwal, Huck Bennett, Alexander Golovnev, Noah Stephens-Davidowitz
Fine-grained hardness of CVP(P) - Everything that we can prove (and nothing else). SODA (2021)
Divesh Aggarwal, Bhavana Kanukurthi, Sai Lakshmi Bhavana Obbattu, Maciej Obremski, Sruthi Sekar
Simplicity Meets Near-Optimal Rate: Non-malleable Codes and Non-malleable Two-source Extractors via Rate Boosters. Electron. Colloquium Comput. Complex. 28 (2021)
Divesh Aggarwal, Eldon Chung
A Note on the Concrete Hardness of the Shortest Independent Vectors Problem in Lattices. CoRR (2020)
Divesh Aggarwal, Siyao Guo, Maciej Obremski, João L. Ribeiro, Noah Stephens-Davidowitz
Extractor Lower Bounds, Revisited. APPROX-RANDOM (2020)
Divesh Aggarwal, Yanlin Chen, Rajendra Kumar, Yixin Shen
Improved (Provable) Algorithms for the Shortest Vector Problem via Bounded Distance Decoding. CoRR (2020)
Divesh Aggarwal, Zeyong Li, Noah Stephens-Davidowitz
-Time Algorithm for √n-SVP and √n-Hermite SVP, and an Improved Time-Approximation Tradeoff for (H)SVP. CoRR (2020)
Divesh Aggarwal, Maciej Obremski
A constant rate non-malleable code in the split-state model. FOCS (2020)
Divesh Aggarwal, Jianwei Li, Phong Q. Nguyen, Noah Stephens-Davidowitz
Slide Reduction, Revisited - Filling the Gaps in SVP Approximation. CRYPTO (2) (2020)
Divesh Aggarwal, Maciej Obremski, João L. Ribeiro, Luisa Siniscalchi, Ivan Visconti
How to Extract Useful Randomness from Unreliable Sources. EUROCRYPT (1) (2020)
Divesh Aggarwal, Maciej Obremski, João L. Ribeiro, Mark Simkin, Luisa Siniscalchi
Two-Source Non-Malleable Extractors and Applications to Privacy Amplification with Tamperable Memory. IACR Cryptol. ePrint Arch. 2020 (2020)
Divesh Aggarwal, Maciej Obremski, João L. Ribeiro, Mark Simkin, Luisa Siniscalchi
Computational and Information-Theoretic Two-Source (Non-Malleable) Extractors. IACR Cryptol. ePrint Arch. 2020 (2020)
Divesh Aggarwal, Kai-Min Chung, Han-Hsuan Lin, Thomas Vidick
A Quantum-Proof Non-malleable Extractor - With Application to Privacy Amplification Against Active Quantum Adversaries. EUROCRYPT (2) (2019)
Divesh Aggarwal, Jianwei Li, Phong Q. Nguyen, Noah Stephens-Davidowitz
Slide Reduction, Revisited - Filling the Gaps in SVP Approximation. CoRR (2019)
Divesh Aggarwal, Siyao Guo, Maciej Obremski, João L. Ribeiro, Noah Stephens-Davidowitz
Extractor Lower Bounds, Revisited. Electron. Colloquium Comput. Complex. 26 (2019)
Divesh Aggarwal, Maciej Obremski
Inception makes non-malleable codes shorter as well! IACR Cryptol. ePrint Arch. 2019 (2019)
Divesh Aggarwal, Huck Bennett, Alexander Golovnev, Noah Stephens-Davidowitz
Fine-grained hardness of CVP(P) - Everything that we can prove (and nothing else). CoRR (2019)
Divesh Aggarwal, Maciej Obremski, João L. Ribeiro, Luisa Siniscalchi, Ivan Visconti
How to Extract Useful Randomness from Unreliable Sources. IACR Cryptol. ePrint Arch. 2019 (2019)
Divesh Aggarwal, Bogdan Ursu, Serge Vaudenay
Faster Sieving Algorithm for Approximate SVP with Constant Approximation Factors. IACR Cryptol. ePrint Arch. 2019 (2019)
Divesh Aggarwal, Ivan Damgård, Jesper Buus Nielsen, Maciej Obremski, Erick Purwanto, João L. Ribeiro, Mark Simkin
Stronger Leakage-Resilient and Non-Malleable Secret Sharing Schemes for General Access Structures. CRYPTO (2) (2019)
Divesh Aggarwal, Maciej Obremski
A constant-rate non-malleable code in the split-state model. IACR Cryptol. ePrint Arch. 2019 (2019)
Divesh Aggarwal, Kai-Min Chung, Han-Hsuan Lin, Thomas Vidick
A Quantum-Proof Non-Malleable Extractor With Application to Privacy Amplification against Active Quantum Adversaries. IACR Cryptol. ePrint Arch. 2019 (2019)
Divesh Aggarwal, Nico Döttling, Jesper Buus Nielsen, Maciej Obremski, Erick Purwanto
Continuous Non-Malleable Codes in the 8-Split-State Model. EUROCRYPT (1) (2019)
Divesh Aggarwal, Noah Stephens-Davidowitz
Just Take the Average! An Embarrassingly Simple 2^n-Time Algorithm for SVP (and CVP). SOSA (2018)
Divesh Aggarwal, Ivan Damgård, Jesper Buus Nielsen, Maciej Obremski, Erick Purwanto, João L. Ribeiro, Mark Simkin
Stronger Leakage-Resilient and Non-Malleable Secret-Sharing Schemes for General Access Structures. IACR Cryptol. ePrint Arch. 2018 (2018)
Divesh Aggarwal, Priyanka Mukhopadhyay
norm. CoRR (2018)
Divesh Aggarwal, Antoine Joux, Anupam Prakash, Miklos Santha
A New Public-Key Cryptosystem via Mersenne Numbers. CRYPTO (3) (2018)
Divesh Aggarwal, Gavin K. Brennen, Troy Lee, Miklos Santha, Marco Tomamichel
Quantum Attacks on Bitcoin, and How to Protect Against Them. Ledger 3 (2018)
Divesh Aggarwal, Priyanka Mukhopadhyay
Improved Algorithms for the Shortest Vector Problem and the Closest Vector Problem in the Infinity Norm. ISAAC (2018)
Divesh Aggarwal, Noah Stephens-Davidowitz
(Gap/S)ETH hardness of SVP. STOC (2018)
Divesh Aggarwal, Yevgeniy Dodis, Shachar Lovett
Non-Malleable Codes from Additive Combinatorics. SIAM J. Comput. 47 (2) (2018)
Divesh Aggarwal, Tomasz Kazana, Maciej Obremski
Leakage-resilient Algebraic Manipulation Detection Codes with Optimal Parameters. IACR Cryptol. ePrint Arch. 2018 (2018)
Divesh Aggarwal, Tomasz Kazana, Maciej Obremski
Leakage-Resilient Algebraic Manipulation Detection Codes with Optimal Parameters. ISIT (2018)
Divesh Aggarwal, Tomasz Kazana, Maciej Obremski
Inception Makes Non-malleable Codes Stronger. TCC (2) (2017)
Divesh Aggarwal, Kai-Min Chung, Han-Hsuan Lin, Thomas Vidick
A Quantum-Proof Non-Malleable Extractor, With Application to Privacy Amplification against Active Quantum Adversaries. CoRR (2017)
Divesh Aggarwal, Noah Stephens-Davidowitz
(Gap/S)ETH Hardness of SVP. CoRR (2017)
Divesh Aggarwal, Antoine Joux, Anupam Prakash, Miklos Santha
A New Public-Key Cryptosystem via Mersenne Numbers. IACR Cryptol. ePrint Arch. 2017 (2017)
Divesh Aggarwal, Noah Stephens-Davidowitz
Just Take the Average! An Embarrassingly Simple $2^n$-Time Algorithm for SVP (and CVP). CoRR (2017)
Divesh Aggarwal, Kaave Hosseini, Shachar Lovett
Affine-malleable extractors, spectrum doubling, and application to privacy amplification. ISIT (2016)
Divesh Aggarwal, Ueli Maurer
Breaking RSA Generically Is Equivalent to Factoring. IEEE Trans. Inf. Theory 62 (11) (2016)
Divesh Aggarwal, Jop Briët
and its application to non-malleable codes. ISIT (2016)
Divesh Aggarwal, Chandan K. Dubey
Improved hardness results for unique shortest vector problem. Inf. Process. Lett. 116 (10) (2016)
Divesh Aggarwal, Jop Briët
Revisiting the Sanders-Freiman-Ruzsa Theorem in $\mathbb{F}_p^n$ and its Application to Non-malleable Codes. CoRR (2016)
Divesh Aggarwal, Shashank Agrawal, Divya Gupta, Hemanta K. Maji, Omkant Pandey, Manoj Prabhakaran
Optimal Computational Split-state Non-malleable Codes. TCC (A2) (2016)
Divesh Aggarwal, Oded Regev
A Note on Discrete Gaussian Combinations of Lattice Vectors. Chic. J. Theor. Comput. Sci. 2016 (2016)
Divesh Aggarwal, Daniel Dadush, Noah Stephens-Davidowitz
Solving the Closest Vector Problem in $2^n$ Time - The Discrete Gaussian Strikes Again! CoRR (2015)
Divesh Aggarwal, Shashank Agrawal, Divya Gupta, Hemanta K. Maji, Omkant Pandey, Manoj Prabhakaran
Optimal Computational Split-state Non-malleable Codes. IACR Cryptol. ePrint Arch. 2015 (2015)
Divesh Aggarwal
Affine-evasive sets modulo a prime. Inf. Process. Lett. 115 (2) (2015)
Divesh Aggarwal, Daniel Dadush, Noah Stephens-Davidowitz
Solving the Closest Vector Problem in 2^n Time - The Discrete Gaussian Strikes Again! FOCS (2015)
Divesh Aggarwal, Stefan Dziembowski, Tomasz Kazana, Maciej Obremski
Leakage-Resilient Non-malleable Codes. TCC (1) (2015)
Divesh Aggarwal, Alexander Golovnev
A Note on Lower Bounds for Non-interactive Message Authentication Using Weak Keys. IACR Cryptol. ePrint Arch. 2015 (2015)
Divesh Aggarwal, Kaave Hosseini, Shachar Lovett
Affine-malleable Extractors, Spectrum Doubling, and Application to Privacy Amplification. IACR Cryptol. ePrint Arch. 2015 (2015)
Divesh Aggarwal, Tomasz Kazana, Maciej Obremski
Inception Makes Non-malleable Codes Stronger. IACR Cryptol. ePrint Arch. 2015 (2015)
Divesh Aggarwal, Daniel Dadush, Oded Regev, Noah Stephens-Davidowitz
Time Using Discrete Gaussian Sampling: Extended Abstract. STOC (2015)
Divesh Aggarwal, Alexander Golovnev
A note on lower bounds for non-interactive message authentication using weak keys. ITW Fall (2015)
Divesh Aggarwal, Kaave Hosseini, Shachar Lovett
Affine-malleable Extractors, Spectrum Doubling, and Application to Privacy Amplification. Electron. Colloquium Comput. Complex. 22 (2015)
Divesh Aggarwal, Yevgeniy Dodis, Tomasz Kazana, Maciej Obremski
Non-malleable Reductions and Applications. STOC (2015)
Divesh Aggarwal, Yevgeniy Dodis, Tomasz Kazana, Maciej Obremski
Non-malleable Reductions and Applications. IACR Cryptol. ePrint Arch. 2014 (2014)
Divesh Aggarwal, Daniel Dadush, Oded Regev, Noah Stephens-Davidowitz
Solving the Shortest Vector Problem in $2^n$ Time via Discrete Gaussian Sampling. CoRR (2014)
Divesh Aggarwal
Affine-evasive Sets Modulo a Prime. IACR Cryptol. ePrint Arch. 2014 (2014)
Divesh Aggarwal, Yevgeniy Dodis, Tomasz Kazana, Maciej Obremski
Non-malleable Reductions and Applications. Electron. Colloquium Comput. Complex. 21 (2014)
Divesh Aggarwal, Stefan Dziembowski, Tomasz Kazana, Maciej Obremski
Leakage-resilient non-malleable codes. IACR Cryptol. ePrint Arch. 2014 (2014)
Divesh Aggarwal, Stefan Dziembowski, Tomasz Kazana, Maciej Obremski
Leakage-resilient non-malleable codes. Electron. Colloquium Comput. Complex. 21 (2014)
Divesh Aggarwal, Yevgeniy Dodis, Shachar Lovett
Non-malleable codes from additive combinatorics. STOC (2014)
Divesh Aggarwal, Yevgeniy Dodis, Zahra Jafargholi, Eric Miles, Leonid Reyzin
Amplifying Privacy in Privacy Amplification. CRYPTO (2) (2014)
Divesh Aggarwal, Yevgeniy Dodis, Shachar Lovett
Non-malleable Codes from Additive Combinatorics. IACR Cryptol. ePrint Arch. 2013 (2013)

Divesh Aggarwal.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Divesh Aggarwal