Akshayaram Srinivasan

According to our database, Akshayaram Srinivasan authored at least 53 papers between 2014 and 2025.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2025

Pseudorandom Correlation Generators for Multiparty Beaver Triples over 픽₂.

Peihan Miao, Alice Murphy, Akshayaram Srinivasan, Max Tromanhauser

IACR Cryptol. ePrint Arch., 2025

Black-Box Non-interactive Zero Knowledge from Vector Trapdoor Hash.

Pedro Branco, Arka Rai Choudhuri, Nico Döttling, Abhishek Jain, Giulio Malavolta, Akshayaram Srinivasan

Proceedings of the Advances in Cryptology - EUROCRYPT 2025, 2025

Simultaneous-Message and Succinct Secure Computation.

Elette Boyle, Abhishek Jain, Sacha Servan-Schreiber, Akshayaram Srinivasan

Proceedings of the Advances in Cryptology - EUROCRYPT 2025, 2025

Rate-1 Statistical Non-interactive Zero-Knowledge.

Pedro Branco, Nico Döttling, Akshayaram Srinivasan

Proceedings of the Advances in Cryptology - CRYPTO 2025, 2025

2024

Secure Computation with Parallel Calls to 2-Ary Functions.

Varun Narayanan, Shubham Vivek Pawar, Akshayaram Srinivasan

Proceedings of the Theory of Cryptography - 22nd International Conference, 2024

Rate-1 Fully Local Somewhere Extractable Hashing from DDH.

Pedro Branco, Nico Döttling, Akshayaram Srinivasan, Riccardo Zanotto

Proceedings of the Public-Key Cryptography - PKC 2024, 2024

Two-Round Maliciously-Secure Oblivious Transfer with Optimal Rate.

Pedro Branco, Nico Döttling, Akshayaram Srinivasan

Proceedings of the Advances in Cryptology - EUROCRYPT 2024, 2024

2023

Black-Box Reusable NISC with Random Oracles.

Yuval Ishai, Dakshita Khurana, Amit Sahai, Akshayaram Srinivasan

Proceedings of the Advances in Cryptology - EUROCRYPT 2023, 2023

Round-Optimal Black-Box MPC in the Plain Model.

Yuval Ishai, Dakshita Khurana, Amit Sahai, Akshayaram Srinivasan

Proceedings of the Advances in Cryptology - CRYPTO 2023, 2023

Reusable Secure Computation in the Plain Model.

Vipul Goyal, Akshayaram Srinivasan, Mingyuan Wang

Proceedings of the Advances in Cryptology - CRYPTO 2023, 2023

A Framework for Statistically Sender Private OT with Optimal Rate.

Pedro Branco, Nico Döttling, Akshayaram Srinivasan

Proceedings of the Advances in Cryptology - CRYPTO 2023, 2023

Secure Computation with Shared EPR Pairs (Or: How to Teleport in Zero-Knowledge).

James Bartusek, Dakshita Khurana, Akshayaram Srinivasan

Proceedings of the Advances in Cryptology - CRYPTO 2023, 2023

2022

Correction to: Unconditionally Secure Computation Against Low-Complexity Leakage.

Andrej Bogdanov, Yuval Ishai, Akshayaram Srinivasan

J. Cryptol., 2022

Non-Black-Box Approach to Secure Two-Party Computation in Three Rounds.

Akshayaram Srinivasan

IACR Cryptol. ePrint Arch., 2022

Fully-Secure MPC with Minimal Trust.

Yuval Ishai, Arpita Patra, Sikhar Patranabis, Divya Ravi, Akshayaram Srinivasan

Proceedings of the Theory of Cryptography - 20th International Conference, 2022

Round-Optimal Black-Box Secure Computation from Two-Round Malicious OT.

Yuval Ishai, Dakshita Khurana, Amit Sahai, Akshayaram Srinivasan

Proceedings of the Theory of Cryptography - 20th International Conference, 2022

Reusable Two-Round MPC from LPN.

James Bartusek, Sanjam Garg, Akshayaram Srinivasan, Yinuo Zhang

Proceedings of the Public-Key Cryptography - PKC 2022, 2022

Bounded Indistinguishability for Simple Sources.

Andrej Bogdanov, Krishnamoorthy Dinesh, Yuval Filmus, Yuval Ishai, Avi Kaplan, Akshayaram Srinivasan

Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

Round-Optimal Black-Box Protocol Compilers.

Yuval Ishai, Dakshita Khurana, Amit Sahai, Akshayaram Srinivasan

Proceedings of the Advances in Cryptology - EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Trondheim, Norway, May 30, 2022

SNARGs for P from Sub-exponential DDH and QR.

James Hulett, Ruta Jawale, Dakshita Khurana, Akshayaram Srinivasan

Proceedings of the Advances in Cryptology - EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Trondheim, Norway, May 30, 2022

2021

Muse: Secure Inference Resilient to Malicious Clients.

Ryan Lehmkuhl, Pratyush Mishra, Akshayaram Srinivasan, Raluca Ada Popa

Proceedings of the 30th USENIX Security Symposium, 2021

Multi-source Non-malleable Extractors and Applications.

Vipul Goyal, Akshayaram Srinivasan, Chenzhi Zhu

Proceedings of the Advances in Cryptology - EUROCRYPT 2021, 2021

Three-Round Secure Multiparty Computation from Black-Box Two-Round Oblivious Transfer.

Arpita Patra, Akshayaram Srinivasan

Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

Improved Computational Extractors and Their Applications.

Dakshita Khurana, Akshayaram Srinivasan

Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

