Pages that link to "Item:Q1710665"
From MaRDI portal
The following pages link to Concretely efficient large-scale MPC with active security (or tinykeys for tinyot) (Q1710665):
Displaying 11 items.
- Yet another compiler for active security or: efficient MPC over arbitrary rings (Q1784116) (← links)
- High-performance multi-party computation for binary circuits based on oblivious transfer (Q2044760) (← links)
- The more the merrier: reducing the cost of large scale MPC (Q2056763) (← links)
- Large scale, actively secure computation from LPN and free-XOR garbled circuits (Q2056780) (← links)
- Actively secure setup for SPDZ (Q2072211) (← links)
- Broadcast-optimal two-round MPC (Q2119034) (← links)
- High throughput secure MPC over small population in hybrid networks (extended abstract) (Q2152069) (← links)
- Secure multiparty computation with free branching (Q2170008) (← links)
- Secure MPC: laziness leads to GOD (Q2691583) (← links)
- TinyKeys: a new approach to efficient multi-party computation (Q5918657) (← links)
- Correlated pseudorandomness from expand-accumulate codes (Q6162058) (← links)
