Secure computation with constant communication overhead using multiplication embeddings
From MaRDI portal
Recommendations
- Perfectly-Secure MPC with Linear Communication Complexity
- Efficient perfectly secure computation with optimal resilience
- Efficient perfectly secure computation with optimal resilience
- Atomic Secure Multi-party Multiplication with Low Communication
- Secure computation using leaky correlations (asymptotically optimal constructions)
Cited in
(13)- Secure computation using leaky correlations (asymptotically optimal constructions)
- Asymptotically-good arithmetic secret sharing over \(\mathbb{Z}/p^{\ell }\mathbb{Z}\) with strong multiplication and its applications to efficient MPC
- Sublinear-communication secure multiparty computation does not require FHE
- Secure multiparty computation with sublinear preprocessing
- \textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions
- The Security and Performance of “GCM” when Short Multiplications Are Used Instead
- On interactive oracle proofs for Boolean R1CS statements
- Maliciously secure matrix multiplication with applications to private deep learning
- Asymptotically quasi-optimal cryptography
- Field instruction multiple data
- Limits of polynomial packings for \(\mathbb{Z}_{p^k}\) and \(\mathbb{F}_{p^k}\)
- More efficient dishonest majority secure computation over \(\mathbb{Z}_{2^k}\) via Galois rings
- Leakage-resilient linear secret-sharing against arbitrary bounded-size leakage family
This page was built for publication: Secure computation with constant communication overhead using multiplication embeddings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1738071)
