Follow
Akshayaram Srinivasan
Akshayaram Srinivasan
Verified email at tifr.res.in
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
2362020
Two-round multiparty secure computation from minimal assumptions
S Garg, A Srinivasan
Advances in Cryptology–EUROCRYPT 2018: 37th Annual International Conference …, 2018
1222018
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
118*2016
Revisiting the cryptographic hardness of finding a nash equilibrium
S Garg, O Pandey, A Srinivasan
Advances in Cryptology–CRYPTO 2016: 36th Annual International Cryptology …, 2016
102*2016
Breaking the sub-exponential barrier in obfustopia
S Garg, O Pandey, A Srinivasan, M Zhandry
Advances in Cryptology–EUROCRYPT 2017: 36th Annual International Conference …, 2017
582017
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
552017
Leakage resilient secret sharing and applications
A Srinivasan, PN Vasudevan
Advances in Cryptology–CRYPTO 2019: 39th Annual International Cryptology …, 2019
492019
Revisiting non-malleable secret sharing
S Badrinarayanan, A Srinivasan
Advances in Cryptology–EUROCRYPT 2019: 38th Annual International Conference …, 2019
422019
Two-round MPC: information-theoretic and black-box
S Garg, Y Ishai, A Srinivasan
Theory of Cryptography: 16th International Conference, TCC 2018, Panaji …, 2018
382018
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
37*2016
Muse: Secure Inference Resilient to Malicious Clients.
R Lehmkuhl, P Mishra, A Srinivasan, RA Popa
USENIX Security Symposium, 2201-2218, 2021
332021
Certificateless proxy re-encryption without pairing: revisited
A Srinivasan, CP Rangan
Proceedings of the 3rd International Workshop on Security in Cloud Computing …, 2015
192015
Adaptively secure garbling with near optimal online complexity
S Garg, A Srinivasan
Advances in Cryptology–EUROCRYPT 2018: 37th Annual International Conference …, 2018
172018
Adaptive garbled RAM from laconic oblivious transfer
S Garg, R Ostrovsky, A Srinivasan
Advances in Cryptology–CRYPTO 2018: 38th Annual International Cryptology …, 2018
152018
A simple construction of iO for turing machines
S Garg, A Srinivasan
Theory of Cryptography: 16th International Conference, TCC 2018, Panaji …, 2018
142018
Separating two-round secure computation from oblivious transfer
B Applebaum, Z Brakerski, S Garg, Y Ishai, A Srinivasan
Cryptology ePrint Archive, 2020
132020
Round optimal black-box “commit-and-prove”
D Khurana, R Ostrovsky, A Srinivasan
Theory of Cryptography: 16th International Conference, TCC 2018, Panaji …, 2018
132018
Two-round multiparty secure computation minimizing public key operations
S Garg, P Miao, A Srinivasan
Advances in Cryptology–CRYPTO 2018: 38th Annual International Cryptology …, 2018
122018
Multi-source non-malleable extractors and applications
V Goyal, A Srinivasan, C Zhu
Advances in Cryptology–EUROCRYPT 2021: 40th Annual International Conference …, 2021
102021
Unconditionally secure computation against low-complexity leakage
A Bogdanov, Y Ishai, A Srinivasan
Advances in Cryptology–CRYPTO 2019: 39th Annual International Cryptology …, 2019
102019
The system can't perform the operation now. Try again later.
Articles 1–20