Divesh Aggarwal

According to our database, Divesh Aggarwal authored at least 67 papers between 2005 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

Quantum Measurement Adversary.

Divesh Aggarwal, Naresh Goud Boddu, Rahul Jain, Maciej Obremski

IEEE Trans. Inf. Theory, January, 2024

Quantum Secure Non-Malleable Codes in the Split-State Model.

Divesh Aggarwal, Naresh Goud Boddu, Rahul Jain

IEEE Trans. Inf. Theory, January, 2024

Worst-Case to Average-Case Hardness of LWE: A Simple and Practical Perspective.

Divesh Aggarwal, Leong Jin Ming, Alexandra Veliche

Electron. Colloquium Comput. Complex., 2024

Improved Lower Bounds for 3-Query Matching Vector Codes.

Divesh Aggarwal, Pranjal Dutta, Zeyong Li, Maciej Obremski, Sidhant Saraogi

Electron. Colloquium Comput. Complex., 2024

Engineering an Efficient Approximate DNF-Counter.

Mate Soos, Uddalok Sarkar, Divesh Aggarwal, Sourav Chakraborty, Kuldeep S. Meel, Maciej Obremski

CoRR, 2024

Polynomial Time Algorithms for Integer Programming and Unbounded Subset Sum in the Total Regime.

Divesh Aggarwal, Antoine Joux, Miklos Santha, Karol Wegrzycki

CoRR, 2024

Worst-Case to Average-Case Hardness of LWE: An Alternative Perspective.

Divesh Aggarwal, Leong Jin Ming, Alexandra Veliche

Proceedings of the Theory of Cryptography - 22nd International Conference, 2024

2023

Algebraic Restriction Codes and Their Applications.

Divesh Aggarwal, Nico Döttling, Jesko Dujmovic, Mohammad Hajiabadi, Giulio Malavolta, Maciej Obremski

Algorithmica, December, 2023

Recursive lattice reduction - A framework for finding short lattice vectors.

Divesh Aggarwal, Thomas Espitau, Spencer Peters, Noah Stephens-Davidowitz

CoRR, 2023

Lattice Problems beyond Polynomial Time.

Divesh Aggarwal, Huck Bennett, Zvika Brakerski, Alexander Golovnev, Rajendra Kumar, Zeyong Li, Spencer Peters, Noah Stephens-Davidowitz, Vinod Vaikuntanathan

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Engineering an Efficient Approximate DNF-Counter.

Mate Soos, Divesh Aggarwal, Sourav Chakraborty, Kuldeep S. Meel, Maciej Obremski

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

Why we couldn't prove SETH hardness of the Closest Vector Problem for even norms!

Divesh Aggarwal, Rajendra Kumar

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

Unforgeability in Stochastic Gradient Descent.

Teodora Baluta, Ivica Nikolic, Racchit Jain, Divesh Aggarwal, Prateek Saxena

Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, 2023

2022

Privacy Amplification With Tamperable Memory via Non-Malleable Two-Source Extractors.

Divesh Aggarwal, Maciej Obremski, João Ribeiro, Mark Simkin, Luisa Siniscalchi

IEEE Trans. Inf. Theory, 2022

Survey: Non-malleable code in the split-state model.

Divesh Aggarwal, Marshall Ball, Maciej Obremski

IACR Cryptol. ePrint Arch., 2022

Non-Malleable Code in the Split-State Model.

Divesh Aggarwal, Marshall Ball, Maciej Obremski

Entropy, 2022

Why we couldn't prove SETH hardness of the Closest Vector Problem for even norms, and of the Subset Sum Problem!

Divesh Aggarwal, Rajendra Kumar

CoRR, 2022

2021

A note on the concrete hardness of the shortest independent vector in lattices.

Divesh Aggarwal, Eldon Chung

Inf. Process. Lett., 2021

Rate One-Third Non-malleable Codes.

Divesh Aggarwal, Bhavana Kanukurthi, Sai Lakshmi Bhavana Obbattu, Maciej Obremski, Sruthi Sekar

IACR Cryptol. ePrint Arch., 2021

Extractors: Low Entropy Requirements Colliding With Non-Malleability.

Eldon Chung, Maciej Obremski, Divesh Aggarwal

Electron. Colloquium Comput. Complex., 2021

Simplicity Meets Near-Optimal Rate: Non-malleable Codes and Non-malleable Two-source Extractors via Rate Boosters.

Divesh Aggarwal, Bhavana Kanukurthi, Sai Lakshmi Bhavana Obbattu, Maciej Obremski, Sruthi Sekar

Electron. Colloquium Comput. Complex., 2021

On Secret Sharing, Randomness, and Random-less Reductions for Secret Sharing.

Divesh Aggarwal, Eldon Chung, Maciej Obremski, João Ribeiro

