Pages that link to "Item:Q2999858"
From MaRDI portal
The following pages link to On Achieving the “Best of Both Worlds” in Secure Multiparty Computation (Q2999858):
Displaying 10 items.
- MPC with friends and foes (Q2096545) (← links)
- On fully secure MPC with solitary output (Q2175916) (← links)
- \(1/p\)-secure multiparty computation without an honest majority and the best of both worlds (Q2210437) (← links)
- On the exact round complexity of best-of-both-worlds multi-party computation (Q2691581) (← links)
- From fairness to full security in multiparty computation (Q5916285) (← links)
- Beyond honest majority: the round complexity of fair and robust multi-party computation (Q6109085) (← links)
- DORAM revisited: maliciously secure RAM-MPC with logarithmic overhead (Q6581801) (← links)
- Three party secure computation with friends and foes (Q6582170) (← links)
- Best-of-both-worlds multiparty quantum computation with publicly verifiable identifiable abort (Q6637565) (← links)
- Secure multiparty computation with identifiable abort via vindicating release (Q6653023) (← links)
