Follow
Akshayaram Srinivasan
Akshayaram Srinivasan
Verified email at tifr.res.in
Title
Cited by
Cited by
Year
Delphi: A cryptographic inference service for neural networks
P Mishra, R Lehmkuhl, A Srinivasan, W Zheng, RA Popa
29th USENIX Security Symposium (USENIX Security 20), 2505-2522, 2020
1682020
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
119*2016
Two-round multiparty secure computation from minimal assumptions
S Garg, A Srinivasan
Annual International Conference on the Theory and Applications of …, 2018
1072018
Revisiting the cryptographic hardness of finding a nash equilibrium
S Garg, O Pandey, A Srinivasan
Annual International Cryptology Conference, 579-604, 2016
92*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
512017
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
502017
Leakage resilient secret sharing and applications
A Srinivasan, PN Vasudevan
Annual International Cryptology Conference, 480-509, 2019
452019
Revisiting non-malleable secret sharing
S Badrinarayanan, A Srinivasan
Annual International Conference on the Theory and Applications of …, 2019
382019
Two-round MPC: information-theoretic and black-box
S Garg, Y Ishai, A Srinivasan
Theory of Cryptography Conference, 123-151, 2018
322018
Single-key to multi-key functional encryption with polynomial loss
S Garg, A Srinivasan
Theory of Cryptography Conference, 419-442, 2016
32*2016
Certificateless proxy re-encryption without pairing: revisited
A Srinivasan, CP Rangan
Proceedings of the 3rd International Workshop on Security in Cloud Computing …, 2015
192015
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
172021
Adaptively secure garbling with near optimal online complexity
S Garg, A Srinivasan
Annual International Conference on the Theory and Applications of …, 2018
152018
Adaptive garbled RAM from laconic oblivious transfer
S Garg, R Ostrovsky, A Srinivasan
Annual International Cryptology Conference, 515-544, 2018
142018
Two-round multiparty secure computation minimizing public key operations
S Garg, P Miao, A Srinivasan
Annual International Cryptology Conference, 273-301, 2018
122018
Round optimal black-box “commit-and-prove”
D Khurana, R Ostrovsky, A Srinivasan
Theory of Cryptography Conference, 286-313, 2018
112018
Unconditionally secure computation against low-complexity leakage
A Bogdanov, Y Ishai, A Srinivasan
Journal of Cryptology 34 (4), 1-28, 2021
102021
Nearly optimal robust secret sharing against rushing adversaries
P Manurangsi, A Srinivasan, PN Vasudevan
Annual International Cryptology Conference, 156-185, 2020
92020
Separating two-round secure computation from oblivious transfer
B Applebaum, Z Brakerski, S Garg, Y Ishai, A Srinivasan
Cryptology ePrint Archive, 2020
92020
Multi-source non-malleable extractors and applications
V Goyal, A Srinivasan, C Zhu
Annual International Conference on the Theory and Applications of …, 2021
82021
The system can't perform the operation now. Try again later.
Articles 1–20