Pages that link to "Item:Q2304978"
From MaRDI portal
The following pages link to Communication lower bounds for statistically secure MPC, with or without preprocessing (Q2304978):
Displaying 5 items.
- 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)
- Asymptotically good multiplicative LSSS over Galois rings and applications to MPC over \(\mathbb{Z}/p^k\mathbb{Z} \) (Q2691584) (← links)
- On interactive oracle proofs for Boolean R1CS statements (Q6045202) (← links)
- Scalable multiparty computation from non-linear secret sharing (Q6653034) (← links)
