Pages that link to "Item:Q1703935"
From MaRDI portal
The following pages link to Efficient scalable constant-round MPC via garbled circuits (Q1703935):
Displaying 10 items.
- On multiparty garbling of arithmetic circuits (Q1710662) (← links)
- Large scale, actively secure computation from LPN and free-XOR garbled circuits (Q2056780) (← links)
- Secure multiparty computation with free branching (Q2170008) (← links)
- Efficient constant-round multi-party computation combining BMR and SPDZ (Q2318094) (← links)
- Constant-Round MPC with Fairness and Guarantee of Output Delivery (Q3457060) (← links)
- TinyKeys: a new approach to efficient multi-party computation (Q5918657) (← links)
- Low cost constant round MPC combining BMR and oblivious transfer (Q5919016) (← links)
- Low cost constant round MPC combining BMR and oblivious transfer (Q5920168) (← links)
- Breaking and fixing garbled circuits when a gate has duplicate input wires (Q6176274) (← links)
- Private Decision Tree Evaluation with Constant Rounds via (Only) Fair SS-4PC (Q6488389) (← links)