The following pages link to Akshayaram Srinivasan (Q775970):
Displaying 31 items.
- Two-round multiparty secure computation minimizing public key operations (Q775971) (← links)
- Adaptive garbled RAM from laconic oblivious transfer (Q775994) (← links)
- Two-round MPC: information-theoretic and black-box (Q1629402) (← links)
- Round optimal black-box ``commit-and-prove'' (Q1629413) (← links)
- A simple construction of iO for Turing machines (Q1631340) (← links)
- Two-round multiparty secure computation from minimal assumptions (Q1648848) (← links)
- Adaptively secure garbling with near optimal online complexity (Q1648850) (← links)
- Multi-source non-malleable extractors and applications (Q2056748) (← links)
- Nearly optimal robust secret sharing against rushing adversaries (Q2102061) (← links)
- Three-round secure multiparty computation from black-box two-round oblivious transfer (Q2128560) (← links)
- On the round complexity of black-box secure MPC (Q2128561) (← links)
- Improved computational extractors and their applications (Q2129010) (← links)
- Traceable secret sharing and applications (Q2129017) (← links)
- Round-optimal black-box protocol compilers (Q2170000) (← links)
- SNARGs for P from sub-exponential DDH and QR (Q2170061) (← links)
- Revisiting non-malleable secret sharing (Q2292661) (← links)
- Leakage resilient secret sharing and applications (Q2304991) (← links)
- Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium (Q2829231) (← links)
- Secure Obfuscation in a Weak Multilinear Map Model (Q3181029) (← links)
- Single-Key to Multi-Key Functional Encryption with Polynomial Loss (Q3181035) (← links)
- Reusable Two-Round MPC from LPN (Q5087256) (← links)
- Breaking the Sub-Exponential Barrier in Obfustopia (Q5270361) (← links)
- (Q5875778) (← links)
- Two-round Multiparty Secure Computation from Minimal Assumptions (Q5889781) (← links)
- Unconditionally secure computation against low-complexity leakage (Q5918097) (← links)
- Correction to: ``Unconditionally secure computation against low-complexity leakage'' (Q5918380) (← links)
- Unconditionally secure computation against low-complexity leakage (Q5919497) (← links)
- Correction to: ``Unconditionally secure computation against low-complexity leakage'' (Q5925544) (← links)
- (Q6126252) (← links)
- Rate-1 fully local somewhere extractable hashing from DDH (Q6635830) (← links)
- Two-round maliciously-secure oblivious transfer with optimal rate (Q6637571) (← links)
