Akshayaram Srinivasan
Assistant Professor
University of Toronto
Email: akshayaram [at] cs.toronto.edu
Office: SF 3322
I am a faculty member in the Department of Computer Science at the University of Toronto and the Department of Mathematical and Computational Sciences at the University of Toronto, Mississauga. I am a member of the Theory Group.
Before joining U of T, I was at the Tata Insitute of Fundamental Research, Mumbai. Previously, I obtained my Ph.D. in Computer Science from University of California, Berkeley, where I was fortunate to be advised by Prof. Sanjam Garg. Before that, I completed my undergraduate studies in Computer Science and Engineering at the Indian Institute of Technology, Madras.
My research interests lie broadly in the theoretical foundations of Cryptography with a special focus on Secure Computation.
I am looking for motivated students to work with me on exciting topics in Cryptography! Please apply to our graduate program in Computer Science. If you are already admitted, please feel free to contact me through email or drop by my office!
Communications in Cryptology.
- Round-Optimal Black-Box Secure Computation from Two-Round Malicious OT
Yuval Ishai, Dakshita Khurana, Amit Sahai, and Akshayaram Srinivasan
TCC 2022 [pdf]
- Fully-Secure MPC with Minimal Trust
Yuval Ishai, Arpita Patra, Sikhar Patranabis, Divya Ravi, and Akshayaram Srinivasan
TCC 2022 [pdf]
- SNARGs for P from Sub-exponential DDH and QR
James Hulett, Ruta Jawale, Dakshita Khurana, and Akshayaram Srinivasan
EUROCRYPT 2022 [pdf]
- Round-Optimal Black-Box Protocol Compilers
Yuval Ishai, Dakshita Khurana, Amit Sahai, and Akshayaram Srinivasan
EUROCRYPT 2022 [pdf] [video]
- Reusable Two-Round MPC from LPN
James Bartusek, Sanjam Garg, Akshayaram Srinivasan, and Yinuo Zhang
PKC 2022 [pdf]
- Bounded Indistinguishability for Simple Sources
Andrej Bogdanov, Krishnamoorthy Dinesh, Yuval Filmus, Yuval Ishai, Avi Kaplan, and Akshayaram Srinivasan
ITCS 2022 [pdf]
- On the Round Complexity of Black-Box Secure MPC
Yuval Ishai, Dakshita Khurana, Amit Sahai, and Akshayaram Srinivasan
CRYPTO 2021 [pdf] [video]
- Three-Round Secure Multiparty Computation from Black-Box Two-Round Oblivious Transfer
Arpita Patra and Akshayaram Srinivasan
CRYPTO 2021 [pdf]
- Improved Computational Extractors and Their Applications
Dakshita Khurana and Akshayaram Srinivasan
CRYPTO 2021 [pdf]
- Traceable Secret Sharing and Applications
Vipul Goyal, Yifan Song, and Akshayaram Srinivasan
CRYPTO 2021 [pdf] [video]
- Muse: Secure Inference Resilient to Malicious Clients
Ryan Lehmkuhl, Pratyush Mishra, Akshayaram Srinivasan, and Raluca Ada Popa
USENIX Security Symposium 2021 [pdf]
- Multi-Source Non-Malleable Extractors and Applications
Vipul Goyal, Akshayaram Srinivasan, and Chenzhi Zhu.
EUROCRYPT 2021 [pdf]
- Two-Round MPC: Information-Theoretic and Black-Box
Sanjam Garg, Yuval Ishai, and Akshayaram Srinivasan
TCC 2018 [pdf]
- A Simple Construction of iO for Turing Machines
Sanjam Garg and Akshayaram Srinivasan
TCC 2018 [pdf]
- Round Optimal Black-Box "Commit-and-Prove"
Dakshita Khurana, Rafail Ostrovsky, and Akshayaram Srinivasan
TCC 2018 [pdf]
- Two-Round Multiparty Secure Computation Minimizing Public Key Operations
Sanjam Garg, Peihan Miao, and Akshayaram Srinivasan
CRYPTO 2018 [pdf]
- Adaptive Garbled RAM from Laconic Oblivious Transfer
Sanjam Garg, Rafail Ostrovsky, and Akshayaram Srinivasan
CRYPTO 2018 [pdf] [video]
- Two-Round Multiparty Secure Computation from Minimal Assumptions
Sanjam Garg and Akshayaram Srinivasan
EUROCRYPT 2018 and Journal of ACM [pdf] [video]
Best paper award
- Adaptively Secure Garbling with Near Optimal Online Complexity
Sanjam Garg and Akshayaram Srinivasan
EUROCRYPT 2018 [pdf] [video]