Akshayaram Srinivasan

Cited by

	All	Since 2019
Citations	1735	1501
h-index	18	18
i10-index	26	26

360

180

270

20162017201820192020202120222023202443 72 107 119 189 239 277 346 319

Public access

View all

39 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Sanjam GargUniversity of California, BerkeleyVerified email at berkeley.edu
Yuval IshaiTechnionVerified email at cs.technion.ac.il
Raluca Ada PopaProfessor of computer science, UC BerkeleyVerified email at berkeley.edu
Dakshita KhuranaUniversity of Illinois Urbana-ChampaignVerified email at illinois.edu
Pratyush MishraUniversity of PennsylvaniaVerified email at seas.upenn.edu
Ryan LehmkuhlPhD Candidate, MITVerified email at mit.edu
Amit SahaiSymantec Chair Professor of Computer Science; Professor of Mathematics (by courtesy), UCLAVerified email at cs.ucla.edu
Wenting ZhengCarnegie Mellon UniversityVerified email at cmu.edu
Omkant PandeyStony Brook UniversityVerified email at cs.stonybrook.edu
Mark ZhandryNTT ResearchVerified email at princeton.edu
Pratyay MukherjeeSupra ResearchVerified email at supraoracles.com
Vipul GoyalNTT ResearchVerified email at vipulgoyal.org
Rafail OstrovskyNorman E. Friedman Chair in Knowledge Sciences, Distinguished Prof. of CS & MATHVerified email at cs.ucla.edu
Eric MilesGoogleVerified email at google.com
Andrej BogdanovChinese University of Hong KongVerified email at cse.cuhk.edu.hk
Peihan MiaoBrown UniversityVerified email at brown.edu
C.Pandu RanganProfessor, Department of Computer Science and Engg, IIT-Madras, India.Verified email at cse.iitm.ac.in
Saikrishna BadrinarayananStaff Applied Researcher, LinkedInVerified email at linkedin.com
Benny applebaumElectrical Engineering School, Tel-Aviv UniversityVerified email at post.tau.ac.il
Zvika BrakerskiWeizmann Institute of ScienceVerified email at weizmann.ac.il

Akshayaram Srinivasan

University of Toronto

Verified email at cs.toronto.edu - Homepage

Theoretical Computer Science


Title Sort by citations Sort by year Sort by 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	538	2020
Two-round multiparty secure computation from minimal assumptions S Garg, A Srinivasan Journal of the ACM 69 (5), 1-30, 2022	166	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	123*	2016
Revisiting the cryptographic hardness of finding a nash equilibrium S Garg, O Pandey, A Srinivasan Annual International Cryptology Conference, 579-604, 2016	114	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	92	2021
Leakage resilient secret sharing and applications A Srinivasan, PN Vasudevan Annual International Cryptology Conference, 480-509, 2019	70	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	69	2017
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	69	2017
Revisiting non-malleable secret sharing S Badrinarayanan, A Srinivasan Advances in Cryptology–EUROCRYPT 2019: 38th Annual International Conference …, 2019	56	2019
Two-round MPC: information-theoretic and black-box S Garg, Y Ishai, A Srinivasan Theory of cryptography conference, 123-151, 2018	50	2018
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	42*	2016
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	36	2022
A simple construction of iO for turing machines S Garg, A Srinivasan Theory of Cryptography Conference, 425-454, 2018	28	2018
Adaptively secure garbling with near optimal online complexity S Garg, A Srinivasan Advances in Cryptology–EUROCRYPT 2018: 37th Annual International Conference …, 2018	26	2018
Round optimal black-box “commit-and-prove” D Khurana, R Ostrovsky, A Srinivasan Theory of Cryptography Conference, 286-313, 2018	24	2018
Adaptive garbled RAM from laconic oblivious transfer S Garg, R Ostrovsky, A Srinivasan Annual International Cryptology Conference, 515-544, 2018	24	2018
Certificateless proxy re-encryption without pairing: revisited A Srinivasan, CP Rangan Proceedings of the 3rd International Workshop on Security in Cloud Computing …, 2015	22	2015
Multi-source non-malleable extractors and applications V Goyal, A Srinivasan, C Zhu Annual International Conference on the Theory and Applications of …, 2021	21	2021
Separating two-round secure computation from oblivious transfer B Applebaum, Z Brakerski, S Garg, Y Ishai, A Srinivasan Cryptology ePrint Archive, 2020	18	2020
Unconditionally secure computation against low-complexity leakage A Bogdanov, Y Ishai, A Srinivasan Advances in Cryptology–CRYPTO 2019: 39th Annual International Cryptology …, 2019	17	2019

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors