Pages that link to "Item:Q3457074"
From MaRDI portal
The following pages link to Secure Computation with Minimal Interaction, Revisited (Q3457074):
Displaying 21 items.
- Fine-grained secure computation (Q1631318) (← links)
- Secure computation with low communication from cross-checking (Q1710664) (← links)
- Broadcast-optimal two-round MPC (Q2119034) (← links)
- Broadcast-optimal two round MPC with an honest majority (Q2128559) (← links)
- On the round complexity of black-box secure MPC (Q2128561) (← links)
- High throughput secure MPC over small population in hybrid networks (extended abstract) (Q2152069) (← links)
- Round-optimal and communication-efficient multiparty computation (Q2169992) (← links)
- Round-optimal black-box protocol compilers (Q2170000) (← links)
- Reusable non-interactive secure computation (Q2304929) (← links)
- On the exact round complexity of best-of-both-worlds multi-party computation (Q2691581) (← links)
- Efficient fully secure computation via distributed zero-knowledge proofs (Q2691587) (← links)
- On communication models and best-achievable security in two-round MPC (Q2697851) (← links)
- CNF-FSS and Its Applications (Q5087261) (← links)
- On the exact round complexity of secure three-party computation (Q5918099) (← links)
- Minimizing setup in broadcast-optimal two round MPC (Q6061355) (← links)
- Beyond honest majority: the round complexity of fair and robust multi-party computation (Q6109085) (← links)
- Round-optimal black-box secure computation from two-round malicious OT (Q6114280) (← links)
- Attaining GOD beyond honest majority with friends and foes (Q6135412) (← links)
- Two-round MPC without round collapsing revisited -- towards efficient malicious protocols (Q6155260) (← links)
- Broadcast-optimal two round MPC with asynchronous peer-to-peer channels (Q6619925) (← links)
- Threshold-optimal MPC with friends and foes (Q6623341) (← links)
