Divesh Aggarwal                             

I am an Assistant Professor in the Department of Computer Science at NUS, and a Principal Investigaror at CQT since August, 2016. Before this, I was a post-doctoral researcher for two years each in the School of Computer and Communication Sciences at EPFL, and the Department of Computer Science at New York University. I completed my PhD under the guidance of Prof. Ueli Maurer at ETH Zurich in February, 2012. 

I am looking for highly motivated PhD students and postdocs. Also, I am happy to invite exceptional undergraduate/graduate students for a 3 month internship position, or a longer RA position. If you are interested in any of these, write to me. 

Contact Information:
   1. Centre of Quantum Technologies
       S15 #04-12
       National University of Singapore
       Block S15, 3 Science Drive 2
       Singapore 117543
   2. School of Computing
       COM2 #02-02
       13 Computing Drive
       Singapore 117417
   Phone:   +65 6516 5628 (office)
               +65 6516 2911 (office)
               +65 9272 9378 (mobile)
   Email:   divesh@comp.nus.edu.sg

Research Interests:
Broadly speaking, I am interested in discrete structures and their applications in theoretical computer science. In particular, I am interested in the following:
  •  Information-theoretic Cryptography
  •  Randomness Extractors and Applications
  •  Lattices in Computer Science
  •  Coding Theory
  •  Computational number theory

  • A note on discrete Gaussian combinations of lattice vectors [link]
    Divesh Aggarwal and Oded Regev.  
    In Chicago Journal of Theoretical Computer Science, 2016

  • Improved hardness results for unique shortest vector problem [link]
    Divesh Aggarwal and Chandan Dubey.
    In Information Processing Letters 2016.
  • Revisiting the Sanders-Bogolyubov-Ruzsa Theorem in F_p^n and its Application to Non-malleable Codes [link]
    Divesh Aggarwal and Jop Briët.
    ISIT 2016.
  • Affine-malleable extractors, spectrum doubling, and application to privacy amplification [link]
    Divesh Aggarwal, Kaave Hosseini, and Shachar Lovett.
    ISIT 2016. 
  • A Note on lower bounds for non-interactive message authentication using weak keys [link]
    Divesh Aggarwal and Alexander Golovnev.
    ITW 2015. 
  • Affine-evasive sets modulo a prime [link]
    Divesh Aggarwal.
    Information Processing Letters 2015.
  • The leakage-resilience limit of a computational problem is equal to its unpredictability entropy [link]
    Divesh Aggarwal and Ueli Maurer.
    ASIACRYPT 2011. 
  • The equivalence of strong RSA and factoring in the generic ring model of computation [link]
    Divesh Aggarwal, Ueli Maurer, and Igor Shparlinski
    WCC 2011. 
  • Breaking RSA generically is equivalent to factoring  [link]
    Divesh Aggarwal and Ueli Maurer.
    EUROCRYPT 2009.

Teaching experience:

  • Introduction to Information Theory         Spring 2017             NUS
  • Fundamental Algorithms                        Fall 2012-2013        NYU
  • Algorithms, Probability and Computing    Fall 2011                ETH Zurich
  • Information Security                             Spring 2008-2011    ETH Zurich
  • Cryptography                                       Fall 2008                 ETH Zurich
Professional Activities:
Program Committee: TCC 2016-B, SCN 2016, ICITS 2016, ICITS 2017
Reviewed several papers for: STOC, FOCS, SODA, CCC, ICALP, Crypto, Eurocrypt, FSTTCS, ISAAC, TCC, Asiacrypt, Africacrypt, PKC, CT-RSA, SCN, Discrete Mathematics, Theoretical Computer Science, Journal of Cryptology, Designs Codes and Cryptography, IEEE Transactions of Information Theory