Akshayaram Srinivasan
Akshayaram Srinivasan
Verified email at berkeley.edu - Homepage
Title
Cited by
Cited by
Year
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
97*2016
Revisiting the cryptographic hardness of finding a nash equilibrium
S Garg, O Pandey, A Srinivasan
Annual International Cryptology Conference, 579-604, 2016
59*2016
Two-round multiparty secure computation from minimal assumptions
S Garg, A Srinivasan
Annual International Conference on the Theory and Applications of …, 2018
502018
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
382017
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
272017
Single-key to multi-key functional encryption with polynomial loss
S Garg, A Srinivasan
Theory of Cryptography Conference, 419-442, 2016
25*2016
Leakage resilient secret sharing and applications
A Srinivasan, PN Vasudevan
Annual International Cryptology Conference, 480-509, 2019
152019
Revisiting non-malleable secret sharing
S Badrinarayanan, A Srinivasan
Annual International Conference on the Theory and Applications of …, 2019
142019
Two-round MPC: Information-theoretic and black-box
S Garg, Y Ishai, A Srinivasan
Theory of Cryptography Conference, 123-151, 2018
122018
Certificateless proxy re-encryption without pairing: revisited
A Srinivasan, CP Rangan
Proceedings of the 3rd International Workshop on Security in Cloud Computing …, 2015
12*2015
Adaptively secure garbling with near optimal online complexity
S Garg, A Srinivasan
Annual International Conference on the Theory and Applications of …, 2018
102018
Adaptive garbled RAM from laconic oblivious transfer
S Garg, R Ostrovsky, A Srinivasan
Annual International Cryptology Conference, 515-544, 2018
72018
Two-round multiparty secure computation minimizing public key operations
S Garg, P Miao, A Srinivasan
Annual International Cryptology Conference, 273-301, 2018
72018
Non-malleable commitments from non-malleable extractors
V Goyal, A Kumar, S Park, S Richelson, A Srinivasan
Manuscript, accessed via personal communication, 2018
72018
A simple construction of io for turing machines
S Garg, A Srinivasan
Theory of Cryptography Conference, 425-454, 2018
62018
DELPHI: A cryptographic inference service for neural networks
P Mishra, R Lehmkuhl, A Srinivasan, W Zheng, RA Popa
USENIX Security, 2020
32020
Efficiently obfuscating re-encryption program under DDH assumption
A Srinivasan, CP Rangan
International Conference on Applied Cryptography and Network Security, 273-292, 2017
32017
Unconditionally secure computation against low-complexity leakage
A Bogdanov, Y Ishai, A Srinivasan
Annual International Cryptology Conference, 387-416, 2019
22019
Round Optimal Black-Box “Commit-and-Prove”
D Khurana, R Ostrovsky, A Srinivasan
Theory of Cryptography Conference, 286-313, 2018
22018
Separating Two-Round Secure Computation From Oblivious Transfer
B Applebaum, Z Brakerski, S Garg, Y Ishai, A Srinivasan
11th Innovations in Theoretical Computer Science Conference (ITCS 2020), 2020
12020
The system can't perform the operation now. Try again later.
Articles 1–20