On the Round Complexity of Black-Box Secure MPC.

Yuval Ishai, Dakshita Khurana, Amit Sahai, Akshayaram Srinivasan

Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

Traceable Secret Sharing and Applications.

Vipul Goyal, Yifan Song, Akshayaram Srinivasan

Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

2020

Round-Optimal Secure Multiparty Computation from Minimal Assumptions.

Akshayaram Srinivasan

PhD thesis, 2020

Delphi: A Cryptographic Inference Service for Neural Networks.

Pratyush Mishra, Ryan Lehmkuhl, Akshayaram Srinivasan, Wenting Zheng, Raluca Ada Popa

Proceedings of the 29th USENIX Security Symposium, 2020

Separating Two-Round Secure Computation From Oblivious Transfer.

Benny Applebaum, Zvika Brakerski, Sanjam Garg, Yuval Ishai, Akshayaram Srinivasan

Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

Nearly Optimal Robust Secret Sharing Against Rushing Adversaries.

Pasin Manurangsi, Akshayaram Srinivasan, Prashant Nalini Vasudevan

Proceedings of the Advances in Cryptology - CRYPTO 2020, 2020

Delphi: A Cryptographic Inference System for Neural Networks.

Pratyush Mishra, Ryan Lehmkuhl, Akshayaram Srinivasan, Wenting Zheng, Raluca Ada Popa

Proceedings of the PPMLP'20: Proceedings of the 2020 Workshop on Privacy-Preserving Machine Learning in Practice, 2020

2019

Revisiting Non-Malleable Secret Sharing.

Saikrishna Badrinarayanan, Akshayaram Srinivasan

Proceedings of the Advances in Cryptology - EUROCRYPT 2019, 2019

Leakage Resilient Secret Sharing and Applications.

Akshayaram Srinivasan, Prashant Nalini Vasudevan

Proceedings of the Advances in Cryptology - CRYPTO 2019, 2019

Unconditionally Secure Computation Against Low-Complexity Leakage.

Andrej Bogdanov, Yuval Ishai, Akshayaram Srinivasan

Proceedings of the Advances in Cryptology - CRYPTO 2019, 2019

2018

Round Optimal Black-Box "Commit-and-Prove".

Dakshita Khurana, Rafail Ostrovsky, Akshayaram Srinivasan

Proceedings of the Theory of Cryptography - 16th International Conference, 2018

A Simple Construction of iO for Turing Machines.

Sanjam Garg, Akshayaram Srinivasan

Proceedings of the Theory of Cryptography - 16th International Conference, 2018

Two-Round MPC: Information-Theoretic and Black-Box.

Sanjam Garg, Yuval Ishai, Akshayaram Srinivasan

Proceedings of the Theory of Cryptography - 16th International Conference, 2018

Adaptively Secure Garbling with Near Optimal Online Complexity.

Sanjam Garg, Akshayaram Srinivasan

Proceedings of the Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29, 2018

Two-Round Multiparty Secure Computation from Minimal Assumptions.

Sanjam Garg, Akshayaram Srinivasan

Proceedings of the Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29, 2018

Adaptive Garbled RAM from Laconic Oblivious Transfer.

Sanjam Garg, Rafail Ostrovsky, Akshayaram Srinivasan

Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

Two-Round Multiparty Secure Computation Minimizing Public Key Operations.

Sanjam Garg, Peihan Miao, Akshayaram Srinivasan

Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

2017

Garbled Protocols and Two-Round MPC from Bilinear Maps.

Sanjam Garg, Akshayaram Srinivasan

Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017

Breaking the Sub-Exponential Barrier in Obfustopia.

Sanjam Garg, Omkant Pandey, Akshayaram Srinivasan, Mark Zhandry

Proceedings of the Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30, 2017

Efficiently Obfuscating Re-Encryption Program Under DDH Assumption.

Akshayaram Srinivasan, Chandrasekaran Pandu Rangan

Proceedings of the Applied Cryptography and Network Security, 2017

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

Unifying Security Notions of Functional Encryption.

Sanjam Garg, Akshayaram Srinivasan

IACR Cryptol. ePrint Arch., 2016

Obfuscation without the Vulnerabilities of Multilinear Maps.

Sanjam Garg, Pratyay Mukherjee, Akshayaram Srinivasan

IACR Cryptol. ePrint Arch., 2016

Single-Key to Multi-Key Functional Encryption with Polynomial Loss.

Sanjam Garg, Akshayaram Srinivasan

Proceedings of the Theory of Cryptography - 14th International Conference, 2016

Secure Obfuscation in a Weak Multilinear Map Model.

Sanjam Garg, Eric Miles, Pratyay Mukherjee, Amit Sahai, Akshayaram Srinivasan, Mark Zhandry

Proceedings of the Theory of Cryptography - 14th International Conference, 2016

Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium.

Sanjam Garg, Omkant Pandey, Akshayaram Srinivasan

Proceedings of the Advances in Cryptology - CRYPTO 2016, 2016

2015

On the Exact Cryptographic Hardness of Finding a Nash Equilibrium.

Sanjam Garg, Omkant Pandey, Akshayaram Srinivasan

IACR Cryptol. ePrint Arch., 2015

Certificateless Proxy Re-Encryption Without Pairing: Revisited.

Akshayaram Srinivasan, C. Pandu Rangan

Proceedings of the 3rd International Workshop on Security in Cloud Computing, 2015

2014

Certificateless Proxy Re-Encryption Without Pairing.

Akshayaram Srinivasan, C. Pandu Rangan

IACR Cryptol. ePrint Arch., 2014