Prashant Nalini Vasudevan
Sample-Preserving Search-to-Decision Reduction for Noisy Linear Equations over Large Moduli Andrej Bogdanov, Kel Zin Tan, and Prashant Nalini Vasudevan
arXiv
Smooth Random Self-Reductions Yunqi Li, Rahul Santhanam, and Prashant Nalini Vasudevan
Towards Worst-case Hardness for Low-Noise LPN Divesh Aggarwal, Rishav Gupta, Hai Hoang Nguyen, Kel Zin Tan, and Prashant Nalini Vasudevan ITCS 2026
arXiv
Weak Zero-Knowledge and One-Way Functions Rohit Chatterjee, Yunqi Li, and Prashant Nalini Vasudevan ITC 2026
arXiv
Public-Key Encryption from the MinRank Problem Rohit Chatterjee, Changrui Mu, and Prashant Nalini Vasudevan EUROCRYPT 2026
ePrint
Improved Search-to-Decision Reduction for Random Local Functions Kel Zin Tan and Prashant Nalini Vasudevan EUROCRYPT 2026
ECCC
Decoding Balanced Linear Codes With Preprocessing Andrej Bogdanov, Rohit Chatterjee, Yunqi Li, and Prashant Nalini Vasudevan ITCS 2026
ECCC
On Wagner's k-Tree Algorithm Over Integers Haoxing Lin and Prashant Nalini Vasudevan ASIACRYPT 2025
ePrint
Hardness Amplification for Real-Valued Functions Yunqi Li and Prashant Nalini Vasudevan CCC 2025
ECCC
Doubly-Efficient Batch Verification in Statistical Zero-Knowledge Or Keret, Ron D. Rothblum, and Prashant Nalini Vasudevan TCC 2024
ECCC
Instance-Hiding Interactive Proofs Changrui Mu and Prashant Nalini Vasudevan TCC 2024
ECCC
k-SUM in the Sparse Regime Shweta Agrawal, Sagnik Saha, Nikolaj I. Schwartzbach, Akhil Vanukuri, and Prashant Nalini Vasudevan CRYPTO 2024
arXiv
Batch Proofs are Statistically Hiding Nir Bitansky, Chethan Kamath, Omer Paneth, Ron D. Rothblum, and Prashant Nalini Vasudevan STOC 2024
ECCC
Strong Batching for Non-Interactive Statistical Zero-Knowledge Changrui Mu, Shafik Nassar, Ron D. Rothblum, and Prashant Nalini Vasudevan EUROCRYPT 2024
ePrint
Control, Confidentiality, and the Right to be Forgotten Aloni Cohen, Adam Smith, Marika Swanberg, and Prashant Nalini Vasudevan CCS 2023
Preliminary version presented at the UpML and TPDP workshops at ICML 2022
arXiv
Collision-Resistance from Multi-Collision-Resistance Ron D. Rothblum and Prashant Nalini Vasudevan CRYPTO 2022
Invited to the Journal of Cryptology
ECCC ePrint
Deletion Inference, Reconstruction, and Compliance in Machine (Un)Learning Ji Gao, Sanjam Garg, Mohammad Mahmoody, and Prashant Nalini Vasudevan PETS 2022
Preliminary version presented at the PPML Workshop at NeurIPS 2020
arXiv
Public-Coin Statistical Zero-Knowledge Batch Verification Against Malicious Verifiers Inbar Kaslasi, Ron D. Rothblum, and Prashant Nalini Vasudevan EUROCRYPT 2021
ECCC
Batch Verification for Statistical Zero Knowledge Proofs Inbar Kaslasi, Guy N. Rothblum, Ron D. Rothblum, Adam Sealfon, and Prashant Nalini Vasudevan TCC 2020
ECCC
Tight Verifiable Delay Functions Nico Döttling, Sanjam Garg, Giulio Malavolta, and Prashant Nalini Vasudevan SCN 2020
ePrint
Nearly Optimal Robust Secret Sharing against Rushing Adversaries Pasin Manurangsi, Akshayaram Srinivasan, and Prashant Nalini Vasudevan CRYPTO 2020
ePrint
Formalizing Data Deletion in the Context of the Right to be Forgotten Sanjam Garg, Shafi Goldwasser, and Prashant Nalini Vasudevan EUROCRYPT 2020
Presented also at the ICML 2020 workshop on Law and Machine Learning
arXiv slides talk
Cryptography from Information Loss Marshall Ball, Elette Boyle, Akshay Degwekar, Apoorvaa Deshpande, Alon Rosen, Vinod Vaikuntanathan, and Prashant Nalini Vasudevan ITCS 2020
ECCC slides
Statistical Difference Beyond the Polarizing Regime Itay Berman, Akshay Degwekar, Ron D. Rothblum, and Prashant Nalini Vasudevan TCC 2019
ECCC
Leakage Resilient Secret Sharing and Applications Akshayaram Srinivasan and Prashant Nalini Vasudevan CRYPTO 2019
A version co-authored by Peihan Miao was presented at the NIST Threshold Cryptography Workshop 2019 (pdf)
ePrint slides
Placing Conditional Disclosure of Secrets in the Communication Complexity Universe Benny Applebaum and Prashant Nalini Vasudevan ITCS 2019
ECCC slides
XOR Codes and Sparse Random Linear Equations with Noise Andrej Bogdanov, Manuel Sabin, and Prashant Nalini Vasudevan SODA 2019
ECCC
From Laconic Zero-Knowledge to Public-Key Cryptography Itay Berman, Akshay Degwekar, Ron D. Rothblum, and Prashant Nalini Vasudevan CRYPTO 2018
ECCC slides
Proofs of Work from Worst-Case Assumptions Marshall Ball, Alon Rosen, Manuel Sabin, and Prashant Nalini Vasudevan CRYPTO 2018
An older version appeared on the Cryptology ePrint Archive as Proofs of Useful Work
ePrint
Multi Collision Resistant Hash Functions and their Applications Itay Berman, Akshay Degwekar, Ron D. Rothblum, and Prashant Nalini Vasudevan EUROCRYPT 2018
ECCC
On the Power of Statistical Zero Knowledge Adam Bouland, Lijie Chen, Dhiraj Holden, Justin Thaler, and Prashant Nalini Vasudevan FOCS 2017
Invited to the special issue of SICOMP for FOCS 2017
ECCC
Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-Bounds, and Separations Benny Applebaum, Barak Arkis, Pavel Raykov, and Prashant Nalini Vasudevan CRYPTO 2017
ECCC slides
Average-Case Fine-Grained Hardness Marshall Ball, Alon Rosen, Manuel Sabin, and Prashant Nalini Vasudevan STOC 2017
ECCC slides talk
Improvements to Secure Computation with Penalties Ranjit Kumaresan, Vinod Vaikuntanathan, and Prashant Nalini Vasudevan CCS 2016
pdf
Fine-Grained Cryptography Akshay Degwekar, Vinod Vaikuntanathan, and Prashant Nalini Vasudevan CRYPTO 2016
ePrint slides
Secret Sharing and Statistical Zero Knowledge Vinod Vaikuntanathan and Prashant Nalini Vasudevan ASIACRYPT 2015
ePrint slides
Fine-Grained Cryptography Phd Thesis
pdf
A Study of Efficient Secret Sharing SM Thesis
pdf
Made using Jinja2, Skeleton, and way too much time