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.

Prospects

I am often looking for researchers at various levels to come work with me, though (as of Feb 2024) I am not planning on hiring anyone new in the next few months. If you are interested in working with me in the following capacities, contact me some time during the summer of 2024. NUS is a great environment, and substantial funding is available for fundamental research. A number of amazing researchers are either already here or just a short flight away.

Postdocs
Postdoctoral researchers who work on the foundations of cryptography, information-theoretic cryptography, and related areas of complexity theory and theoretical computer science. See here for more details and application instructions.
PhD Students
Motivated students interested in the theory of cryptography. You will need some background in theoretical computer science – ideally some advanced courses and research experience. You will also need to be admitted to the PhD program in Computer Science at NUS. Send me an email if you are applying for the program (or if you are already a student at NUS) and would like to work with me.
Interns
I am not planning to take on any undergraduate interns in 2024. 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