Certificateless Proxy Re-Encryption Without Pairing. - Akshayaram Srinivasan; C. Pandu Rangan (IACR Cryptol. ePrint Arch., 2014)

Certificateless Proxy Re-Encryption Without Pairing: Revisited. - Akshayaram Srinivasan; C. Pandu Rangan (SCC@ASIACCS, 2015)

On the Exact Cryptographic Hardness of Finding a Nash Equilibrium. - Sanjam Garg; Omkant Pandey; Akshayaram Srinivasan (IACR Cryptol. ePrint Arch., 2015)

Efficiently Obfuscating Re-Encryption Program under DDH Assumption. - Akshayaram Srinivasan; C. Pandu Rangan (IACR Cryptol. ePrint Arch., 2015)

Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium. - Sanjam Garg; Omkant Pandey; Akshayaram Srinivasan (CRYPTO (2), 2016)

Single-Key to Multi-Key Functional Encryption with Polynomial Loss. - Sanjam Garg; Akshayaram Srinivasan (TCC (B2), 2016)

Secure Obfuscation in a Weak Multilinear Map Model. - Sanjam Garg; Eric Miles; Pratyay Mukherjee; Amit Sahai; Akshayaram Srinivasan; Mark Zhandry (IACR Cryptol. ePrint Arch., 2016)

Obfuscation without the Vulnerabilities of Multilinear Maps. - Sanjam Garg; Pratyay Mukherjee; Akshayaram Srinivasan (IACR Cryptol. ePrint Arch., 2016)

Breaking the Sub-Exponential Barrier in Obfustopia. - Sanjam Garg; Omkant Pandey; Akshayaram Srinivasan; Mark Zhandry (IACR Cryptol. ePrint Arch., 2016)

Unifying Security Notions of Functional Encryption. - Sanjam Garg; Akshayaram Srinivasan (IACR Cryptol. ePrint Arch., 2016)

Stronger public key encryption system withstanding RAM scraper like attacks. - Sree Vivek Sivanandam; S. Sharmila Deva Selvi; Akshayaram Srinivasan; Chandrasekaran Pandu Rangan (Secur. Commun. Networks, 2016)

Garbled Protocols and Two-Round MPC from Bilinear Maps. - Sanjam Garg; Akshayaram Srinivasan (IACR Cryptol. ePrint Arch., 2017)

Revisiting Non-Malleable Secret Sharing. - Saikrishna Badrinarayanan; Akshayaram Srinivasan (IACR Cryptol. ePrint Arch., 2018)

Two-Round MPC: Information-Theoretic and Black-Box. - Sanjam Garg; Yuval Ishai; Akshayaram Srinivasan (IACR Cryptol. ePrint Arch., 2018)

Two-Round Multiparty Secure Computation Minimizing Public Key Operations. - Sanjam Garg; Peihan Miao 001; Akshayaram Srinivasan (IACR Cryptol. ePrint Arch., 2018)

Adaptive Garbled RAM from Laconic Oblivious Transfer. - Sanjam Garg; Rafail Ostrovsky; Akshayaram Srinivasan (IACR Cryptol. ePrint Arch., 2018)

Adaptively Secure Garbling with Near Optimal Online Complexity. - Sanjam Garg; Akshayaram Srinivasan (IACR Cryptol. ePrint Arch., 2018)

A Simple Construction of iO for Turing Machines. - Sanjam Garg; Akshayaram Srinivasan (IACR Cryptol. ePrint Arch., 2018)

Round Optimal Black-Box “Commit-and-Prove”. - Dakshita Khurana; Rafail Ostrovsky; Akshayaram Srinivasan (IACR Cryptol. ePrint Arch., 2018)

Leakage Resilient Secret Sharing and Applications. - Akshayaram Srinivasan; Prashant Nalini Vasudevan (IACR Cryptol. ePrint Arch., 2018)

Nearly Optimal Robust Secret Sharing against Rushing Adversaries. - Pasin Manurangsi; Akshayaram Srinivasan; Prashant Nalini Vasudevan (IACR Cryptol. ePrint Arch., 2019)

Delphi: A Cryptographic Inference System for Neural Networks. - Pratyush Mishra; Ryan Lehmkuhl; Akshayaram Srinivasan; Wenting Zheng; Raluca Ada Popa (PPMLP@CCS, 2020)

Separating Two-Round Secure Computation from Oblivious Transfer. - Benny Applebaum; Zvika Brakerski; Sanjam Garg; Yuval Ishai; Akshayaram Srinivasan (IACR Cryptol. ePrint Arch., 2020)

Multi-Source Non-Malleable Extractors and Applications. - Vipul Goyal; Akshayaram Srinivasan; Chenzhi Zhu (IACR Cryptol. ePrint Arch., 2020)

Delphi: A Cryptographic Inference Service for Neural Networks. - Pratyush Mishra; Ryan Lehmkuhl; Akshayaram Srinivasan; Wenting Zheng; Raluca Ada Popa (IACR Cryptol. ePrint Arch., 2020)

Round-Optimal Secure Multiparty Computation from Minimal Assumptions. - Akshayaram Srinivasan (2020)

Bounded Indistinguishability for Simple Sources. - Andrej Bogdanov; Krishnamoorthy Dinesh 001; Yuval Filmus; Yuval Ishai; Avi Kaplan; Akshayaram Srinivasan (Electron. Colloquium Comput. Complex., 2021)

