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 4 items.
- Round optimal black-box ``commit-and-prove'' (Q1629413) (← links)
- Round-optimal black-box protocol compilers (Q2170000) (← links)
- Round-optimal black-box secure computation from two-round malicious OT (Q6114280) (← links)
- Two-round MPC without round collapsing revisited -- towards efficient malicious protocols (Q6155260) (← links)