Prashant Nalini VASUDEVAN

NUS Presidential Young Professor


RESEARCH AREAS

RESEARCH INTERESTS

  • Cryptography

  • Complexity Theory

RESEARCH PROJECTS

Computational Hardness Assumptions and the Foundations of Cryptography

This program seeks to broaden and diversify the foundations of cryptography by identifying new plausible computational hardness assumptions that can be used to construct cryptosystems. Our current approach is to study and construct "fine-grained" cryptographic primitives based on the conjectured hardness of various well-studied algorithmic problems.


RESEARCH GROUPS

TEACHING INNOVATIONS

SELECTED PUBLICATIONS

AWARDS & HONOURS

MODULES TAUGHT

CS3230
Design and Analysis of Algorithms
CS4230
Foundations of Modern Cryptography
CS5430
Foundations of Modern Cryptography