Electron. Colloquium Comput. Complex., 2021

Dimension-Preserving Reductions Between SVP and CVP in Different p-Norms.

Divesh Aggarwal, Yanlin Chen, Rajendra Kumar, Zeyong Li, Noah Stephens-Davidowitz

CoRR, 2021

Improved (Provable) Algorithms for the Shortest Vector Problem via Bounded Distance Decoding.

Divesh Aggarwal, Yanlin Chen, Rajendra Kumar, Yixin Shen

Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021

Dimension-Preserving Reductions Between SVP and CVP in Different <i>p</i>-Norms.

Divesh Aggarwal, Yanlin Chen, Rajendra Kumar, Zeyong Li, Noah Stephens-Davidowitz

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Fine-grained hardness of CVP(P) - Everything that we can prove (and nothing else).

Divesh Aggarwal, Huck Bennett, Alexander Golovnev, Noah Stephens-Davidowitz

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

A 2^n/2-Time Algorithm for $\sqrt{n}$-SVP and $\sqrt{n}$-Hermite SVP, and an Improved Time-Approximation Tradeoff for (H)SVP.

Divesh Aggarwal, Zeyong Li, Noah Stephens-Davidowitz

Proceedings of the Advances in Cryptology - EUROCRYPT 2021, 2021

2020

Two-Source Non-Malleable Extractors and Applications to Privacy Amplification with Tamperable Memory.

Divesh Aggarwal, Maciej Obremski, João Ribeiro, Mark Simkin, Luisa Siniscalchi

IACR Cryptol. ePrint Arch., 2020

Computational and Information-Theoretic Two-Source (Non-Malleable) Extractors.

Divesh Aggarwal, Maciej Obremski, João Ribeiro, Mark Simkin, Luisa Siniscalchi

IACR Cryptol. ePrint Arch., 2020

A 2^n/2-Time Algorithm for √n-SVP and √n-Hermite SVP, and an Improved Time-Approximation Tradeoff for (H)SVP.

Divesh Aggarwal, Zeyong Li, Noah Stephens-Davidowitz

CoRR, 2020

A Note on the Concrete Hardness of the Shortest Independent Vectors Problem in Lattices.

Divesh Aggarwal, Eldon Chung

CoRR, 2020

Slide Reduction, Revisited - Filling the Gaps in SVP Approximation.

Divesh Aggarwal, Jianwei Li, Phong Q. Nguyen, Noah Stephens-Davidowitz

Proceedings of the Advances in Cryptology - CRYPTO 2020, 2020

2019

Faster Sieving Algorithm for Approximate SVP with Constant Approximation Factors.

Divesh Aggarwal, Bogdan Ursu, Serge Vaudenay

IACR Cryptol. ePrint Arch., 2019

How to Extract Useful Randomness from Unreliable Sources.

Divesh Aggarwal, Maciej Obremski, João Ribeiro, Luisa Siniscalchi, Ivan Visconti

IACR Cryptol. ePrint Arch., 2019

A constant-rate non-malleable code in the split-state model.

Divesh Aggarwal, Maciej Obremski

IACR Cryptol. ePrint Arch., 2019

Inception makes non-malleable codes shorter as well!

Divesh Aggarwal, Maciej Obremski

IACR Cryptol. ePrint Arch., 2019

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

IACR Cryptol. ePrint Arch., 2019

Extractor Lower Bounds, Revisited.

Divesh Aggarwal, Siyao Guo, Maciej Obremski, João Ribeiro, Noah Stephens-Davidowitz

Electron. Colloquium Comput. Complex., 2019

Continuous Non-Malleable Codes in the 8-Split-State Model.

Divesh Aggarwal, Nico Döttling, Jesper Buus Nielsen, Maciej Obremski, Erick Purwanto

Proceedings of the Advances in Cryptology - EUROCRYPT 2019, 2019

2018

Non-Malleable Codes from Additive Combinatorics.

Divesh Aggarwal, Yevgeniy Dodis, Shachar Lovett

SIAM J. Comput., 2018

Quantum Attacks on Bitcoin, and How to Protect Against Them.

Divesh Aggarwal, Gavin K. Brennen, Troy Lee, Miklos Santha, Marco Tomamichel

Ledger, 2018

Leakage-resilient Algebraic Manipulation Detection Codes with Optimal Parameters.

Divesh Aggarwal, Tomasz Kazana, Maciej Obremski

IACR Cryptol. ePrint Arch., 2018

Stronger Leakage-Resilient and Non-Malleable Secret-Sharing Schemes for General Access Structures.

Divesh Aggarwal, Ivan Damgård, Jesper Buus Nielsen, Maciej Obremski, Erick Purwanto, João Ribeiro, Mark Simkin

IACR Cryptol. ePrint Arch., 2018

