Prashant Nalini Vasudevan

My research is centered around the theoretical foundations of cryptography and its connections to other areas of theoretical computer science. I am particularly interested in the nature of hardness that is useful for cryptography, and in identifying useful hard problems. I spend a lot of time trying to come up with new constructions of fundamental cryptographic primitives and studying the connections between them. A concise account of my motivations, past work and approach to research may be found in my (outdated) research statement.

Associates
Postdocs
Rohit Chatterjee (2023-present)
PhD Students
Haoxing Lin (2023-present)
Yunqi Li (2023-present)
Kel Zin Tan (2024-present)
Research Assistants
Changrui Mu (2024-2025)
Prospects

As of December 2025, I do not have postdoctoral positions available. I am not actively looking for PhD students, but if you meet the conditions below and would like to work with me, feel free to send me an email.

Postdocs
Postdoctoral researchers who work on the foundations of cryptography, information-theoretic cryptography, and related areas of complexity theory and theoretical computer science.
PhD Students
The most important requirements are a strong interest in the theory of computer science and/or cryptography, and the mathematical maturity needed to work with the complex concepts that arise in research in the field (in probability theory, algebra, combinatorics, etc.). A background in theoretical computer science would be helpful – ideally some advanced courses and research experience. You will also need to be admitted to the PhD programme in Computer Science at NUS.
Interns
I am not planning to take on any undergraduate interns in the near future. Please do not email me asking about this.
Funding
Source Title Start End
NUS Presidential Young Professorship Computational Hardness Assumptions and the Foundations of Cryptography Aug 2021 July 2026
NRF Fellowship Fine-Grained Cryptography Aug 2022 July 2027