Divesh Aggarwal

124 papers A* 14A 5B 6Journal 80Unranked 19

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