| 2026 | CRYPTO | Round-Optimal Black-Box MPC in the Plain Model from Minimal Assumptions. | Mohammad Hajiabadi, Ratnakar Medepalli, Akshayaram Srinivasan |
| 2026 | EuroCrypt | Simultaneous-Message and Succinct Secure Computation: Reusable and Multiparty Protocols. | Siddharth Agarwal, Abhishek Jain, Akshayaram Srinivasan, David J. Wu |
| 2026 | EuroCrypt | Non-interactive Secure Computation with Constant Communication Overhead. | Yuval Ishai, Ziyang Jin, Naty Peter, Akshayaram Srinivasan |
| 2025 | ASIACRYPT | Pseudorandom Correlation Generators for Multiparty Beaver Triples over $\mathbb {F}_2$. | Peihan Miao, Alice Murphy, Akshayaram Srinivasan, Max Tromanhauser |
| 2025 | CRYPTO | Rate-1 Statistical Non-interactive Zero-Knowledge. | Pedro Branco, Nico Dttling, Akshayaram Srinivasan |
| 2025 | EuroCrypt | Simultaneous-Message and Succinct Secure Computation. | Elette Boyle, Abhishek Jain, Sacha Servan-Schreiber, Akshayaram Srinivasan |
| 2025 | EuroCrypt | Black-Box Non-interactive Zero Knowledge from Vector Trapdoor Hash. | Pedro Branco, Arka Rai Choudhuri, Nico Dttling, Abhishek Jain, Giulio Malavolta, Akshayaram Srinivasan |
| 2025 | TCC | Obfuscating Pseudorandom Functions is Post-quantum Complete. | Pedro Branco, Abhishek Jain, Akshayaram Srinivasan |
| 2024 | EuroCrypt | Two-Round Maliciously-Secure Oblivious Transfer with Optimal Rate. | Pedro Branco, Nico Dttling, Akshayaram Srinivasan |
| 2024 | PKC | Rate-1 Fully Local Somewhere Extractable Hashing from DDH. | Pedro Branco, Nico Dttling, Akshayaram Srinivasan, Riccardo Zanotto |
| 2024 | TCC | Secure Computation with Parallel Calls to 2-Ary Functions. | Varun Narayanan, Shubham Vivek Pawar, Akshayaram Srinivasan |
| 2023 | CRYPTO | Secure Computation with Shared EPR Pairs (Or: How to Teleport in Zero-Knowledge). | James Bartusek, Dakshita Khurana, Akshayaram Srinivasan |
| 2023 | CRYPTO | A Framework for Statistically Sender Private OT with Optimal Rate. | Pedro Branco, Nico Dttling, Akshayaram Srinivasan |
| 2023 | CRYPTO | Reusable Secure Computation in the Plain Model. | Vipul Goyal, Akshayaram Srinivasan, Mingyuan Wang |
| 2023 | CRYPTO | Round-Optimal Black-Box MPC in the Plain Model. | Yuval Ishai, Dakshita Khurana, Amit Sahai, Akshayaram Srinivasan |
| 2023 | EuroCrypt | Black-Box Reusable NISC with Random Oracles. | Yuval Ishai, Dakshita Khurana, Amit Sahai, Akshayaram Srinivasan |
| 2022 | EuroCrypt | SNARGs for P from Sub-exponential DDH and QR. | James Hulett, Ruta Jawale, Dakshita Khurana, Akshayaram Srinivasan |
| 2022 | EuroCrypt | Round-Optimal Black-Box Protocol Compilers. | Yuval Ishai, Dakshita Khurana, Amit Sahai, Akshayaram Srinivasan |
| 2022 | PKC | Reusable Two-Round MPC from LPN. | James Bartusek, Sanjam Garg, Akshayaram Srinivasan, Yinuo Zhang |
| 2022 | TCC | Round-Optimal Black-Box Secure Computation from Two-Round Malicious OT. | Yuval Ishai, Dakshita Khurana, Amit Sahai, Akshayaram Srinivasan |
| 2022 | TCC | Fully-Secure MPC with Minimal Trust. | Yuval Ishai, Arpita Patra, Sikhar Patranabis, Divya Ravi, Akshayaram Srinivasan |
| 2021 | CRYPTO | Traceable Secret Sharing and Applications. | Vipul Goyal, Yifan Song, Akshayaram Srinivasan |
| 2021 | CRYPTO | On the Round Complexity of Black-Box Secure MPC. | Yuval Ishai, Dakshita Khurana, Amit Sahai, Akshayaram Srinivasan |
| 2021 | CRYPTO | Improved Computational Extractors and Their Applications. | Dakshita Khurana, Akshayaram Srinivasan |
| 2021 | CRYPTO | Three-Round Secure Multiparty Computation from Black-Box Two-Round Oblivious Transfer. | Arpita Patra, Akshayaram Srinivasan |
| 2021 | EuroCrypt | Multi-source Non-malleable Extractors and Applications. | Vipul Goyal, Akshayaram Srinivasan, Chenzhi Zhu |
| 2020 | CCS | Delphi: A Cryptographic Inference System for Neural Networks. | Pratyush Mishra, Ryan Lehmkuhl, Akshayaram Srinivasan, Wenting Zheng, Raluca Ada Popa |
| 2020 | CRYPTO | Nearly Optimal Robust Secret Sharing Against Rushing Adversaries. | Pasin Manurangsi, Akshayaram Srinivasan, Prashant Nalini Vasudevan |
| 2019 | CRYPTO | Unconditionally Secure Computation Against Low-Complexity Leakage. | Andrej Bogdanov, Yuval Ishai, Akshayaram Srinivasan |
| 2019 | CRYPTO | Leakage Resilient Secret Sharing and Applications. | Akshayaram Srinivasan, Prashant Nalini Vasudevan |
| 2019 | EuroCrypt | Revisiting Non-Malleable Secret Sharing. | Saikrishna Badrinarayanan, Akshayaram Srinivasan |
| 2018 | CRYPTO | Two-Round Multiparty Secure Computation Minimizing Public Key Operations. | Sanjam Garg, Peihan Miao, Akshayaram Srinivasan |
| 2018 | CRYPTO | Adaptive Garbled RAM from Laconic Oblivious Transfer. | Sanjam Garg, Rafail Ostrovsky, Akshayaram Srinivasan |
| 2018 | EuroCrypt | Two-Round Multiparty Secure Computation from Minimal Assumptions. | Sanjam Garg, Akshayaram Srinivasan |
| 2018 | EuroCrypt | Adaptively Secure Garbling with Near Optimal Online Complexity. | Sanjam Garg, Akshayaram Srinivasan |
| 2018 | TCC | Two-Round MPC: Information-Theoretic and Black-Box. | Sanjam Garg, Yuval Ishai, Akshayaram Srinivasan |
| 2018 | TCC | A Simple Construction of iO for Turing Machines. | Sanjam Garg, Akshayaram Srinivasan |
| 2018 | TCC | Round Optimal Black-Box "Commit-and-Prove". | Dakshita Khurana, Rafail Ostrovsky, Akshayaram Srinivasan |
| 2017 | ACNS | Efficiently Obfuscating Re-Encryption Program Under DDH Assumption. | Akshayaram Srinivasan, Chandrasekaran Pandu Rangan |
| 2017 | EuroCrypt | Breaking the Sub-Exponential Barrier in Obfustopia. | Sanjam Garg, Omkant Pandey, Akshayaram Srinivasan, Mark Zhandry |
| 2017 | FOCS | Garbled Protocols and Two-Round MPC from Bilinear Maps. | Sanjam Garg, Akshayaram Srinivasan |
| 2016 | CRYPTO | Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium. | Sanjam Garg, Omkant Pandey, Akshayaram Srinivasan |
| 2016 | TCC | Secure Obfuscation in a Weak Multilinear Map Model. | Sanjam Garg, Eric Miles, Pratyay Mukherjee, Amit Sahai, Akshayaram Srinivasan, Mark Zhandry |
| 2016 | TCC | Single-Key to Multi-Key Functional Encryption with Polynomial Loss. | Sanjam Garg, Akshayaram Srinivasan |
| 2015 | CCS | Certificateless Proxy Re-Encryption Without Pairing: Revisited. | Akshayaram Srinivasan, C. Pandu Rangan |