Divesh Aggarwal
Principal Investigator
S15-04-12
dcsdiva@nus.edu.sg
65165628
Divesh Aggarwal

Short bio

Divesh Aggarwal has received Ph.D. degree in Computer Science from ETH Zurich in 2012. From 2012 to 2016, he spent two years each as a postdoctoral researcher at New York University and at EPFL. Since 2016, he is an Assistant Professor in the Department of Computer Science, and a Principal Investigator in the Centre for Quantum Technologies at the National University of Singapore. His research interests include lattices, pseudorandomness, cryptography, coding theory, algorithms, and computational complexity.

Preprints

  • D. Aggarwal, Kai-Min Chung, H.H. Lin, T. Vidick. A Quantum-Proof Non-Malleable Extractor, With Application to Privacy Amplification against Active Quantum Adversaries.
  • D. Aggarwal, Noah Stephens-Davidowitz. Just Take the Average! An Embarrassingly Simple $2^n$-Time Algorithm for SVP (and CVP).

Publications

  • T. Kazana, D. Aggarwal. (2017). Inception makes non-malleable codes stronger. -None-
  • T. Kazana, M. Obremski, D. Aggarwal. (2017). Inception makes non-malleable codes stronger. Proceedings of the 15th IACR Theory of Cryptography Conference. -None-
  • 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 Transactions on Information Theory 62 6251-6259
  • C. Dubey, D. Aggarwal. (2016). Improved hardness results for unique shortest vector problem. Inf. Proc. Lett 116 631-637
  • K. Hosseini, D. Aggarwal, S. Lovett. Affine-malleable extractors, spectrum doubling, and application to privacy amplification. -None-