Faster algorithms for SVP and CVP in the 𝓁_∞ norm.

Divesh Aggarwal, Priyanka Mukhopadhyay

CoRR, 2018

(Gap/S)ETH hardness of SVP.

Divesh Aggarwal, Noah Stephens-Davidowitz

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

Just Take the Average! An Embarrassingly Simple 2^n-Time Algorithm for SVP (and CVP).

Divesh Aggarwal, Noah Stephens-Davidowitz

Proceedings of the 1st Symposium on Simplicity in Algorithms, 2018

Improved Algorithms for the Shortest Vector Problem and the Closest Vector Problem in the Infinity Norm.

Divesh Aggarwal, Priyanka Mukhopadhyay

Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

2017

A New Public-Key Cryptosystem via Mersenne Numbers.

Divesh Aggarwal, Antoine Joux, Anupam Prakash, Miklos Santha

IACR Cryptol. ePrint Arch., 2017

2016

Breaking RSA Generically Is Equivalent to Factoring.

Divesh Aggarwal, Ueli Maurer

IEEE Trans. Inf. Theory, 2016

Improved hardness results for unique shortest vector problem.

Divesh Aggarwal, Chandan K. Dubey

Inf. Process. Lett., 2016

Revisiting the Sanders-Freiman-Ruzsa Theorem in $\mathbb{F}_p^n$ and its Application to Non-malleable Codes.

Divesh Aggarwal, Jop Briët

CoRR, 2016

A Note on Discrete Gaussian Combinations of Lattice Vectors.

Divesh Aggarwal, Oded Regev

Chic. J. Theor. Comput. Sci., 2016

Revisiting the Sanders-Bogolyubov-Ruzsa theorem in Fpⁿ and its application to non-malleable codes.

Divesh Aggarwal, Jop Briët

Proceedings of the IEEE International Symposium on Information Theory, 2016

2015

Affine-evasive sets modulo a prime.

Divesh Aggarwal

Inf. Process. Lett., 2015

Inception Makes Non-malleable Codes Stronger.

Divesh Aggarwal, Tomasz Kazana, Maciej Obremski

IACR Cryptol. ePrint Arch., 2015

A Note on Lower Bounds for Non-interactive Message Authentication Using Weak Keys.

Divesh Aggarwal, Alexander Golovnev

IACR Cryptol. ePrint Arch., 2015

Optimal Computational Split-state Non-malleable Codes.

Divesh Aggarwal, Shashank Agrawal, Divya Gupta, Hemanta K. Maji, Omkant Pandey, Manoj Prabhakaran

IACR Cryptol. ePrint Arch., 2015

Affine-malleable Extractors, Spectrum Doubling, and Application to Privacy Amplification.

Divesh Aggarwal, Kaave Hosseini, Shachar Lovett

Electron. Colloquium Comput. Complex., 2015

Solving the Shortest Vector Problem in 2ⁿ Time Using Discrete Gaussian Sampling: Extended Abstract.

Divesh Aggarwal, Daniel Dadush, Oded Regev, Noah Stephens-Davidowitz

Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

Solving the Closest Vector Problem in 2^n Time - The Discrete Gaussian Strikes Again!

Divesh Aggarwal, Daniel Dadush, Noah Stephens-Davidowitz

Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

2014

Leakage-resilient non-malleable codes.

Divesh Aggarwal, Stefan Dziembowski, Tomasz Kazana, Maciej Obremski

Electron. Colloquium Comput. Complex., 2014

Non-malleable Reductions and Applications.

Divesh Aggarwal, Yevgeniy Dodis, Tomasz Kazana, Maciej Obremski

Electron. Colloquium Comput. Complex., 2014

Solving the Shortest Vector Problem in $2^n$ Time via Discrete Gaussian Sampling.

Divesh Aggarwal, Daniel Dadush, Oded Regev, Noah Stephens-Davidowitz

CoRR, 2014

2013

Amplifying Privacy in Privacy Amplification.

Divesh Aggarwal, Yevgeniy Dodis, Zahra Jafargholi, Eric Miles, Leonid Reyzin

IACR Cryptol. ePrint Arch., 2013

2011

The Leakage-Resilience Limit of a Computational Problem Is Equal to Its Unpredictability Entropy.

Divesh Aggarwal, Ueli Maurer

Proceedings of the Advances in Cryptology - ASIACRYPT 2011, 2011

2006

Algorithms on Graphs with Small Dominating Targets.

Divesh Aggarwal, Chandan K. Dubey, Shashank K. Mehta

Proceedings of the Algorithms and Computation, 17th International Symposium, 2006

2005

Domination Search on Graphs with Low Dominating-Target-Number.

Divesh Aggarwal, Shashank K. Mehta, Jitender S. Deogun

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2005