Multiparty computation with minimal overhead without circuit transformation
From MaRDI portal
Cites work
- \(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority
- A modular approach to key safeguarding
- Asymptotically-good arithmetic secret sharing over \(\mathbb{Z}/p^{\ell }\mathbb{Z}\) with strong multiplication and its applications to efficient MPC
- Chinese remaindering with errors
- Communication lower bounds for statistically secure MPC, with or without preprocessing
- Cryptography with weights: MPC, encryption and signatures
- How to Garble Arithmetic Circuits
- How to share a secret
- scientific article; zbMATH DE number 5485433 (Why is no real title available?)
- Malicious security in collaborative zk-SNARKs: more than meets the eye
- Mhz2K: MPC from HE over \(\mathbb{Z}_{2^k}\) with new packing, simpler reshare, and better ZKP
- More efficient dishonest majority secure computation over \(\mathbb{Z}_{2^k}\) via Galois rings
- Moz\(\mathbb{Z}_{2^k}\)arella: efficient vector-OLE and zero-knowledge proofs over \(\mathbb{Z}_{2^k}\)
- Multiparty computation with low communication, computation and interaction via threshold FHE
- Order-C secure multiparty computation for highly repetitive circuits
- Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
- Scalable and Unconditionally Secure Multiparty Computation
- Scalable multiparty computation from non-linear secret sharing
This page was built for publication: Multiparty computation with minimal overhead without circuit transformation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7443567)