Akshayaram Srinivasan

Publication Activity (10 Years)

Years Active: 2014-2024
Publications (10 Years): 83

Top Topics

Top Venues

IACR Cryptol. ePrint Arch.

Publications

Pedro Branco, Nico Döttling, Akshayaram Srinivasan
Two-Round Maliciously-Secure Oblivious Transfer with Optimal Rate. IACR Cryptol. ePrint Arch. 2024 (2024)
Pedro Branco, Nico Döttling, Akshayaram Srinivasan, Riccardo Zanotto
Rate-1 Fully Local Somewhere Extractable Hashing from DDH. IACR Cryptol. ePrint Arch. 2024 (2024)
Pedro Branco, Nico Döttling, Akshayaram Srinivasan
Two-Round Maliciously-Secure Oblivious Transfer with Optimal Rate. EUROCRYPT (6) (2024)
Pedro Branco, Nico Döttling, Akshayaram Srinivasan, Riccardo Zanotto
Rate-1 Fully Local Somewhere Extractable Hashing from DDH. Public Key Cryptography (3) (2024)
Vipul Goyal, Akshayaram Srinivasan, Mingyuan Wang
Reusable Secure Computation in the Plain Model. CRYPTO (1) (2023)
James Bartusek, Dakshita Khurana, Akshayaram Srinivasan
Secure Computation with Shared EPR Pairs (Or: How to Teleport in Zero-Knowledge). CoRR (2023)
James Bartusek, Dakshita Khurana, Akshayaram Srinivasan
Secure Computation with Shared EPR Pairs (Or: How to Teleport in Zero-Knowledge). IACR Cryptol. ePrint Arch. 2023 (2023)
Yuval Ishai, Dakshita Khurana, Amit Sahai, Akshayaram Srinivasan
Black-Box Reusable NISC with Random Oracles. IACR Cryptol. ePrint Arch. 2023 (2023)
Yuval Ishai, Dakshita Khurana, Amit Sahai, Akshayaram Srinivasan
Round-Optimal Black-Box MPC in the Plain Model. CRYPTO (1) (2023)
Yuval Ishai, Dakshita Khurana, Amit Sahai, Akshayaram Srinivasan
Black-Box Reusable NISC with Random Oracles. EUROCRYPT (2) (2023)
Yuval Ishai, Dakshita Khurana, Amit Sahai, Akshayaram Srinivasan
Round-Optimal Black-Box MPC in the Plain Model. IACR Cryptol. ePrint Arch. 2023 (2023)
Vipul Goyal, Akshayaram Srinivasan, Mingyuan Wang
Reusable Secure Computation in the Plain Model. IACR Cryptol. ePrint Arch. 2023 (2023)
Pedro Branco, Nico Döttling, Akshayaram Srinivasan
A Framework for Statistically Sender Private OT with Optimal Rate. CRYPTO (1) (2023)
Pedro Branco, Nico Döttling, Akshayaram Srinivasan
A Framework for Statistically Sender Private OT with Optimal Rate. IACR Cryptol. ePrint Arch. 2023 (2023)
Yuval Ishai, Dakshita Khurana, Amit Sahai, Akshayaram Srinivasan
Round-Optimal Black-Box Secure Computation from Two-Round Malicious OT. IACR Cryptol. ePrint Arch. 2022 (2022)
James Bartusek, Sanjam Garg, Akshayaram Srinivasan, Yinuo Zhang
Reusable Two-Round MPC from LPN. Public Key Cryptography (1) (2022)
Yuval Ishai, Dakshita Khurana, Amit Sahai, Akshayaram Srinivasan
Round-Optimal Black-Box Protocol Compilers. IACR Cryptol. ePrint Arch. 2022 (2022)
Andrej Bogdanov, Yuval Ishai, Akshayaram Srinivasan
Correction to: Unconditionally Secure Computation Against Low-Complexity Leakage. J. Cryptol. 35 (1) (2022)
Andrej Bogdanov, Krishnamoorthy Dinesh, Yuval Filmus, Yuval Ishai, Avi Kaplan, Akshayaram Srinivasan
Bounded Indistinguishability for Simple Sources. ITCS (2022)
Yuval Ishai, Arpita Patra, Sikhar Patranabis, Divya Ravi, Akshayaram Srinivasan
Fully-Secure MPC with Minimal Trust. IACR Cryptol. ePrint Arch. 2022 (2022)
Yuval Ishai, Arpita Patra, Sikhar Patranabis, Divya Ravi, Akshayaram Srinivasan
Fully-Secure MPC with Minimal Trust. TCC (2) (2022)
Yuval Ishai, Dakshita Khurana, Amit Sahai, Akshayaram Srinivasan
Round-Optimal Black-Box Protocol Compilers. EUROCRYPT (1) (2022)
Akshayaram Srinivasan
Non-Black-Box Approach to Secure Two-Party Computation in Three Rounds. IACR Cryptol. ePrint Arch. 2022 (2022)
James Hulett, Ruta Jawale, Dakshita Khurana, Akshayaram Srinivasan
SNARGs for P from Sub-exponential DDH and QR. IACR Cryptol. ePrint Arch. 2022 (2022)
Yuval Ishai, Dakshita Khurana, Amit Sahai, Akshayaram Srinivasan
Round-Optimal Black-Box Secure Computation from Two-Round Malicious OT. TCC (2) (2022)
Sanjam Garg, Akshayaram Srinivasan
Two-round Multiparty Secure Computation from Minimal Assumptions. J. ACM 69 (5) (2022)
Andrej Bogdanov, Yuval Ishai, Akshayaram Srinivasan
Correction to: Unconditionally Secure Computation Against Low-Complexity Leakage. J. Cryptol. 35 (2) (2022)
James Bartusek, Dakshita Khurana, Akshayaram Srinivasan
Secure Computation with Shared EPR Pairs (Or: How to Teleport in Zero-Knowledge). CRYPTO (5) (2022)
James Hulett, Ruta Jawale, Dakshita Khurana, Akshayaram Srinivasan
SNARGs for P from Sub-exponential DDH and QR. EUROCRYPT (2) (2022)
Yuval Ishai, Dakshita Khurana, Amit Sahai, Akshayaram Srinivasan
On the Round Complexity of Black-Box Secure MPC. CRYPTO (2) (2021)
Arpita Patra, Akshayaram Srinivasan
Three-Round Secure Multiparty Computation from Black-Box Two-Round Oblivious Transfer. CRYPTO (2) (2021)
Ryan Lehmkuhl, Pratyush Mishra, Akshayaram Srinivasan, Raluca Ada Popa
MUSE: Secure Inference Resilient to Malicious Clients. IACR Cryptol. ePrint Arch. 2021 (2021)
Vipul Goyal, Yifan Song, Akshayaram Srinivasan
Traceable Secret Sharing and Applications. CRYPTO (3) (2021)
Dakshita Khurana, Akshayaram Srinivasan
Improved Computational Extractors and their Applications. IACR Cryptol. ePrint Arch. 2021 (2021)
Vipul Goyal, Akshayaram Srinivasan, Chenzhi Zhu
Multi-source Non-malleable Extractors and Applications. EUROCRYPT (2) (2021)
Dakshita Khurana, Akshayaram Srinivasan
Improved Computational Extractors and Their Applications. CRYPTO (3) (2021)
Andrej Bogdanov, Yuval Ishai, Akshayaram Srinivasan
Unconditionally Secure Computation Against Low-Complexity Leakage. J. Cryptol. 34 (4) (2021)
James Bartusek, Sanjam Garg, Akshayaram Srinivasan, Yinuo Zhang
Reusable Two-Round MPC from LPN. IACR Cryptol. ePrint Arch. 2021 (2021)
Arpita Patra, Akshayaram Srinivasan
Three-Round Secure Multiparty Computation from Black-Box Two-Round Oblivious Transfer. IACR Cryptol. ePrint Arch. 2021 (2021)
Ryan Lehmkuhl, Pratyush Mishra, Akshayaram Srinivasan, Raluca Ada Popa
Muse: Secure Inference Resilient to Malicious Clients. USENIX Security Symposium (2021)
Andrej Bogdanov, Krishnamoorthy Dinesh, Yuval Filmus, Yuval Ishai, Avi Kaplan, Akshayaram Srinivasan
Bounded Indistinguishability for Simple Sources. Electron. Colloquium Comput. Complex. 28 (2021)
Yuval Ishai, Dakshita Khurana, Amit Sahai, Akshayaram Srinivasan
On the Round Complexity of Black-box Secure MPC. IACR Cryptol. ePrint Arch. 2021 (2021)
Vipul Goyal, Yifan Song, Akshayaram Srinivasan
Traceable Secret Sharing and Applications. IACR Cryptol. ePrint Arch. 2021 (2021)
Pasin Manurangsi, Akshayaram Srinivasan, Prashant Nalini Vasudevan
Nearly Optimal Robust Secret Sharing Against Rushing Adversaries. CRYPTO (3) (2020)
Pratyush Mishra, Ryan Lehmkuhl, Akshayaram Srinivasan, Wenting Zheng, Raluca Ada Popa
Delphi: A Cryptographic Inference Service for Neural Networks. IACR Cryptol. ePrint Arch. 2020 (2020)
Pratyush Mishra, Ryan Lehmkuhl, Akshayaram Srinivasan, Wenting Zheng, Raluca Ada Popa
Delphi: A Cryptographic Inference Service for Neural Networks. USENIX Security Symposium (2020)
Vipul Goyal, Akshayaram Srinivasan, Chenzhi Zhu
Multi-Source Non-Malleable Extractors and Applications. IACR Cryptol. ePrint Arch. 2020 (2020)
Benny Applebaum, Zvika Brakerski, Sanjam Garg, Yuval Ishai, Akshayaram Srinivasan
Separating Two-Round Secure Computation from Oblivious Transfer. IACR Cryptol. ePrint Arch. 2020 (2020)
Pratyush Mishra, Ryan Lehmkuhl, Akshayaram Srinivasan, Wenting Zheng, Raluca Ada Popa
Delphi: A Cryptographic Inference System for Neural Networks. PPMLP@CCS (2020)
Benny Applebaum, Zvika Brakerski, Sanjam Garg, Yuval Ishai, Akshayaram Srinivasan
Separating Two-Round Secure Computation From Oblivious Transfer. ITCS (2020)
Saikrishna Badrinarayanan, Akshayaram Srinivasan
Revisiting Non-Malleable Secret Sharing. EUROCRYPT (1) (2019)
Pasin Manurangsi, Akshayaram Srinivasan, Prashant Nalini Vasudevan
Nearly Optimal Robust Secret Sharing against Rushing Adversaries. IACR Cryptol. ePrint Arch. 2019 (2019)
Andrej Bogdanov, Yuval Ishai, Akshayaram Srinivasan
Unconditionally Secure Computation Against Low-Complexity Leakage. CRYPTO (2) (2019)
Andrej Bogdanov, Yuval Ishai, Akshayaram Srinivasan
Unconditionally Secure Computation Against Low-Complexity Leakage. IACR Cryptol. ePrint Arch. 2019 (2019)
Akshayaram Srinivasan, Prashant Nalini Vasudevan
Leakage Resilient Secret Sharing and Applications. CRYPTO (2) (2019)
Sanjam Garg, Yuval Ishai, Akshayaram Srinivasan
Two-Round MPC: Information-Theoretic and Black-Box. TCC (1) (2018)
Dakshita Khurana, Rafail Ostrovsky, Akshayaram Srinivasan
Round Optimal Black-Box “Commit-and-Prove”. IACR Cryptol. ePrint Arch. 2018 (2018)
Sanjam Garg, Rafail Ostrovsky, Akshayaram Srinivasan
Adaptive Garbled RAM from Laconic Oblivious Transfer. CRYPTO (3) (2018)
Sanjam Garg, Rafail Ostrovsky, Akshayaram Srinivasan
Adaptive Garbled RAM from Laconic Oblivious Transfer. IACR Cryptol. ePrint Arch. 2018 (2018)
Sanjam Garg, Peihan Miao, Akshayaram Srinivasan
Two-Round Multiparty Secure Computation Minimizing Public Key Operations. IACR Cryptol. ePrint Arch. 2018 (2018)
Akshayaram Srinivasan, Prashant Nalini Vasudevan
Leakage Resilient Secret Sharing and Applications. IACR Cryptol. ePrint Arch. 2018 (2018)
Sanjam Garg, Akshayaram Srinivasan
Adaptively Secure Garbling with Near Optimal Online Complexity. EUROCRYPT (2) (2018)
Sanjam Garg, Akshayaram Srinivasan
A Simple Construction of iO for Turing Machines. IACR Cryptol. ePrint Arch. 2018 (2018)
Saikrishna Badrinarayanan, Akshayaram Srinivasan
Revisiting Non-Malleable Secret Sharing. IACR Cryptol. ePrint Arch. 2018 (2018)
Sanjam Garg, Akshayaram Srinivasan
Adaptively Secure Garbling with Near Optimal Online Complexity. IACR Cryptol. ePrint Arch. 2018 (2018)
Sanjam Garg, Akshayaram Srinivasan
Two-Round Multiparty Secure Computation from Minimal Assumptions. EUROCRYPT (2) (2018)
Sanjam Garg, Akshayaram Srinivasan
A Simple Construction of iO for Turing Machines. TCC (2) (2018)
Sanjam Garg, Yuval Ishai, Akshayaram Srinivasan
Two-Round MPC: Information-Theoretic and Black-Box. IACR Cryptol. ePrint Arch. 2018 (2018)
Dakshita Khurana, Rafail Ostrovsky, Akshayaram Srinivasan
Round Optimal Black-Box "Commit-and-Prove". TCC (1) (2018)
Sanjam Garg, Peihan Miao, Akshayaram Srinivasan
Two-Round Multiparty Secure Computation Minimizing Public Key Operations. CRYPTO (3) (2018)
Akshayaram Srinivasan, Chandrasekaran Pandu Rangan
Efficiently Obfuscating Re-Encryption Program Under DDH Assumption. ACNS (2017)
Sanjam Garg, Omkant Pandey, Akshayaram Srinivasan, Mark Zhandry
Breaking the Sub-Exponential Barrier in Obfustopia. EUROCRYPT (3) (2017)
Sanjam Garg, Akshayaram Srinivasan
Garbled Protocols and Two-Round MPC from Bilinear Maps. IACR Cryptol. ePrint Arch. 2017 (2017)
Sanjam Garg, Akshayaram Srinivasan
Garbled Protocols and Two-Round MPC from Bilinear Maps. FOCS (2017)
Sanjam Garg, Akshayaram Srinivasan
Two-Round Multiparty Secure Computation from Minimal Assumptions. IACR Cryptol. ePrint Arch. 2017 (2017)
Sanjam Garg, Akshayaram Srinivasan
Single-Key to Multi-Key Functional Encryption with Polynomial Loss. TCC (B2) (2016)
Sanjam Garg, Eric Miles, Pratyay Mukherjee, Amit Sahai, Akshayaram Srinivasan, Mark Zhandry
Secure Obfuscation in a Weak Multilinear Map Model. IACR Cryptol. ePrint Arch. 2016 (2016)
Sanjam Garg, Pratyay Mukherjee, Akshayaram Srinivasan
Obfuscation without the Vulnerabilities of Multilinear Maps. IACR Cryptol. ePrint Arch. 2016 (2016)
Sanjam Garg, Omkant Pandey, Akshayaram Srinivasan, Mark Zhandry
Breaking the Sub-Exponential Barrier in Obfustopia. IACR Cryptol. ePrint Arch. 2016 (2016)
Sree Vivek Sivanandam, S. Sharmila Deva Selvi, Akshayaram Srinivasan, Chandrasekaran Pandu Rangan
Stronger public key encryption system withstanding RAM scraper like attacks. Secur. Commun. Networks 9 (12) (2016)
Sanjam Garg, Akshayaram Srinivasan
Unifying Security Notions of Functional Encryption. IACR Cryptol. ePrint Arch. 2016 (2016)
Sanjam Garg, Eric Miles, Pratyay Mukherjee, Amit Sahai, Akshayaram Srinivasan, Mark Zhandry
Secure Obfuscation in a Weak Multilinear Map Model. TCC (B2) (2016)
Sanjam Garg, Omkant Pandey, Akshayaram Srinivasan
Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium. CRYPTO (2) (2016)
Akshayaram Srinivasan, C. Pandu Rangan
Certificateless Proxy Re-Encryption Without Pairing: Revisited. SCC@ASIACCS (2015)
Sanjam Garg, Omkant Pandey, Akshayaram Srinivasan
On the Exact Cryptographic Hardness of Finding a Nash Equilibrium. IACR Cryptol. ePrint Arch. 2015 (2015)
Akshayaram Srinivasan, C. Pandu Rangan
Efficiently Obfuscating Re-Encryption Program under DDH Assumption. IACR Cryptol. ePrint Arch. 2015 (2015)
Akshayaram Srinivasan, C. Pandu Rangan
Certificateless Proxy Re-Encryption Without Pairing. IACR Cryptol. ePrint Arch. 2014 (2014)