Divesh Aggarwal
Principal Investigator
Centre for Quantum TechnologiesAssociate Professor
Department of Computer Science, School of Computing, National University of Singapore
S15-04-12
Preprints
- D. Aggarwal, R. Jain, N.G. Boddu. Quantum secure non-malleable codes in the split-state model.
- D. Aggarwal, R. Jain, N.G. Boddu, Maciej Lukasz Obremski. Quantum Measurement Adversary.
- D. Aggarwal, Joao Ribeiro, Mark Simkin , Luisa Siniscalchi, Maciej Lukasz Obremski. Computational and Information-Theoretic Two-Source (Non-Malleable) Extractors.
- D. Aggarwal, Yanlin Chen, Rajendra Kumar, Yixin Shen. Improved (Provable) Algorithms for the Shortest Vector Problem via Bounded Distance Decoding.
- D. Aggarwal, Maciej Lukasz Obremski. A constant-rate non-malleable code in the split-state model..
- D. Aggarwal, Jianwei Li, Phong Q. Nguyen, Noah Heskel Sklaire Stephens-Davidowitz. Slide Reduction, Revisited---Filling the Gaps in SVP Approximation.
- D. Aggarwal, Noah Heskel Sklaire Stephens-Davidowitz. An improved constant in Banaszczyk\'s transference theorem.
- D. Aggarwal, Maciej Lukasz Obremski. Inception makes non-malleable codes shorter as well!.
Publications
- D. Aggarwal, Maciej Lukasz Obremski. (2022). A constant rate non-malleable code in the split-state model. IEEE Annual Symposium on Foundations of Computer Science (FOCS)
- D. Aggarwal, G Malavolta, M Hajiabadi, , J Dujmovic, , N Dottling, , Maciej Lukasz Obremski. (2022). Algebraic Restriction Codes and their Applications. Innovations in Theoretical Computer Science (ITCS)
- L Siniscalchi, M Simkin, J Ribeiro, D. Aggarwal, Maciej Lukasz Obremski. (2022). Two-Source Non-Malleable Extractors and Applications to Privacy Amplification with Tamperable Memory . IEEE Trans. Inf.
- J Ribeiro, L Siniscalchi, I Visconti, D. Aggarwal, Maciej Lukasz Obremski. (2020). How to Extract Useful Randomness from Unreliable Sources. Proceedings of EUROCRYPT
- N Stephens-Davidowitz, J Ribeiro, , S Guo, D. Aggarwal, Maciej Lukasz Obremski. (2020). Extractors Lower Bounds, Revisited. RANDOM
- Siyao Guo, D. Aggarwal, Joao Ribeiro, Noah Heskel Sklaire Stephens-Davidowitz, Maciej Lukasz Obremski. (2020). Extractor Lower Bounds, Revisited. RANDOM
- D. Aggarwal, João Ribeiro, Luisa Siniscalchi, Ivan Visconti, Maciej Lukasz Obremski. (2020). How to Extract Useful Randomness from Unreliable Sources. Proceedings of EUROCRYPT
- D. Aggarwal, Ivan Damgard, Jesper Buus Nielsen, Joao Ribeiro, Mark Simkin, E. Purwanto, Maciej Lukasz Obremski. (2019). Stronger Leakage-Resilient and Non-Malleable Secret-Sharing Schemes for General Access Structures. Proceedings of CRYPTO
- D. Aggarwal, Nico Dottling, Jesper Buus Nielsen, Maciej Obremski, E. Purwanto. (2019). Continuous non-malleable codes in the 8-split-state model. Springer EUROCRYPT 531-561
- D. Aggarwal, Kai-Min Chung, H.H. Lin, T. Vidick. (2019). A Quantum-Proof Non-Malleable Extractor, With Application to Privacy Amplification against Active Quantum Adversaries. Springer EUROCRYPT 442-469
- D. Aggarwal, Gavin K. Brennen, T. Lee, M. Santha, M. Tomamichel, T. Lee. (2018). Quantum attacks on Bitcoin, and how to protect against them. Ledger 3
- D. Aggarwal, N. Stephens-Davidowitz. (2018). (Gap/S)ETH Hardness of SVP. ACM STOC
- D. Aggarwal, P. Mukhopadhyay. (2018). Improved algorithms for the Shortest Vector Problem and the Closest Vector Problem in the infinity norm. ISAAC
- D. Aggarwal, A. Joux, A. Prakash, M. Santha. (2018). A new public-key cryptosystem via Mersenne numbers. CRYPTO
- D. Aggarwal, Gavin K. Brennen, T. Lee, M. Santha, M. Tomamichel, T. Lee. (2018). Quantum attacks on Bitcoin, and how to protect against them. Ledger
- D. Aggarwal, Noah Stephens-Davidowitz. (2018). Just Take the Average! An Embarrassingly Simple $2^n$-Time Algorithm for SVP (and CVP). Proceedings of the Symposium on Simplicity in Algorithms
- D. Aggarwal, M. Obremski, T. Kazana. (2017). Inception makes non-malleable codes stronger. Theory of Cryptography
- D. Aggarwal, O. Regev. (2016). A Note on Discrete Gaussian Combinations of Lattice Vectors. CJTCS 1
- D. Aggarwal, U. Maurer. (2016). Breaking RSA Generically Is Equivalent to Factoring. IEEE Trans. Inf. 62 6251-6259
- C. Dubey, D. Aggarwal. (2016). Improved hardness results for unique shortest vector problem. Inf. Proc. Lett 116 631-637
- D. Aggarwal, S. Lovett, K. Hosseini. (2016). Affine-malleable extractors, spectrum doubling, and application to privacy amplification.
- D. Aggarwal, S Sekar, B Kanukurthi, B Obbattu, Maciej Lukasz Obremski. Non-malleable Codes with rate 1/3 via Rate Boosters. Annual ACM Symposium on Theory of Computing (STOC)
