Pages that link to "Item:Q2129015"

The following pages link to Asymptotically-good arithmetic secret sharing over \(\mathbb{Z}/p^{\ell }\mathbb{Z}\) with strong multiplication and its applications to efficient MPC (Q2129015):

Displayed 5 items.

• Limits of polynomial packings for \(\mathbb{Z}_{p^k}\) and \(\mathbb{F}_{p^k}\) (Q2170012) ‎ (← links)
• Field instruction multiple data (Q2170023) ‎ (← links)
• Efficient information-theoretic secure multiparty computation over \(\mathbb{Z}/p^k\mathbb{Z}\) via Galois rings (Q2175924) ‎ (← links)
• Sharing transformation and dishonest majority MPC with packed secret sharing (Q6111539) ‎ (← links)
• More efficient dishonest majority secure computation over \(\mathbb{Z}_{2^k}\) via Galois rings (Q6155261) ‎ (← links)