Pages that link to "Item:Q3179370"
From MaRDI portal
The following pages link to More Efficient Constant-Round Multi-party Computation from BMR and SHE (Q3179370):
Displayed 10 items.
- Large scale, actively secure computation from LPN and free-XOR garbled circuits (Q2056780) (← links)
- Efficient constant-round MPC with identifiable abort and public verifiability (Q2096540) (← links)
- Broadcast-optimal two-round MPC (Q2119034) (← links)
- Efficient constant-round multi-party computation combining BMR and SPDZ (Q2318094) (← links)
- Maliciously circuit-private multi-key FHE and MPC based on LWE (Q2701482) (← links)
- Scalable Multi-party Private Set-Intersection (Q5738787) (← links)
- TinyKeys: a new approach to efficient multi-party computation (Q5918657) (← links)
- Low cost constant round MPC combining BMR and oblivious transfer (Q5919016) (← links)
- Actively secure half-gates with minimum overhead under duplex networks (Q6061352) (← links)
- Mixed-technique multi-party computations composed of two-party computations (Q6109459) (← links)