Follow
Akshayaram Srinivasan
Akshayaram Srinivasan
Verified email at cs.toronto.edu - Homepage
Title
Cited by
Cited by
Year
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
4172020
Two-round Multiparty Secure Computation from Minimal Assumptions
S Garg, A Srinivasan
Journal of the ACM 69 (5), 1-30, 2022
144*2022
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
121*2016
Revisiting the cryptographic hardness of finding a nash equilibrium
S Garg, O Pandey, A Srinivasan
Annual International Cryptology Conference, 579-604, 2016
108*2016
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
672021
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
632017
Leakage resilient secret sharing and applications
A Srinivasan, PN Vasudevan
Annual International Cryptology Conference, 480-509, 2019
612019
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
612017
Revisiting non-malleable secret sharing
S Badrinarayanan, A Srinivasan
Advances in Cryptology–EUROCRYPT 2019: 38th Annual International Conference …, 2019
512019
Two-round MPC: information-theoretic and black-box
S Garg, Y Ishai, A Srinivasan
Theory of cryptography conference, 123-151, 2018
462018
Single-key to multi-key functional encryption with polynomial loss
S Garg, A Srinivasan
Theory of Cryptography: 14th International Conference, TCC 2016-B, Beijing …, 2016
39*2016
A simple construction of iO for turing machines
S Garg, A Srinivasan
Theory of Cryptography Conference, 425-454, 2018
242018
Adaptively secure garbling with near optimal online complexity
S Garg, A Srinivasan
Advances in Cryptology–EUROCRYPT 2018: 37th Annual International Conference …, 2018
242018
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
222022
Adaptive garbled RAM from laconic oblivious transfer
S Garg, R Ostrovsky, A Srinivasan
Annual International Cryptology Conference, 515-544, 2018
212018
Certificateless proxy re-encryption without pairing: revisited
A Srinivasan, CP Rangan
Proceedings of the 3rd International Workshop on Security in Cloud Computing …, 2015
212015
Round optimal black-box “commit-and-prove”
D Khurana, R Ostrovsky, A Srinivasan
Theory of Cryptography Conference, 286-313, 2018
182018
Multi-source non-malleable extractors and applications
V Goyal, A Srinivasan, C Zhu
Annual International Conference on the Theory and Applications of …, 2021
172021
Separating two-round secure computation from oblivious transfer
B Applebaum, Z Brakerski, S Garg, Y Ishai, A Srinivasan
Cryptology ePrint Archive, 2020
162020
On the round complexity of black-box secure MPC
Y Ishai, D Khurana, A Sahai, A Srinivasan
Advances in Cryptology–CRYPTO 2021: 41st Annual International Cryptology …, 2021
122021
The system can't perform the operation now. Try again later.
Articles 1–20