Prashant Nalini Vasudevan

According to our database, Prashant Nalini Vasudevan authored at least 40 papers between 2015 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Improved Search-to-Decision Reduction for Random Local Functions.

Kel Zin Tan, Prashant Nalini Vasudevan

IACR Cryptol. ePrint Arch., 2025

Public-Key Encryption from the MinRank Problem.

Rohit Chatterjee, Changrui Mu, Prashant Nalini Vasudevan

IACR Cryptol. ePrint Arch., 2025

Decoding Balanced Linear Codes With Preprocessing.

Andrej Bogdanov, Rohit Chatterjee, Yunqi Li, Prashant Nalini Vasudevan

IACR Cryptol. ePrint Arch., 2025

Hardness Amplification for Real-Valued Functions.

Yunqi Li, Prashant Nalini Vasudevan

Proceedings of the 40th Computational Complexity Conference, 2025

2024

On Wagner's k-Tree Algorithm Over Integers.

Haoxing Lin, Prashant Nalini Vasudevan

IACR Cryptol. ePrint Arch., 2024

Instance-Hiding Interactive Proofs.

Changrui Mu, Prashant Nalini Vasudevan

Electron. Colloquium Comput. Complex., 2024

Instance-Hiding Interactive Proofs - (Extended Abstract).

Changrui Mu, Prashant Nalini Vasudevan

Proceedings of the Theory of Cryptography - 22nd International Conference, 2024

Doubly-Efficient Batch Verification in Statistical Zero-Knowledge.

Or Keret, Ron D. Rothblum, Prashant Nalini Vasudevan

Proceedings of the Theory of Cryptography - 22nd International Conference, 2024

Batch Proofs Are Statistically Hiding.

Nir Bitansky, Chethan Kamath, Omer Paneth, Ron D. Rothblum, Prashant Nalini Vasudevan

Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

Strong Batching for Non-interactive Statistical Zero-Knowledge.

Changrui Mu, Shafik Nassar, Ron D. Rothblum, Prashant Nalini Vasudevan

Proceedings of the Advances in Cryptology - EUROCRYPT 2024, 2024

k-SUM in the Sparse Regime: Complexity and Applications.

Shweta Agrawal, Sagnik Saha, Nikolaj I. Schwartzbach, Akhil Vanukuri, Prashant Nalini Vasudevan

Proceedings of the Advances in Cryptology - CRYPTO 2024, 2024

2023

k-SUM in the Sparse Regime.

Shweta Agrawal, Sagnik Saha, Nikolaj I. Schwartzbach, Akhil Vanukuri, Prashant Nalini Vasudevan

Electron. Colloquium Comput. Complex., 2023

Control, Confidentiality, and the Right to be Forgotten.

Aloni Cohen, Adam D. Smith, Marika Swanberg, Prashant Nalini Vasudevan

Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, 2023

2022

Deletion inference, reconstruction, and compliance in machine (un)learning.

Ji Gao, Sanjam Garg, Mohammad Mahmoody, Prashant Nalini Vasudevan

Proc. Priv. Enhancing Technol., 2022

Collision-Resistance from Multi-Collision-Resistance.

Ron D. Rothblum, Prashant Nalini Vasudevan

Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

2021

Public-Coin Statistical Zero-Knowledge Batch Verification Against Malicious Verifiers.

Inbar Kaslasi, Ron D. Rothblum, Prashant Nalini Vasudevan

Proceedings of the Advances in Cryptology - EUROCRYPT 2021, 2021

2020

Batch Verification for Statistical Zero Knowledge Proofs.

Inbar Kaslasi, Guy N. Rothblum, Ron D. Rothblum, Adam Sealfon, Prashant Nalini Vasudevan

Proceedings of the Theory of Cryptography - 18th International Conference, 2020

Tight Verifiable Delay Functions.

Nico Döttling, Sanjam Garg, Giulio Malavolta, Prashant Nalini Vasudevan

Proceedings of the Security and Cryptography for Networks - 12th International Conference, 2020

Cryptography from Information Loss.

