Follow
Prashant Nalini Vasudevan
Prashant Nalini Vasudevan
Verified email at berkeley.edu
Title
Cited by
Cited by
Year
Proofs of Useful Work.
M Ball, A Rosen, M Sabin, PN Vasudevan
IACR Cryptology ePrint Archive 2017, 203, 2017
1252017
Improvements to secure computation with penalties
R Kumaresan, V Vaikuntanathan, PN Vasudevan
Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications …, 2016
842016
Average-case fine-grained hardness
M Ball, A Rosen, M Sabin, PN Vasudevan
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017
612017
Proofs of work from worst-case assumptions
M Ball, A Rosen, M Sabin, PN Vasudevan
Annual International Cryptology Conference, 789-819, 2018
482018
Formalizing data deletion in the context of the right to be forgotten
S Garg, S Goldwasser, PN Vasudevan
Advances in Cryptology–EUROCRYPT 2020 12106, 373, 2020
472020
Leakage resilient secret sharing and applications
A Srinivasan, PN Vasudevan
Annual International Cryptology Conference, 480-509, 2019
472019
On the power of statistical zero knowledge
A Bouland, L Chen, D Holden, J Thaler, PN Vasudevan
SIAM Journal on Computing 49 (4), FOCS17-1-FOCS17-58, 2019
372019
Multi-collision resistant hash functions and their applications
I Berman, A Degwekar, RD Rothblum, PN Vasudevan
Annual International Conference on the Theory and Applications of …, 2018
372018
Conditional disclosure of secrets: Amplification, closure, amortization, lower-bounds, and separations
B Applebaum, B Arkis, P Raykov, PN Vasudevan
Annual International Cryptology Conference, 727-757, 2017
352017
Tight verifiable delay functions
N Döttling, S Garg, G Malavolta, PN Vasudevan
International Conference on Security and Cryptography for Networks, 65-84, 2020
272020
Fine-grained cryptography
A Degwekar, V Vaikuntanathan, PN Vasudevan
Annual International Cryptology Conference, 533-562, 2016
262016
Secret sharing and statistical zero knowledge
V Vaikuntanathan, PN Vasudevan
International Conference on the Theory and Application of Cryptology and …, 2015
162015
Placing conditional disclosure of secrets in the communication complexity universe
B Applebaum, PN Vasudevan
Journal of Cryptology 34 (2), 1-45, 2021
152021
Nearly Optimal Robust Secret Sharing Against Rushing Adversaries
P Manurangsi, A Srinivasan, PN Vasudevan
Annual International Cryptology Conference, 156-185, 2020
92020
From laconic zero-knowledge to public-key cryptography
I Berman, A Degwekar, RD Rothblum, PN Vasudevan
Annual International Cryptology Conference, 674-697, 2018
92018
Statistical Difference Beyond the Polarizing Regime
I Berman, A Degwekar, RD Rothblum, PN Vasudevan
Theory of Cryptography Conference, 311-332, 2019
82019
XOR codes and sparse learning parity with noise
A Bogdanov, M Sabin, PN Vasudevan
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
72019
Batch verification for statistical zero knowledge proofs
I Kaslasi, GN Rothblum, RD Rothblum, A Sealfon, PN Vasudevan
Theory of Cryptography Conference, 139-167, 2020
42020
Cryptography from Information Loss
M Ball, E Boyle, A Degwekar, A Deshpande, A Rosen, V Vaikuntanathan, ...
11th Innovations in Theoretical Computer Science Conference (ITCS 2020), 2020
42020
On szk and pp
A Bouland, L Chen, D Holden, J Thaler, PN Vasudevan
arXiv preprint arXiv:1609.02888, 2016
42016
The system can't perform the operation now. Try again later.
Articles 1–20