Prashant Nalini Vasudevan

 |  AS6-04-06
An excessively flattering photograph of me. 

I am an assistant professor in the Dept of Computer Science at the National University of Singapore. I am interested in Cryptography, its interactions with Complexity Theory, Data Protection, and broadly in Theoretical Computer Science.

If you wish to know more, see my CV or dblp page.


CS6230: Topics in Information Security – Probabilistic Proofs Systems (AY2021/22, Sem 1)


Data Leakage and Deletion Compliance in Machine Unlearning
with Ji Gao, Sanjam Garg, and Mohammad Mahmoody
Preliminary version presented at the PPML Workshop at NeurIPS 2020

Public-Coin Statistical Zero-Knowledge Batch Verification Against Malicious Verifiers
with Inbar Kaslasi and Ron D. Rothblum

Batch Verification for Statistical Zero Knowledge Proofs
with Inbar Kaslasi, Guy N. Rothblum, Ron D. Rothblum, and Adam Sealfon
TCC 2020

Tight Verifiable Delay Functions
with Nico Döttling, Sanjam Garg, and Giulio Malavolta
SCN 2020

Nearly Optimal Robust Secret Sharing against Rushing Adversaries
with Pasin Manurangsi and Akshayaram Srinivasan

Formalizing Data Deletion in the Context of the Right to be Forgotten
with Sanjam Garg and Shafi Goldwasser
Video and slides from talk at EUROCRYPT
Presented also at the ICML 2020 workshop on Law and Machine Learning

Cryptography from Information Loss
with Marshall Ball, Elette Boyle, Akshay Degwekar, Apoorvaa Deshpande, Alon Rosen, and Vinod Vaikuntanathan
ITCS 2020
Slides from talk at the UCSD Theory Seminar

Statistical Difference Beyond the Polarizing Regime
with Itay Berman, Akshay Degwekar, and Ron D. Rothblum
TCC 2019

Leakage Resilient Secret Sharing and Applications
with Akshayaram Srinivasan
A version with Peihan Miao was presented at the NIST Threshold Cryptography Workshop 2019
Slides from talk at NIST

Placing Conditional Disclosure of Secrets in the Communication Complexity Universe
with Benny Applebaum
ITCS 2019
Slides from talk at ITCS
Slides from a broader talk about CDS at the Bertinoro Lower Bounds in Cryptography workshop 2019

XOR Codes and Sparse Random Linear Equations with Noise
with Andrej Bogdanov and Manuel Sabin
SODA 2019

From Laconic Zero-Knowledge to Public-Key Cryptography
with Itay Berman, Akshay Degwekar, and Ron D. Rothblum
Slides from talk at the Galilee Workshop 2018, based on slides by Akshay

Proofs of Work from Worst-Case Assumptions
with Marshall Ball, Alon Rosen, and Manuel Sabin
An older version appeared on the Cryptology ePrint Archive as Proofs of Useful Work

Multi Collision Resistant Hash Functions and their Applications
with Itay Berman, Akshay Degwekar, and Ron D. Rothblum

On the Power of Statistical Zero Knowledge
with Adam Bouland, Lijie Chen, Dhiraj Holden, and Justin Thaler
FOCS 2017
Invited to the special issue of SICOMP for FOCS 2017

Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-Bounds, and Separations
with Benny Applebaum, Barak Arkis, and Pavel Raykov
Slides from talk at CRYPTO

Average-Case Fine-Grained Hardness
with Marshall Ball, Alon Rosen, and Manuel Sabin
STOC 2017
Slides and video from talk at the University of Waterloo

Improvements to Secure Computation with Penalties
with Ranjit Kumaresan and Vinod Vaikuntanathan
CCS 2016

Fine-Grained Cryptography
with Akshay Degwekar and Vinod Vaikuntanathan
Slides from talk at Tel Aviv University

Secret Sharing and Statistical Zero Knowledge
with Vinod Vaikuntanathan
Slides from talk at ASIACRYPT

Fine-Grained Cryptography
PhD Thesis

A Study of Efficient Secret Sharing
SM Thesis


NUS Presidential Young Professorship