Marshall Ball, Elette Boyle, Akshay Degwekar, Apoorvaa Deshpande, Alon Rosen, Vinod Vaikuntanathan, Prashant Nalini Vasudevan

Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

Formalizing Data Deletion in the Context of the Right to Be Forgotten.

Sanjam Garg, Shafi Goldwasser, Prashant Nalini Vasudevan

Proceedings of the Advances in Cryptology - EUROCRYPT 2020, 2020

Nearly Optimal Robust Secret Sharing Against Rushing Adversaries.

Pasin Manurangsi, Akshayaram Srinivasan, Prashant Nalini Vasudevan

Proceedings of the Advances in Cryptology - CRYPTO 2020, 2020

2019

Statistical Difference Beyond the Polarizing Regime.

Itay Berman, Akshay Degwekar, Ron D. Rothblum, Prashant Nalini Vasudevan

Proceedings of the Theory of Cryptography - 17th International Conference, 2019

XOR Codes and Sparse Learning Parity with Noise.

Andrej Bogdanov, Manuel Sabin, Prashant Nalini Vasudevan

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Placing Conditional Disclosure of Secrets in the Communication Complexity Universe.

Benny Applebaum, Prashant Nalini Vasudevan

Proceedings of the 10th Innovations in Theoretical Computer Science Conference, 2019

Leakage Resilient Secret Sharing and Applications.

Akshayaram Srinivasan, Prashant Nalini Vasudevan

Proceedings of the Advances in Cryptology - CRYPTO 2019, 2019

2018

Fine-grained cryptography.

Prashant Nalini Vasudevan

PhD thesis, 2018

XOR Codes and Sparse Random Linear Equations with Noise.

Andrej Bogdanov, Manuel Sabin, Prashant Nalini Vasudevan

Electron. Colloquium Comput. Complex., 2018

Multi-Collision Resistant Hash Functions and Their Applications.

Itay Berman, Akshay Degwekar, Ron D. Rothblum, Prashant Nalini Vasudevan

Proceedings of the Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29, 2018

From Laconic Zero-Knowledge to Public-Key Cryptography - Extended Abstract.

Itay Berman, Akshay Degwekar, Ron D. Rothblum, Prashant Nalini Vasudevan

Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

Proofs of Work From Worst-Case Assumptions.

Marshall Ball, Alon Rosen, Manuel Sabin, Prashant Nalini Vasudevan

Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

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.

Itay Berman, Akshay Degwekar, Ron Rothblum, Prashant Nalini Vasudevan

Electron. Colloquium Comput. Complex., 2017

Average-case fine-grained hardness.

Marshall Ball, Alon Rosen, Manuel Sabin, Prashant Nalini Vasudevan

Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

On the Power of Statistical Zero Knowledge.

Adam Bouland, Lijie Chen, Dhiraj Holden, Justin Thaler, Prashant Nalini Vasudevan

Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017

Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-Bounds, and Separations.

Benny Applebaum, Barak Arkis, Pavel Raykov, Prashant Nalini Vasudevan

Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017

2016

On SZK and PP.

Adam Bouland, Lijie Chen, Dhiraj Holden, Justin Thaler, Prashant Nalini Vasudevan

Electron. Colloquium Comput. Complex., 2016

Fine-Grained Cryptography.

Akshay Degwekar, Vinod Vaikuntanathan, Prashant Nalini Vasudevan

Proceedings of the Advances in Cryptology - CRYPTO 2016, 2016

Improvements to Secure Computation with Penalties.

Ranjit Kumaresan, Vinod Vaikuntanathan, Prashant Nalini Vasudevan

Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, 2016

2015

From Statistical Zero Knowledge to Secret Sharing.

Vinod Vaikuntanathan, Prashant Nalini Vasudevan

IACR Cryptol. ePrint Arch., 2015

Secret Sharing and Statistical Zero Knowledge.

Vinod Vaikuntanathan, Prashant Nalini Vasudevan

Proceedings of the Advances in Cryptology - ASIACRYPT 2015 - 21st International Conference on the Theory and Application of Cryptology and Information Security, Auckland, New Zealand, November 29, 2015