Secret Sharing and Statistical Zero Knowledge. - Vinod Vaikuntanathan; Prashant Nalini Vasudevan (ASIACRYPT (1), 2015)

From Statistical Zero Knowledge to Secret Sharing. - Vinod Vaikuntanathan; Prashant Nalini Vasudevan (IACR Cryptol. ePrint Arch., 2015)

Improvements to Secure Computation with Penalties. - Ranjit Kumaresan; Vinod Vaikuntanathan; Prashant Nalini Vasudevan (CCS, 2016)

On SZK and PP. - Adam Bouland; Lijie Chen 001; Dhiraj Holden; Justin Thaler; Prashant Nalini Vasudevan (Electron. Colloquium Comput. Complex., 2016)

Fine-grained Cryptography. - Akshay Degwekar; Vinod Vaikuntanathan; Prashant Nalini Vasudevan (IACR Cryptol. ePrint Arch., 2016)

Average-Case Fine-Grained Hardness. - Marshall Ball; Alon Rosen; Manuel Sabin; Prashant Nalini Vasudevan (Electron. Colloquium Comput. Complex., 2017)

Multi Collision Resistant Hash Functions and their Applications. - Itay Berman; Akshay Degwekar; Ron Rothblum; Prashant Nalini Vasudevan (Electron. Colloquium Comput. Complex., 2017)

From Laconic Zero-Knowledge to Public-Key Cryptography. - Itay Berman; Akshay Degwekar; Ron Rothblum; Prashant Nalini Vasudevan (Electron. Colloquium Comput. Complex., 2017)

Proofs of Useful Work. - Marshall Ball; Alon Rosen; Manuel Sabin; Prashant Nalini Vasudevan (IACR Cryptol. ePrint Arch., 2017)

From Laconic Zero-Knowledge to Public-Key Cryptography - Extended Abstract. - Itay Berman; Akshay Degwekar; Ron D. Rothblum; Prashant Nalini Vasudevan (CRYPTO (3), 2018)

Placing Conditional Disclosure of Secrets in the Communication Complexity Universe. - Benny Applebaum; Prashant Nalini Vasudevan (Electron. Colloquium Comput. Complex., 2018)

XOR Codes and Sparse Random Linear Equations with Noise. - Andrej Bogdanov; Manuel Sabin; Prashant Nalini Vasudevan (Electron. Colloquium Comput. Complex., 2018)

Proofs of Work from Worst-Case Assumptions. - Marshall Ball; Alon Rosen; Manuel Sabin; Prashant Nalini Vasudevan (IACR Cryptol. ePrint Arch., 2018)

Leakage Resilient Secret Sharing and Applications. - Akshayaram Srinivasan; Prashant Nalini Vasudevan (IACR Cryptol. ePrint Arch., 2018)

Fine-grained cryptography. - Prashant Nalini Vasudevan (2018)

XOR Codes and Sparse Learning Parity with Noise. - Andrej Bogdanov; Manuel Sabin; Prashant Nalini Vasudevan (SODA, 2019)

Statistical Difference Beyond the Polarizing Regime. - Itay Berman; Akshay Degwekar; Ron D. Rothblum; Prashant Nalini Vasudevan (Electron. Colloquium Comput. Complex., 2019)

Tight Verifiable Delay Functions. - Nico Döttling; Sanjam Garg; Giulio Malavolta; Prashant Nalini Vasudevan (IACR Cryptol. ePrint Arch., 2019)

Nearly Optimal Robust Secret Sharing against Rushing Adversaries. - Pasin Manurangsi; Akshayaram Srinivasan; Prashant Nalini Vasudevan (IACR Cryptol. ePrint Arch., 2019)

Cryptography from Information Loss. - Marshall Ball; Elette Boyle; Akshay Degwekar; Apoorvaa Deshpande; Alon Rosen; Vinod Vaikuntanathan; Prashant Nalini Vasudevan (Electron. Colloquium Comput. Complex., 2020)

Batch Verification for Statistical Zero Knowledge Proofs. - Inbar Kaslasi; Prashant Nalini Vasudevan; Guy N. Rothblum; Ron Rothblum; Adam Sealfon (Electron. Colloquium Comput. Complex., 2020)

Formalizing Data Deletion in the Context of the Right to be Forgotten. - Sanjam Garg; Shafi Goldwasser; Prashant Nalini Vasudevan (IACR Cryptol. ePrint Arch., 2020)

On the Power of Statistical Zero Knowledge. - Adam Bouland; Lijie Chen 001; Dhiraj Holden; Justin Thaler; Prashant Nalini Vasudevan (SIAM J. Comput., 2020)

Public-Coin Statistical Zero-Knowledge Batch Verification against Malicious Verifiers. - Inbar Kaslasi; Ron Rothblum; Prashant Nalini Vasudevan (Electron. Colloquium Comput. Complex., 2021)

Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-bounds, and Separations. - Benny Applebaum; Barak Arkis; Pavel Raykov; Prashant Nalini Vasudevan (SIAM J. Comput., 2021)

Collision-Resistance from Multi-Collision-Resistance. - Ron D. Rothblum; Prashant Nalini Vasudevan (Electron. Colloquium Comput. Complex., 2022)

Deletion inference, reconstruction, and compliance in machine (un)learning. - Ji Gao; Sanjam Garg; Mohammad Mahmoody; Prashant Nalini Vasudevan (Proc. Priv. Enhancing Technol., 2022)

Control, Confidentiality, and the Right to be Forgotten. - Aloni Cohen; Adam D. Smith 001; Marika Swanberg; Prashant Nalini Vasudevan (CCS, 2023)

Batch Proofs are Statistically Hiding. - Nir Bitansky; Chethan Kamath; Omer Paneth; Ron Rothblum; Prashant Nalini Vasudevan (Electron. Colloquium Comput. Complex., 2023)

k-SUM in the Sparse Regime. - Shweta Agrawal 001; Sagnik Saha; Nikolaj I. Schwartzbach; Akhil Vanukuri; Prashant Nalini Vasudevan (Electron. Colloquium Comput. Complex., 2023)

k-SUM in the Sparse Regime: Complexity and Applications. - Shweta Agrawal 001; Sagnik Saha; Nikolaj I. Schwartzbach; Akhil Vanukuri; Prashant Nalini Vasudevan (CRYPTO (2), 2024)

Instance-Hiding Interactive Proofs - (Extended Abstract). - Changrui Mu; Prashant Nalini Vasudevan (TCC (1), 2024)

Doubly-Efficient Batch Verification in Statistical Zero-Knowledge. - Or Keret; Ron Rothblum; Prashant Nalini Vasudevan (Electron. Colloquium Comput. Complex., 2024)

Strong Batching for Non-Interactive Statistical Zero-Knowledge. - Changrui Mu; Shafik Nassar; Ron Rothblum; Prashant Nalini Vasudevan (Electron. Colloquium Comput. Complex., 2024)

Instance-Hiding Interactive Proofs. - Changrui Mu; Prashant Nalini Vasudevan (Electron. Colloquium Comput. Complex., 2024)

On Wagner's k-Tree Algorithm Over Integers. - Haoxing Lin; Prashant Nalini Vasudevan (IACR Cryptol. ePrint Arch., 2024)

Hardness Amplification for Real-Valued Functions. - Yunqi Li; Prashant Nalini Vasudevan (Electron. Colloquium Comput. Complex., 2025)