| Proofs of Useful Work. M Ball, A Rosen, M Sabin, PN Vasudevan IACR Cryptology ePrint Archive 2017, 203, 2017 | 165 | 2017 |
| Improvements to secure computation with penalties R Kumaresan, V Vaikuntanathan, PN Vasudevan Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications …, 2016 | 99 | 2016 |
| 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 | 80 | 2017 |
| 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 | 71 | 2020 |
| Proofs of work from worst-case assumptions M Ball, A Rosen, M Sabin, PN Vasudevan Advances in Cryptology–CRYPTO 2018: 38th Annual International Cryptology …, 2018 | 68 | 2018 |
| Leakage resilient secret sharing and applications A Srinivasan, PN Vasudevan Annual International Cryptology Conference, 480-509, 2019 | 64 | 2019 |
| 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 | 43 | 2019 |
| Multi-collision resistant hash functions and their applications I Berman, A Degwekar, RD Rothblum, PN Vasudevan Advances in Cryptology–EUROCRYPT 2018: 37th Annual International Conference …, 2018 | 41 | 2018 |
| Fine-grained cryptography A Degwekar, V Vaikuntanathan, PN Vasudevan Advances in Cryptology–CRYPTO 2016: 36th Annual International Cryptology …, 2016 | 38 | 2016 |
| Conditional disclosure of secrets: Amplification, closure, amortization, lower-bounds, and separations B Applebaum, B Arkis, P Raykov, PN Vasudevan Advances in Cryptology–CRYPTO 2017: 37th Annual International Cryptology …, 2017 | 37 | 2017 |
| Tight verifiable delay functions N Döttling, S Garg, G Malavolta, PN Vasudevan Security and Cryptography for Networks: 12th International Conference, SCN …, 2020 | 27 | 2020 |
| Placing conditional disclosure of secrets in the communication complexity universe B Applebaum, PN Vasudevan Journal of Cryptology 34 (2), 1-45, 2021 | 22 | 2021 |
| Secret sharing and statistical zero knowledge V Vaikuntanathan, PN Vasudevan International Conference on the Theory and Application of Cryptology and …, 2015 | 21 | 2015 |
| Deletion Inference, Reconstruction, and Compliance in Machine (Un) Learning J Gao, S Garg, M Mahmoody, PN Vasudevan arXiv preprint arXiv:2202.03460, 2022 | 12 | 2022 |
| Nearly optimal robust secret sharing against rushing adversaries P Manurangsi, A Srinivasan, PN Vasudevan Advances in Cryptology–CRYPTO 2020: 40th Annual International Cryptology …, 2020 | 12 | 2020 |
| Tight verifiable delay functions N Döttling, S Garg, G Malavolta, PN Vasudevan Cryptology ePrint Archive, 2019 | 11 | 2019 |
| Statistical difference beyond the polarizing regime I Berman, A Degwekar, RD Rothblum, PN Vasudevan Theory of Cryptography: 17th International Conference, TCC 2019, Nuremberg …, 2019 | 10 | 2019 |
| From laconic zero-knowledge to public-key cryptography I Berman, A Degwekar, RD Rothblum, PN Vasudevan Advances in Cryptology–CRYPTO 2018: 38th Annual International Cryptology …, 2018 | 10 | 2018 |
| 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 | 8 | 2019 |
| Collision-resistance from multi-collision-resistance RD Rothblum, PN Vasudevan Advances in Cryptology–CRYPTO 2022: 42nd Annual International Cryptology …, 2022 | 7 | 2022 |
Manuel SabinUC BerkeleyVerified email at berkeley.edu
