Pages that link to "Item:Q2128561"
From MaRDI portal
The following pages link to On the round complexity of black-box secure MPC (Q2128561):
Displaying 7 items.
- Round-optimal black-box protocol compilers (Q2170000) (← links)
- Black-box reusable NISC with random oracles (Q6061353) (← links)
- Round-optimal black-box secure computation from two-round malicious OT (Q6114280) (← links)
- Succinct arguments for RAM programs via projection codes (Q6145783) (← links)
- Two-round MPC without round collapsing revisited -- towards efficient malicious protocols (Q6155260) (← links)
- Round-optimal black-box MPC in the plain model (Q6186598) (← links)
- List oblivious transfer and applications to round-optimal black-box multiparty coin tossing (Q6186600) (← links)