| Delphi: A cryptographic inference system for neural networks P Mishra, R Lehmkuhl, A Srinivasan, W Zheng, RA Popa Proceedings of the 2020 Workshop on Privacy-Preserving Machine Learning in …, 2020 | 703 | 2020 |
| Two-round multiparty secure computation from minimal assumptions S Garg, A Srinivasan Journal of the ACM 69 (5), 1-30, 2022 | 184 | 2022 |
| Muse: Secure inference resilient to malicious clients R Lehmkuhl, P Mishra, A Srinivasan, RA Popa 30th USENIX Security Symposium (USENIX Security 21), 2201-2218, 2021 | 129 | 2021 |
| Revisiting the cryptographic hardness of finding a nash equilibrium S Garg, O Pandey, A Srinivasan Annual International Cryptology Conference, 579-604, 2016 | 123 | 2016 |
| Secure obfuscation in a weak multilinear map model S Garg, E Miles, P Mukherjee, A Sahai, A Srinivasan, M Zhandry Theory of Cryptography Conference, 241-268, 2016 | 106 | 2016 |
| Breaking the sub-exponential barrier in obfustopia S Garg, O Pandey, A Srinivasan, M Zhandry Annual International Conference on the Theory and Applications of …, 2017 | 78 | 2017 |
| Leakage resilient secret sharing and applications A Srinivasan, PN Vasudevan Annual International Cryptology Conference, 480-509, 2019 | 73 | 2019 |
| Garbled protocols and two-round MPC from bilinear maps S Garg, A Srinivasan 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017 | 71 | 2017 |
| Revisiting non-malleable secret sharing S Badrinarayanan, A Srinivasan Annual International Conference on the Theory and Applications of …, 2019 | 59 | 2019 |
| Two-round MPC: information-theoretic and black-box S Garg, Y Ishai, A Srinivasan Theory of cryptography conference, 123-151, 2018 | 55 | 2018 |
| SNARGs for P from sub-exponential DDH and QR J Hulett, R Jawale, D Khurana, A Srinivasan Annual International Conference on the Theory and Applications of …, 2022 | 52 | 2022 |
| Traceable secret sharing and applications V Goyal, Y Song, A Srinivasan Annual International Cryptology Conference, 718-747, 2021 | 42 | 2021 |
| Single-key to multi-key functional encryption with polynomial loss S Garg, A Srinivasan Theory of Cryptography Conference, 419-442, 2016 | 41 | 2016 |
| A simple construction of iO for turing machines S Garg, A Srinivasan Theory of Cryptography Conference, 425-454, 2018 | 33 | 2018 |
| Obfuscation without the vulnerabilities of multilinear maps S Garg, P Mukherjee, A Srinivasan Cryptology ePrint Archive, 2016 | 33 | 2016 |
| Adaptively secure garbling with near optimal online complexity S Garg, A Srinivasan Annual International Conference on the Theory and Applications of …, 2018 | 32 | 2018 |
| Adaptive garbled RAM from laconic oblivious transfer S Garg, R Ostrovsky, A Srinivasan Annual International Cryptology Conference, 515-544, 2018 | 28 | 2018 |
| Multi-source non-malleable extractors and applications V Goyal, A Srinivasan, C Zhu Annual International Conference on the Theory and Applications of …, 2021 | 25 | 2021 |
| Round optimal black-box “commit-and-prove” D Khurana, R Ostrovsky, A Srinivasan Theory of Cryptography Conference, 286-313, 2018 | 25 | 2018 |
| Separating two-round secure computation from oblivious transfer B Applebaum, Z Brakerski, S Garg, Y Ishai, A Srinivasan Cryptology ePrint Archive, 2020 | 22 | 2020 |
Sanjam GargUniversity of California, BerkeleyVerified email at berkeley.edu
