Pages that link to "Item:Q2304929"
From MaRDI portal
The following pages link to Reusable non-interactive secure computation (Q2304929):
Displaying 19 items.
- Non-interactive secure computation from one-way functions (Q1710666) (← links)
- Compact designated verifier NIZKs from the CDH assumption without pairings (Q2051369) (← links)
- New constructions of statistical NIZKs: dual-mode DV-NIZKs and more (Q2055662) (← links)
- Multiparty reusable non-interactive secure computation from LWE (Q2056764) (← links)
- Unbounded multi-party computation from learning with errors (Q2056765) (← links)
- On the round complexity of secure quantum computation (Q2120084) (← links)
- On the round complexity of black-box secure MPC (Q2128561) (← links)
- Round-optimal black-box protocol compilers (Q2170000) (← links)
- Asymptotically quasi-optimal cryptography (Q2170004) (← links)
- Batch-OT with optimal rate (Q2170043) (← links)
- Secure quantum computation with classical communication (Q2695622) (← links)
- Blockchains enable non-interactive MPC (Q2697855) (← links)
- Two-Round Oblivious Linear Evaluation from Learning with Errors (Q5087264) (← links)
- Line-point zero knowledge and its applications (Q6107254) (← links)
- Round-optimal black-box secure computation from two-round malicious OT (Q6114280) (← links)
- mrNISC from LWE with polynomial modulus (Q6134835) (← links)
- Concurrently composable non-interactive secure computation (Q6135409) (← links)
- Two-round MPC without round collapsing revisited -- towards efficient malicious protocols (Q6155260) (← links)
- Amortized NISC over \(\mathbb{Z}_{2^k}\) from RMFE (Q6595673) (← links)
