Pages that link to "Item:Q1738071"
From MaRDI portal
The following pages link to Secure computation with constant communication overhead using multiplication embeddings (Q1738071):
Displaying 12 items.
- Secure computation using leaky correlations (asymptotically optimal constructions) (Q1631316) (← links)
- Asymptotically-good arithmetic secret sharing over \(\mathbb{Z}/p^{\ell }\mathbb{Z}\) with strong multiplication and its applications to efficient MPC (Q2129015) (← links)
- \textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions (Q2139630) (← links)
- Asymptotically quasi-optimal cryptography (Q2170004) (← links)
- Secure multiparty computation with sublinear preprocessing (Q2170009) (← links)
- Limits of polynomial packings for \(\mathbb{Z}_{p^k}\) and \(\mathbb{F}_{p^k}\) (Q2170012) (← links)
- Field instruction multiple data (Q2170023) (← links)
- Maliciously secure matrix multiplication with applications to private deep learning (Q2691579) (← links)
- The Security and Performance of “GCM” when Short Multiplications Are Used Instead (Q4922047) (← links)
- On interactive oracle proofs for Boolean R1CS statements (Q6045202) (← links)
- Leakage-resilient linear secret-sharing against arbitrary bounded-size leakage family (Q6114238) (← links)
- More efficient dishonest majority secure computation over \(\mathbb{Z}_{2^k}\) via Galois rings (Q6155261) (← links)
