Pages that link to "Item:Q1690211"
From MaRDI portal
The following pages link to Four round secure computation without setup (Q1690211):
Displayed 27 items.
- Two-message statistically sender-private OT from LWE (Q1631337) (← links)
- What security can we achieve within 4 rounds? (Q2010586) (← links)
- Post-quantum multi-party computation (Q2056694) (← links)
- Multiparty reusable non-interactive secure computation from LWE (Q2056764) (← links)
- Towards accountability in CRS generation (Q2056795) (← links)
- On the round complexity of secure quantum computation (Q2120084) (← links)
- On the round complexity of black-box secure MPC (Q2128561) (← links)
- Counterexamples to new circular security assumptions underlying iO (Q2128580) (← links)
- Round-optimal multi-party computation with identifiable abort (Q2170005) (← links)
- A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement (Q2175906) (← links)
- From FE combiners to secure MPC and back (Q2175912) (← links)
- On the exact round complexity of best-of-both-worlds multi-party computation (Q2691581) (← links)
- Two-round maliciously secure computation with super-polynomial simulation (Q2695653) (← links)
- Blockchains enable non-interactive MPC (Q2697855) (← links)
- Maliciously circuit-private multi-key FHE and MPC based on LWE (Q2701482) (← links)
- Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles (Q5117380) (← links)
- Towards Round-Optimal Secure Multiparty Computations: Multikey FHE Without a CRS (Q5859732) (← links)
- On the exact round complexity of secure three-party computation (Q5918099) (← links)
- Round-optimal secure multi-party computation (Q5918346) (← links)
- Maliciously-secure MrNISC in the plain model (Q6061354) (← links)
- Multi-key Homomorphic Proxy Re-Encryption (Q6108846) (← links)
- Statistical security in two-party computation revisited (Q6114269) (← links)
- Round-optimal black-box secure computation from two-round malicious OT (Q6114280) (← links)
- On non-uniform security for black-box non-interactive CCA commitments (Q6138083) (← links)
- Round-optimal black-box MPC in the plain model (Q6186598) (← links)
- Reusable secure computation in the plain model (Q6186599) (← links)
- List oblivious transfer and applications to round-optimal black-box multiparty coin tossing (Q6186600) (← links)