Pages that link to "Item:Q1656048"
From MaRDI portal
The following pages link to Minimising communication in honest-majority MPC by batchwise multiplication verification (Q1656048):
Displaying 15 items.
- Robust multiparty computation with faster verification time (Q1784445) (← links)
- Order-C secure multiparty computation for highly repetitive circuits (Q2056761) (← links)
- The more the merrier: reducing the cost of large scale MPC (Q2056763) (← links)
- Constant-overhead unconditionally secure multiparty computation over binary fields (Q2056769) (← links)
- Guaranteed output delivery comes free in honest majority MPC (Q2096542) (← links)
- An efficient passive-to-active compiler for honest-majority MPC over rings (Q2117048) (← links)
- Fluid MPC: secure multiparty computation with dynamic participants (Q2128557) (← links)
- ATLAS: efficient and scalable MPC in the honest majority setting (Q2128563) (← links)
- Unconditional communication-efficient MPC via Hall's marriage theorem (Q2128564) (← links)
- Honest majority MPC with abort with minimal online communication (Q2146110) (← links)
- Asymptotically good multiplicative LSSS over Galois rings and applications to MPC over \(\mathbb{Z}/p^k\mathbb{Z} \) (Q2691584) (← links)
- Efficient fully secure computation via distributed zero-knowledge proofs (Q2691587) (← links)
- Attaining GOD beyond honest majority with friends and foes (Q6135412) (← links)
- Non-interactive zero-knowledge proofs to multiple verifiers (Q6135446) (← links)
- Ramp hyper-invertible matrices and their applications to MPC protocols (Q6595682) (← links)
