Using TopGear in overdrive: a more efficient ZKPoK for SPDZ
From MaRDI portal
(Redirected from Publication:778926)
Recommendations
- Overdrive: making SPDZ great again
- Practical covertly secure MPC for dishonest majority -- or: breaking the SPDZ limits
- Better preprocessing for secure multiparty computation
- Turbospeedz: double your online SPDZ! Improving SPDZ using function dependent preprocessing
- Overdrive2k: efficient secure MPC over \(\mathbb{Z}_{2^k}\) from somewhat homomorphic encryption
Cited in
(17)- Secure multiparty computation from threshold encryption based on class groups
- Overdrive: making SPDZ great again
- On the scaled inverse of \((x^i-x^j)\) modulo cyclotomic polynomial of the form \(\Phi_{p^s}(x)\) or \(\Phi_{p^s q^t}(x)\)
- Efficient, actively secure MPC with a dishonest majority: a survey
- The more the merrier: reducing the cost of large scale MPC
- Mixed-technique multi-party computations composed of two-party computations
- Practical and efficient FHE-based MPC
- Actively secure setup for SPDZ
- Mhz2K: MPC from HE over \(\mathbb{Z}_{2^k}\) with new packing, simpler reshare, and better ZKP
- Putting the online phase on a diet: covert security from short MACs
- More efficient dishonest majority secure computation over \(\mathbb{Z}_{2^k}\) via Galois rings
- On information-theoretic secure multiparty computation with local repairability
- Honest majority MPC with abort with minimal online communication
- MPC-in-multi-heads: a multi-prover zero-knowledge proof system (or: how to jointly prove any NP statements in ZK)
- More efficient amortization of exact zero-knowledge proofs for LWE
- Toward practical lattice-based proof of knowledge from Hint-MLWE
- Limits of polynomial packings for \(\mathbb{Z}_{p^k}\) and \(\mathbb{F}_{p^k}\)
This page was built for publication: Using TopGear in overdrive: a more efficient ZKPoK for SPDZ
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q778926)
