Pages that link to "Item:Q2128564"
From MaRDI portal
The following pages link to Unconditional communication-efficient MPC via Hall's marriage theorem (Q2128564):
Displaying 4 items.
- Secure multiparty computation with free branching (Q2170008) (← links)
- On information-theoretic secure multiparty computation with local repairability (Q6635769) (← links)
- Stochastic secret sharing with 1-bit shares and applications to MPC (Q6652972) (← links)
- Scalable multiparty computation from non-linear secret sharing (Q6653034) (← links)
