Akshayaram Srinivasan

发表

Nearly Optimal Robust Secret Sharing against Rushing Adversaries

Pasin Manurangsi, Prashant Nalini Vasudevan, Akshayaram Srinivasan, 2020, IACR Cryptol. ePrint Arch..

Breaking the Sub-Exponential Barrier in Obfustopia

Mark Zhandry, Sanjam Garg, Akshayaram Srinivasan, 2017, EUROCRYPT.

Efficient Leakage-Resilient Secret Sharing

Prashant Nalini Vasudevan, Peihan Miao, Akshayaram Srinivasan, 2019 .

Delphi

R. A. Popa, Pratyush Mishra, Wenting Zheng, 1922, The Classical Review.

Round-Optimal Black-Box Protocol Compilers

A. Sahai, Y. Ishai, Akshayaram Srinivasan, 2022, EUROCRYPT.

Traceable Secret Sharing and Applications

Vipul Goyal, Akshayaram Srinivasan, Yifan Song, 2021, IACR Cryptol. ePrint Arch..

On the Round Complexity of Black-Box Secure MPC

Yuval Ishai, Amit Sahai, Dakshita Khurana, 2021, CRYPTO.

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

A. Sahai, Y. Ishai, Akshayaram Srinivasan, 2022, IACR Cryptol. ePrint Arch..

SNARGs for P from Sub-exponential DDH and QR

Akshayaram Srinivasan, Dakshita Khurana, James Hulett, 2022, IACR Cryptol. ePrint Arch..

Correction to: Unconditionally Secure Computation Against Low-Complexity Leakage

Y. Ishai, Andrej Bogdanov, Akshayaram Srinivasan, 2021, J. Cryptol..

Fully-Secure MPC with Minimal Trust

Y. Ishai, A. Patra, Akshayaram Srinivasan, 2022, IACR Cryptol. ePrint Arch..

Correction to: Unconditionally Secure Computation Against Low-Complexity Leakage

Y. Ishai, Andrej Bogdanov, Akshayaram Srinivasan, 2022, Journal of Cryptology.

Leakage Resilient Secret Sharing and Applications (cid:63)

Prashant Nalini Vasudevan, Akshayaram Srinivasan, 2019 .

Unconditionally Secure Computation Against Low-Complexity Leakage

Yuval Ishai, Andrej Bogdanov, Akshayaram Srinivasan, 2019, Journal of Cryptology.

Bounded Indistinguishability for Simple Sources

Yuval Ishai, Yuval Filmus, Andrej Bogdanov, 2021, Electron. Colloquium Comput. Complex..

Round-Optimal Secure Multiparty Computation from Minimal Assumptions

Akshayaram Srinivasan, Akshayaram Srinivasan, 2020 .

Separating Two-Round Secure Computation From Oblivious Transfer

Yuval Ishai, Zvika Brakerski, Sanjam Garg, 2020, ITCS.

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

Yuval Ishai, Sanjam Garg, Akshayaram Srinivasan, 2018, IACR Cryptol. ePrint Arch..

Garbled Protocols and Two-Round MPC from Bilinear Maps

Sanjam Garg, Akshayaram Srinivasan, Sanjam Garg, 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).

Efficiently Obfuscating Re-Encryption Program Under DDH Assumption

C. Pandu Rangan, Akshayaram Srinivasan, C. P. Rangan, 2017, ACNS.

D ELPHI : A Cryptographic Inference Service for Neural Networks

Raluca Ada Popa, Wenting Zheng, Akshayaram Srinivasan, 2019 .

MUSE: Secure Inference Resilient to Malicious Clients

Raluca Ada Popa, Akshayaram Srinivasan, Pratyush Mishra, 2021, IACR Cryptol. ePrint Arch..

Adaptively Secure Garbling with Near Optimal Online Complexity

Sanjam Garg, Akshayaram Srinivasan, Sanjam Garg, 2018, IACR Cryptol. ePrint Arch..

Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium

Sanjam Garg, Akshayaram Srinivasan, Omkant Pandey, 2016, CRYPTO.

Two-Round Multiparty Secure Computation Minimizing Public Key Operations

Sanjam Garg, Peihan Miao, Akshayaram Srinivasan, 2018, IACR Cryptol. ePrint Arch..

Obfuscation without the Vulnerabilities of Multilinear Maps

Sanjam Garg, Pratyay Mukherjee, Akshayaram Srinivasan, 2016, IACR Cryptol. ePrint Arch..

On the Exact Cryptographic Hardness of Finding a Nash Equilibrium

Sanjam Garg, Akshayaram Srinivasan, Omkant Pandey, 2015, IACR Cryptol. ePrint Arch..

Leakage Resilient Secret Sharing and Applications

Prashant Nalini Vasudevan, Akshayaram Srinivasan, Akshayaram Srinivasan, 2019, IACR Cryptol. ePrint Arch..

Two-round Multiparty Secure Computation from Minimal Assumptions

Sanjam Garg, Akshayaram Srinivasan, Sanjam Garg, 2018, IACR Cryptol. ePrint Arch..

Secure Obfuscation in a Weak Multilinear Map Model

Eric Miles, Mark Zhandry, Amit Sahai, 2016, TCC.

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

Akshayaram Srinivasan, Dakshita Khurana, James Bartusek, 2023, IACR Cryptol. ePrint Arch..

Certificateless Proxy Re-Encryption Without Pairing: Revisited

C. Pandu Rangan, Akshayaram Srinivasan, Akshayaram Srinivasan, 2015, SCC@ASIACCS.

Revisiting Non-Malleable Secret Sharing

Saikrishna Badrinarayanan, Akshayaram Srinivasan, S. Badrinarayanan, 2019, IACR Cryptol. ePrint Arch..

Improved Computational Extractors and Their Applications

Dakshita Khurana, Akshayaram Srinivasan, Akshayaram Srinivasan, 2021, CRYPTO.

Multi-Source Non-Malleable Extractors and Applications

Vipul Goyal, Akshayaram Srinivasan, Chenzhi Zhu, 2020, IACR Cryptol. ePrint Arch..

A Simple Construction of iO for Turing Machines

Sanjam Garg, Akshayaram Srinivasan, Sanjam Garg, 2018, IACR Cryptol. ePrint Arch..

Delphi: A Cryptographic Inference System for Neural Networks

R. A. Popa, Pratyush Mishra, Wenting Zheng, 2020, IACR Cryptol. ePrint Arch..

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

Arpita Patra, Akshayaram Srinivasan, A. Patra, 2021, IACR Cryptol. ePrint Arch..

Round Optimal Black-Box “Commit-and-Prove”

Rafail Ostrovsky, Dakshita Khurana, Akshayaram Srinivasan, 2018, IACR Cryptol. ePrint Arch..

Black-Box Reusable NISC with Random Oracles

A. Sahai, Y. Ishai, Akshayaram Srinivasan, 2023, EUROCRYPT.

Reusable Secure Computation in the Plain Model

Vipul Goyal, Akshayaram Srinivasan, Mingyuan Wang, 2023, IACR Cryptology ePrint Archive.

Reusable Two-Round MPC from LPN

Sanjam Garg, Akshayaram Srinivasan, James Bartusek, 2021, IACR Cryptol. ePrint Arch..

Adaptive Garbled RAM from Laconic Oblivious Transfer

Rafail Ostrovsky, Sanjam Garg, Akshayaram Srinivasan, 2018, IACR Cryptol. ePrint Arch..