Pages that link to "Item:Q2119064"
From MaRDI portal
The following pages link to A secret-sharing based MPC protocol for Boolean circuits with good amortized complexity (Q2119064):
Displaying 3 items.
- Sublinear GMW-style compiler for MPC with preprocessing (Q2128572) (← links)
- Asymptotically-good arithmetic secret sharing over \(\mathbb{Z}/p^{\ell }\mathbb{Z}\) with strong multiplication and its applications to efficient MPC (Q2129015) (← links)
- Limits of polynomial packings for \(\mathbb{Z}_{p^k}\) and \(\mathbb{F}_{p^k}\) (Q2170012) (← links)
