Akshayaram Srinivasan

Available identifiers

zbMath Open srinivasan.akshayaramMaRDI QIDQ775970

List of research outcomes

Publication	Date of Publication	Type
Two-round maliciously-secure oblivious transfer with optimal rate	2024-11-13	Paper
Rate-1 fully local somewhere extractable hashing from DDH	2024-11-12	Paper
https://portal.mardi4nfdi.de/entity/Q6126252	2024-04-09	Paper
Secure computation with shared EPR pairs (or: how to teleport in zero-knowledge)	2024-02-06	Paper
Round-optimal black-box MPC in the plain model	2024-02-02	Paper
Reusable secure computation in the plain model	2024-02-02	Paper
A framework for statistically sender private OT with optimal rate	2024-02-02	Paper
Black-box reusable NISC with random oracles	2023-12-08	Paper
Round-optimal black-box secure computation from two-round malicious OT	2023-08-14	Paper
Fully-secure MPC with minimal trust	2023-08-14	Paper
Two-round Multiparty Secure Computation from Minimal Assumptions	2023-04-27	Paper
https://portal.mardi4nfdi.de/entity/Q5875778	2023-02-03	Paper
Nearly optimal robust secret sharing against rushing adversaries	2022-12-07	Paper
Round-optimal black-box protocol compilers	2022-08-30	Paper
SNARGs for P from sub-exponential DDH and QR	2022-08-30	Paper
Reusable Two-Round MPC from LPN	2022-07-08	Paper
Efficiently Obfuscating Re-Encryption Program Under DDH Assumption	2022-07-01	Paper
On the round complexity of black-box secure MPC	2022-04-22	Paper
Three-round secure multiparty computation from black-box two-round oblivious transfer	2022-04-22	Paper
Improved computational extractors and their applications	2022-04-22	Paper
Traceable secret sharing and applications	2022-04-22	Paper
Correction to: ``Unconditionally secure computation against low-complexity leakage	2022-03-03	Paper
Multi-source non-malleable extractors and applications	2021-12-08	Paper
Correction to: ``Unconditionally secure computation against low-complexity leakage	2021-11-24	Paper
Unconditionally secure computation against low-complexity leakage	2021-09-10	Paper
Two-round multiparty secure computation minimizing public key operations	2020-06-30	Paper
Adaptive garbled RAM from laconic oblivious transfer	2020-06-30	Paper
Leakage resilient secret sharing and applications	2020-03-09	Paper
Unconditionally secure computation against low-complexity leakage	2020-03-09	Paper
Revisiting non-malleable secret sharing	2020-02-04	Paper
Two-round MPC: information-theoretic and black-box	2018-12-11	Paper
Round optimal black-box ``commit-and-prove	2018-12-11	Paper
A simple construction of iO for Turing machines	2018-12-06	Paper
Adaptively secure garbling with near optimal online complexity	2018-07-09	Paper
Two-round multiparty secure computation from minimal assumptions	2018-07-09	Paper
Breaking the Sub-Exponential Barrier in Obfustopia	2017-06-23	Paper
Secure Obfuscation in a Weak Multilinear Map Model	2016-12-22	Paper
Single-Key to Multi-Key Functional Encryption with Polynomial Loss	2016-12-22	Paper
Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium	2016-10-27	Paper

Research outcomes over time

This page was built for person: Akshayaram Srinivasan