Reusable Two-Round MPC from LPN. - James Bartusek; Sanjam Garg; Akshayaram Srinivasan; Yinuo Zhang (IACR Cryptol. ePrint Arch., 2021)

Traceable Secret Sharing and Applications. - Vipul Goyal; Yifan Song 001; Akshayaram Srinivasan (IACR Cryptol. ePrint Arch., 2021)

On the Round Complexity of Black-box Secure MPC. - Yuval Ishai; Dakshita Khurana; Amit Sahai; Akshayaram Srinivasan (IACR Cryptol. ePrint Arch., 2021)

Improved Computational Extractors and their Applications. - Dakshita Khurana; Akshayaram Srinivasan (IACR Cryptol. ePrint Arch., 2021)

MUSE: Secure Inference Resilient to Malicious Clients. - Ryan Lehmkuhl; Pratyush Mishra; Akshayaram Srinivasan; Raluca Ada Popa (IACR Cryptol. ePrint Arch., 2021)

Three-Round Secure Multiparty Computation from Black-Box Two-Round Oblivious Transfer. - Arpita Patra; Akshayaram Srinivasan (IACR Cryptol. ePrint Arch., 2021)

Unconditionally Secure Computation Against Low-Complexity Leakage. - Andrej Bogdanov; Yuval Ishai; Akshayaram Srinivasan (J. Cryptol., 2021)

SNARGs for P from Sub-exponential DDH and QR. - James Hulett; Ruta Jawale; Dakshita Khurana; Akshayaram Srinivasan (IACR Cryptol. ePrint Arch., 2022)

Round-Optimal Black-Box Protocol Compilers. - Yuval Ishai; Dakshita Khurana; Amit Sahai; Akshayaram Srinivasan (IACR Cryptol. ePrint Arch., 2022)

Round-Optimal Black-Box Secure Computation from Two-Round Malicious OT. - Yuval Ishai; Dakshita Khurana; Amit Sahai; Akshayaram Srinivasan (IACR Cryptol. ePrint Arch., 2022)

Fully-Secure MPC with Minimal Trust. - Yuval Ishai; Arpita Patra; Sikhar Patranabis; Divya Ravi 001; Akshayaram Srinivasan (IACR Cryptol. ePrint Arch., 2022)

Non-Black-Box Approach to Secure Two-Party Computation in Three Rounds. - Akshayaram Srinivasan (IACR Cryptol. ePrint Arch., 2022)

Two-round Multiparty Secure Computation from Minimal Assumptions. - Sanjam Garg; Akshayaram Srinivasan (J. ACM, 2022)

Correction to: Unconditionally Secure Computation Against Low-Complexity Leakage. - Andrej Bogdanov; Yuval Ishai; Akshayaram Srinivasan (J. Cryptol., 2022)

A Framework for Statistically Sender Private OT with Optimal Rate. - Pedro Branco 005; Nico Döttling; Akshayaram Srinivasan (IACR Cryptol. ePrint Arch., 2023)

Secure Computation with Shared EPR Pairs (Or: How to Teleport in Zero-Knowledge). - James Bartusek; Dakshita Khurana; Akshayaram Srinivasan (IACR Cryptol. ePrint Arch., 2023)

Reusable Secure Computation in the Plain Model. - Vipul Goyal; Akshayaram Srinivasan; Mingyuan Wang 001 (IACR Cryptol. ePrint Arch., 2023)

Black-Box Reusable NISC with Random Oracles. - Yuval Ishai; Dakshita Khurana; Amit Sahai; Akshayaram Srinivasan (IACR Cryptol. ePrint Arch., 2023)

Round-Optimal Black-Box MPC in the Plain Model. - Yuval Ishai; Dakshita Khurana; Amit Sahai; Akshayaram Srinivasan (IACR Cryptol. ePrint Arch., 2023)

Black-Box Non-Interactive Zero Knowledge from Vector Trapdoor Hash. - Pedro Branco 005; Arka Rai Choudhuri; Nico Döttling; Abhishek Jain 002; Giulio Malavolta; Akshayaram Srinivasan (IACR Cryptol. ePrint Arch., 2024)

Two-Round Maliciously-Secure Oblivious Transfer with Optimal Rate. - Pedro Branco 005; Nico Döttling; Akshayaram Srinivasan (IACR Cryptol. ePrint Arch., 2024)

Rate-1 Statistical Non-Interactive Zero-Knowledge. - Pedro Branco 005; Nico Döttling; Akshayaram Srinivasan (IACR Cryptol. ePrint Arch., 2024)

Rate-1 Fully Local Somewhere Extractable Hashing from DDH. - Pedro Branco 005; Nico Döttling; Akshayaram Srinivasan; Riccardo Zanotto (IACR Cryptol. ePrint Arch., 2024)

Secure Computation with Parallel Calls to 2-ary Functions. - Varun Narayanan; Shubham Vivek Pawar; Akshayaram Srinivasan (IACR Cryptol. ePrint Arch., 2024)

Pseudorandom Correlation Generators for Multiparty Beaver Triples over 픽2. - Peihan Miao 001; Alice Murphy; Akshayaram Srinivasan; Max Tromanhauser (IACR Cryptol. ePrint Arch., 2025)

Simultaneous-Message and Succinct Secure Computation. - Elette Boyle; Abhishek Jain 002; Sacha Servan-Schreiber; Akshayaram Srinivasan (IACR Cryptol. ePrint Arch., 2025)