Pages that link to "Item:Q1690214"
From MaRDI portal
The following pages link to Round optimal concurrent MPC via strong simulation (Q1690214):
Displaying 13 items.
- One-message zero knowledge and non-malleable commitments (Q1629409) (← links)
- Two-message statistically sender-private OT from LWE (Q1631337) (← links)
- What security can we achieve within 4 rounds? (Q2010586) (← links)
- Broadcast-optimal two-round MPC (Q2119034) (← links)
- On the round complexity of black-box secure MPC (Q2128561) (← links)
- Simpler statistically sender private oblivious transfer from ideals of cyclotomic integers (Q2692389) (← links)
- Two-round maliciously secure computation with super-polynomial simulation (Q2695653) (← links)
- Constant-Round MPC with Fairness and Guarantee of Output Delivery (Q3457060) (← links)
- Round-optimal secure multi-party computation (Q5918346) (← links)
- Round-optimal black-box secure computation from two-round malicious OT (Q6114280) (← links)
- Concurrently composable non-interactive secure computation (Q6135409) (← links)
- Statistically sender-private OT from LPN and derandomization (Q6163969) (← links)
- Two-round concurrent 2PC from sub-exponential LWE (Q6595674) (← links)
