Prashant Nalini Vasudevan

ORCID

Publication Activity (10 Years)

Years Active: 2015-2024
Publications (10 Years): 73

Top Venues

IACR Cryptol. ePrint Arch.

Electron. Colloquium Comput. Complex.

CoRR

CRYPTO (3)

Massachusetts Institute of Technology, Cambridge, USA (PHD)

Education History

Massachusetts Institute of Technology, Cambridge, USA

PHD

Publications

Ron D. Rothblum, Prashant Nalini Vasudevan
Collision Resistance from Multi-collision Resistance. J. Cryptol. 37 (2) (2024)
Or Keret, Ron D. Rothblum, Prashant Nalini Vasudevan
Doubly-Efficient Batch Verification in Statistical Zero-Knowledge. IACR Cryptol. ePrint Arch. 2024 (2024)
Or Keret, Ron Rothblum, Prashant Nalini Vasudevan
Doubly-Efficient Batch Verification in Statistical Zero-Knowledge. Electron. Colloquium Comput. Complex. (2024)
Shweta Agrawal, Sagnik Saha, Nikolaj I. Schwartzbach, Akhil Vanukuri, Prashant Nalini Vasudevan
k-SUM in the Sparse Regime: Complexity and Applications. CRYPTO (2) (2024)
Changrui Mu, Shafik Nassar, Ron D. Rothblum, Prashant Nalini Vasudevan
Strong Batching for Non-Interactive Statistical Zero-Knowledge. IACR Cryptol. ePrint Arch. 2024 (2024)
Changrui Mu, Shafik Nassar, Ron Rothblum, Prashant Nalini Vasudevan
Strong Batching for Non-Interactive Statistical Zero-Knowledge. Electron. Colloquium Comput. Complex. (2024)
Changrui Mu, Prashant Nalini Vasudevan
Instance-Hiding Interactive Proofs. IACR Cryptol. ePrint Arch. 2024 (2024)
Changrui Mu, Prashant Nalini Vasudevan
Instance-Hiding Interactive Proofs. Electron. Colloquium Comput. Complex. (2024)
Nir Bitansky, Chethan Kamath, Omer Paneth, Ron D. Rothblum, Prashant Nalini Vasudevan
Batch Proofs Are Statistically Hiding. STOC (2024)
Changrui Mu, Shafik Nassar, Ron D. Rothblum, Prashant Nalini Vasudevan
Strong Batching for Non-interactive Statistical Zero-Knowledge. EUROCRYPT (6) (2024)
Sagnik Saha, Nikolaj I. Schwartzbach, Prashant Nalini Vasudevan
The Planted $k$-SUM Problem: Algorithms, Lower Bounds, Hardness Amplification, and Cryptography. Electron. Colloquium Comput. Complex. (2023)
Sagnik Saha, Nikolaj Ignatieff Schwartzbach, Prashant Nalini Vasudevan
The Planted k-SUM Problem: Algorithms, Lower Bounds, Hardness Amplification, and Cryptography. IACR Cryptol. ePrint Arch. 2023 (2023)
Nir Bitansky, Chethan Kamath, Omer Paneth, Ron Rothblum, Prashant Nalini Vasudevan
Batch Proofs are Statistically Hiding. IACR Cryptol. ePrint Arch. 2023 (2023)
Aloni Cohen, Adam D. Smith, Marika Swanberg, Prashant Nalini Vasudevan
Control, Confidentiality, and the Right to be Forgotten. CCS (2023)
Nir Bitansky, Chethan Kamath, Omer Paneth, Ron Rothblum, Prashant Nalini Vasudevan
Batch Proofs are Statistically Hiding. Electron. Colloquium Comput. Complex. (2023)
Sagnik Saha, Nikolaj I. Schwartzbach, Prashant Nalini Vasudevan
The Planted k-SUM Problem: Algorithms, Lower Bounds, Hardness Amplification, and Cryptography. CoRR (2023)
Ji Gao, Sanjam Garg, Mohammad Mahmoody, Prashant Nalini Vasudevan
Deletion inference, reconstruction, and compliance in machine (un)learning. Proc. Priv. Enhancing Technol. 2022 (3) (2022)
Ron D. Rothblum, Prashant Nalini Vasudevan
Collision-Resistance from Multi-Collision-Resistance. IACR Cryptol. ePrint Arch. 2022 (2022)
Ji Gao, Sanjam Garg, Mohammad Mahmoody, Prashant Nalini Vasudevan
Deletion Inference, Reconstruction, and Compliance in Machine (Un)Learning. CoRR (2022)
Ron D. Rothblum, Prashant Nalini Vasudevan
Collision-Resistance from Multi-Collision-Resistance. CRYPTO (3) (2022)
Ron D. Rothblum, Prashant Nalini Vasudevan
Collision-Resistance from Multi-Collision-Resistance. Electron. Colloquium Comput. Complex. 29 (2022)
Aloni Cohen, Adam D. Smith, Marika Swanberg, Prashant Nalini Vasudevan
Control, Confidentiality, and the Right to be Forgotten. CoRR (2022)
Benny Applebaum, Prashant Nalini Vasudevan
Placing Conditional Disclosure of Secrets in the Communication Complexity Universe. J. Cryptol. 34 (2) (2021)
Benny Applebaum, Barak Arkis, Pavel Raykov, Prashant Nalini Vasudevan
Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-bounds, and Separations. SIAM J. Comput. 50 (1) (2021)
Inbar Kaslasi, Ron Rothblum, Prashant Nalini Vasudevan
Public-Coin Statistical Zero-Knowledge Batch Verification against Malicious Verifiers. Electron. Colloquium Comput. Complex. 28 (2021)
Inbar Kaslasi, Ron D. Rothblum, Prashant Nalini Vasudevan
Public-Coin Statistical Zero-Knowledge Batch Verification against Malicious Verifiers. IACR Cryptol. ePrint Arch. 2021 (2021)
Inbar Kaslasi, Ron D. Rothblum, Prashant Nalini Vasudevan
Public-Coin Statistical Zero-Knowledge Batch Verification Against Malicious Verifiers. EUROCRYPT (3) (2021)
Adam Bouland, Lijie Chen, Dhiraj Holden, Justin Thaler, Prashant Nalini Vasudevan
On the Power of Statistical Zero Knowledge. SIAM J. Comput. 49 (4) (2020)
Pasin Manurangsi, Akshayaram Srinivasan, Prashant Nalini Vasudevan
Nearly Optimal Robust Secret Sharing Against Rushing Adversaries. CRYPTO (3) (2020)
Marshall Ball, Elette Boyle, Akshay Degwekar, Apoorvaa Deshpande, Alon Rosen, Vinod Vaikuntanathan, Prashant Nalini Vasudevan
Cryptography from Information Loss. IACR Cryptol. ePrint Arch. 2020 (2020)
Inbar Kaslasi, Guy N. Rothblum, Ron D. Rothblum, Adam Sealfon, Prashant Nalini Vasudevan
Batch Verification for Statistical Zero Knowledge Proofs. IACR Cryptol. ePrint Arch. 2020 (2020)
Marshall Ball, Elette Boyle, Akshay Degwekar, Apoorvaa Deshpande, Alon Rosen, Vinod Vaikuntanathan, Prashant Nalini Vasudevan
Cryptography from Information Loss. ITCS (2020)
Nico Döttling, Sanjam Garg, Giulio Malavolta, Prashant Nalini Vasudevan
Tight Verifiable Delay Functions. SCN (2020)
Sanjam Garg, Shafi Goldwasser, Prashant Nalini Vasudevan
Formalizing Data Deletion in the Context of the Right to be Forgotten. IACR Cryptol. ePrint Arch. 2020 (2020)
Marshall Ball, Elette Boyle, Akshay Degwekar, Apoorvaa Deshpande, Alon Rosen, Vinod Vaikuntanathan, Prashant Nalini Vasudevan
Cryptography from Information Loss. Electron. Colloquium Comput. Complex. 27 (2020)
Sanjam Garg, Shafi Goldwasser, Prashant Nalini Vasudevan
Formalizing Data Deletion in the Context of the Right to be Forgotten. CoRR (2020)
Inbar Kaslasi, Guy N. Rothblum, Ron D. Rothblum, Adam Sealfon, Prashant Nalini Vasudevan
Batch Verification for Statistical Zero Knowledge Proofs. TCC (2) (2020)
Inbar Kaslasi, Prashant Nalini Vasudevan, Guy N. Rothblum, Ron Rothblum, Adam Sealfon
Batch Verification for Statistical Zero Knowledge Proofs. Electron. Colloquium Comput. Complex. 27 (2020)
Sanjam Garg, Shafi Goldwasser, Prashant Nalini Vasudevan
Formalizing Data Deletion in the Context of the Right to Be Forgotten. EUROCRYPT (2) (2020)
Nico Döttling, Sanjam Garg, Giulio Malavolta, Prashant Nalini Vasudevan
Tight Verifiable Delay Functions. IACR Cryptol. ePrint Arch. 2019 (2019)
Benny Applebaum, Prashant Nalini Vasudevan
Placing Conditional Disclosure of Secrets in the Communication Complexity Universe. ITCS (2019)
Andrej Bogdanov, Manuel Sabin, Prashant Nalini Vasudevan
XOR Codes and Sparse Learning Parity with Noise. SODA (2019)
Itay Berman, Akshay Degwekar, Ron D. Rothblum, Prashant Nalini Vasudevan
Statistical Difference Beyond the Polarizing Regime. TCC (2) (2019)
Pasin Manurangsi, Akshayaram Srinivasan, Prashant Nalini Vasudevan
Nearly Optimal Robust Secret Sharing against Rushing Adversaries. IACR Cryptol. ePrint Arch. 2019 (2019)
Itay Berman, Akshay Degwekar, Ron D. Rothblum, Prashant Nalini Vasudevan
Statistical Difference Beyond the Polarizing Regime. Electron. Colloquium Comput. Complex. 26 (2019)
Akshayaram Srinivasan, Prashant Nalini Vasudevan
Leakage Resilient Secret Sharing and Applications. CRYPTO (2) (2019)
Marshall Ball, Alon Rosen, Manuel Sabin, Prashant Nalini Vasudevan
Proofs of Work From Worst-Case Assumptions. CRYPTO (1) (2018)
Itay Berman, Akshay Degwekar, Ron D. Rothblum, Prashant Nalini Vasudevan
Multi-Collision Resistant Hash Functions and Their Applications. EUROCRYPT (2) (2018)
Akshayaram Srinivasan, Prashant Nalini Vasudevan
Leakage Resilient Secret Sharing and Applications. IACR Cryptol. ePrint Arch. 2018 (2018)
Andrej Bogdanov, Manuel Sabin, Prashant Nalini Vasudevan
XOR Codes and Sparse Random Linear Equations with Noise. Electron. Colloquium Comput. Complex. 25 (2018)
Benny Applebaum, Prashant Nalini Vasudevan
Placing Conditional Disclosure of Secrets in the Communication Complexity Universe. IACR Cryptol. ePrint Arch. 2018 (2018)
Benny Applebaum, Prashant Nalini Vasudevan
Placing Conditional Disclosure of Secrets in the Communication Complexity Universe. Electron. Colloquium Comput. Complex. 25 (2018)
Itay Berman, Akshay Degwekar, Ron D. Rothblum, Prashant Nalini Vasudevan
From Laconic Zero-Knowledge to Public-Key Cryptography. IACR Cryptol. ePrint Arch. 2018 (2018)
Marshall Ball, Alon Rosen, Manuel Sabin, Prashant Nalini Vasudevan
Proofs of Work from Worst-Case Assumptions. IACR Cryptol. ePrint Arch. 2018 (2018)
Itay Berman, Akshay Degwekar, Ron D. Rothblum, Prashant Nalini Vasudevan
From Laconic Zero-Knowledge to Public-Key Cryptography - Extended Abstract. CRYPTO (3) (2018)
Marshall Ball, Alon Rosen, Manuel Sabin, Prashant Nalini Vasudevan
Average-case fine-grained hardness. STOC (2017)
Itay Berman, Akshay Degwekar, Ron Rothblum, Prashant Nalini Vasudevan
Multi Collision Resistant Hash Functions and their Applications. Electron. Colloquium Comput. Complex. 24 (2017)
Adam Bouland, Lijie Chen, Dhiraj Holden, Justin Thaler, Prashant Nalini Vasudevan
On the Power of Statistical Zero Knowledge. FOCS (2017)
Marshall Ball, Alon Rosen, Manuel Sabin, Prashant Nalini Vasudevan
Average-Case Fine-Grained Hardness. Electron. Colloquium Comput. Complex. 24 (2017)
Benny Applebaum, Barak Arkis, Pavel Raykov, Prashant Nalini Vasudevan
Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-Bounds, and Separations. CRYPTO (1) (2017)
Benny Applebaum, Barak Arkis, Pavel Raykov, Prashant Nalini Vasudevan
Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-bounds, and Separations. IACR Cryptol. ePrint Arch. 2017 (2017)
Itay Berman, Akshay Degwekar, Ron D. Rothblum, Prashant Nalini Vasudevan
Multi Collision Resistant Hash Functions and their Applications. IACR Cryptol. ePrint Arch. 2017 (2017)
Itay Berman, Akshay Degwekar, Ron Rothblum, Prashant Nalini Vasudevan
From Laconic Zero-Knowledge to Public-Key Cryptography. Electron. Colloquium Comput. Complex. 24 (2017)
Benny Applebaum, Barak Arkis, Pavel Raykov, Prashant Nalini Vasudevan
Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-bounds, and Separations. Electron. Colloquium Comput. Complex. 24 (2017)
Marshall Ball, Alon Rosen, Manuel Sabin, Prashant Nalini Vasudevan
Average-Case Fine-Grained Hardness. IACR Cryptol. ePrint Arch. 2017 (2017)
Marshall Ball, Alon Rosen, Manuel Sabin, Prashant Nalini Vasudevan
Proofs of Useful Work. IACR Cryptol. ePrint Arch. 2017 (2017)
Ranjit Kumaresan, Vinod Vaikuntanathan, Prashant Nalini Vasudevan
Improvements to Secure Computation with Penalties. CCS (2016)
Akshay Degwekar, Vinod Vaikuntanathan, Prashant Nalini Vasudevan
Fine-grained Cryptography. IACR Cryptol. ePrint Arch. 2016 (2016)
Adam Bouland, Lijie Chen, Dhiraj Holden, Justin Thaler, Prashant Nalini Vasudevan
On SZK and PP. CoRR (2016)
Adam Bouland, Lijie Chen, Dhiraj Holden, Justin Thaler, Prashant Nalini Vasudevan
On SZK and PP. Electron. Colloquium Comput. Complex. 23 (2016)
Akshay Degwekar, Vinod Vaikuntanathan, Prashant Nalini Vasudevan
Fine-Grained Cryptography. CRYPTO (3) (2016)
Vinod Vaikuntanathan, Prashant Nalini Vasudevan
From Statistical Zero Knowledge to Secret Sharing. IACR Cryptol. ePrint Arch. 2015 (2015)
Vinod Vaikuntanathan, Prashant Nalini Vasudevan
Secret Sharing and Statistical Zero Knowledge. ASIACRYPT (1) (2015)

Prashant Nalini Vasudevan.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Prashant Nalini Vasudevan