According to our database
1,
Akshayaram Srinivasan
authored at least 48 papers
between 2014 and 2024.
Collaborative distances:
2024
Rate-1 Fully Local Somewhere Extractable Hashing from DDH.
IACR Cryptol. ePrint Arch., 2024
Two-Round Maliciously-Secure Oblivious Transfer with Optimal Rate.
IACR Cryptol. ePrint Arch., 2024
2023
Round-Optimal Black-Box MPC in the Plain Model.
IACR Cryptol. ePrint Arch., 2023
Black-Box Reusable NISC with Random Oracles.
IACR Cryptol. ePrint Arch., 2023
Reusable Secure Computation in the Plain Model.
IACR Cryptol. ePrint Arch., 2023
Secure Computation with Shared EPR Pairs (Or: How to Teleport in Zero-Knowledge).
IACR Cryptol. ePrint Arch., 2023
A Framework for Statistically Sender Private OT with Optimal Rate.
IACR Cryptol. ePrint Arch., 2023
2022
Correction to: Unconditionally Secure Computation Against Low-Complexity Leakage.
J. Cryptol., 2022
Two-round Multiparty Secure Computation from Minimal Assumptions.
J. ACM, 2022
Non-Black-Box Approach to Secure Two-Party Computation in Three Rounds.
IACR Cryptol. ePrint Arch., 2022
Fully-Secure MPC with Minimal Trust.
IACR Cryptol. ePrint Arch., 2022
Round-Optimal Black-Box Secure Computation from Two-Round Malicious OT.
IACR Cryptol. ePrint Arch., 2022
Round-Optimal Black-Box Protocol Compilers.
IACR Cryptol. ePrint Arch., 2022
SNARGs for P from Sub-exponential DDH and QR.
IACR Cryptol. ePrint Arch., 2022
2021
Unconditionally Secure Computation Against Low-Complexity Leakage.
J. Cryptol., 2021
Three-Round Secure Multiparty Computation from Black-Box Two-Round Oblivious Transfer.
IACR Cryptol. ePrint Arch., 2021
MUSE: Secure Inference Resilient to Malicious Clients.
IACR Cryptol. ePrint Arch., 2021
Improved Computational Extractors and their Applications.
IACR Cryptol. ePrint Arch., 2021
On the Round Complexity of Black-box Secure MPC.
IACR Cryptol. ePrint Arch., 2021
Traceable Secret Sharing and Applications.
IACR Cryptol. ePrint Arch., 2021
Reusable Two-Round MPC from LPN.
IACR Cryptol. ePrint Arch., 2021
Bounded Indistinguishability for Simple Sources.
Electron. Colloquium Comput. Complex., 2021
2020
Round-Optimal Secure Multiparty Computation from Minimal Assumptions.
PhD thesis, 2020
Delphi: A Cryptographic Inference Service for Neural Networks.
IACR Cryptol. ePrint Arch., 2020
Multi-Source Non-Malleable Extractors and Applications.
IACR Cryptol. ePrint Arch., 2020
Separating Two-Round Secure Computation from Oblivious Transfer.
IACR Cryptol. ePrint Arch., 2020
Delphi: A Cryptographic Inference System for Neural Networks.
Proceedings of the PPMLP'20: Proceedings of the 2020 Workshop on Privacy-Preserving Machine Learning in Practice, 2020
2019
Nearly Optimal Robust Secret Sharing against Rushing Adversaries.
IACR Cryptol. ePrint Arch., 2019
2018
Leakage Resilient Secret Sharing and Applications.
IACR Cryptol. ePrint Arch., 2018
Round Optimal Black-Box “Commit-and-Prove”.
IACR Cryptol. ePrint Arch., 2018
A Simple Construction of iO for Turing Machines.
IACR Cryptol. ePrint Arch., 2018
Adaptively Secure Garbling with Near Optimal Online Complexity.
IACR Cryptol. ePrint Arch., 2018
Adaptive Garbled RAM from Laconic Oblivious Transfer.
IACR Cryptol. ePrint Arch., 2018
Two-Round Multiparty Secure Computation Minimizing Public Key Operations.
IACR Cryptol. ePrint Arch., 2018
Two-Round MPC: Information-Theoretic and Black-Box.
IACR Cryptol. ePrint Arch., 2018
Revisiting Non-Malleable Secret Sharing.
IACR Cryptol. ePrint Arch., 2018
2017
Garbled Protocols and Two-Round MPC from Bilinear Maps.
IACR Cryptol. ePrint Arch., 2017
2016
Stronger public key encryption system withstanding RAM scraper like attacks.
Secur. Commun. Networks, 2016
Unifying Security Notions of Functional Encryption.
IACR Cryptol. ePrint Arch., 2016
Breaking the Sub-Exponential Barrier in Obfustopia.
IACR Cryptol. ePrint Arch., 2016
Obfuscation without the Vulnerabilities of Multilinear Maps.
IACR Cryptol. ePrint Arch., 2016
Secure Obfuscation in a Weak Multilinear Map Model.
IACR Cryptol. ePrint Arch., 2016
Single-Key to Multi-Key Functional Encryption with Polynomial Loss.
Proceedings of the Theory of Cryptography - 14th International Conference, 2016
Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium.
Proceedings of the Advances in Cryptology - CRYPTO 2016, 2016
2015
Efficiently Obfuscating Re-Encryption Program under DDH Assumption.
IACR Cryptol. ePrint Arch., 2015
On the Exact Cryptographic Hardness of Finding a Nash Equilibrium.
IACR Cryptol. ePrint Arch., 2015
Certificateless Proxy Re-Encryption Without Pairing: Revisited.
Proceedings of the 3rd International Workshop on Security in Cloud Computing, 2015
2014
Certificateless Proxy Re-Encryption Without Pairing.
IACR Cryptol. ePrint Arch., 2014
