SPD Z₂^k: efficient MPC 2ᵏ for dishonest majority
From MaRDI portal
Publication:1784115
Recommendations
- Efficient information-theoretic secure multiparty computation over \(\mathbb{Z}/p^k\mathbb{Z}\) via Galois rings
- Overdrive2k: efficient secure MPC over \(\mathbb{Z}_{2^k}\) from somewhat homomorphic encryption
- Practical covertly secure MPC for dishonest majority -- or: breaking the SPDZ limits
- More efficient dishonest majority secure computation over \(\mathbb{Z}_{2^k}\) via Galois rings
- Implementing AES via an actively/covertly secure dishonest-majority MPC protocol
Cited in
(58)- Yet another compiler for active security or: efficient MPC over arbitrary rings
- High-performance multi-party computation for binary circuits based on oblivious transfer
- Secure multi-party quantum computation with a dishonest majority
- Mon\(\mathbb{Z}_{2^k}\)a: fast maliciously secure two party computation on \(\mathbb{Z}_{2^k} \)
- Large scale, actively secure computation from LPN and free-XOR garbled circuits
- Masked triples. Amortizing multiplication triples across conditionals
- Actively secure setup for SPDZ
- Improved primitives for MPC over mixed arithmetic-binary circuits
- P2DEX: privacy-preserving decentralized cryptocurrency exchange
- An efficient passive-to-active compiler for honest-majority MPC over rings
- Sumcheck arguments and their applications
- Mhz2K: MPC from HE over \(\mathbb{Z}_{2^k}\) with new packing, simpler reshare, and better ZKP
- Sublinear GMW-style compiler for MPC with preprocessing
- Asymptotically-good arithmetic secret sharing over \(\mathbb{Z}/p^{\ell }\mathbb{Z}\) with strong multiplication and its applications to efficient MPC
- MPC-friendly symmetric cryptography from alternating moduli: candidates, protocols, and applications
- Full-threshold actively-secure multiparty arithmetic circuit garbling
- Honest majority MPC with abort with minimal online communication
- Secure multiparty computation with free branching
- Secure multiparty computation with sublinear preprocessing
- Limits of polynomial packings for \(\mathbb{Z}_{p^k}\) and \(\mathbb{F}_{p^k}\)
- Efficient information-theoretic secure multiparty computation over \(\mathbb{Z}/p^k\mathbb{Z}\) via Galois rings
- MArBLed circuits: mixing arithmetic and Boolean circuits with active security
- An efficient secure division protocol using approximate multi-bit product and new constant-round building blocks
- Asymptotically good multiplicative LSSS over Galois rings and applications to MPC over \(\mathbb{Z}/p^k\mathbb{Z} \)
- Implementing AES via an actively/covertly secure dishonest-majority MPC protocol
- Practical covertly secure MPC for dishonest majority -- or: breaking the SPDZ limits
- Improved multiplication triple generation over rings via RLWE-based AHE
- Sok: vector OLE-based zero-knowledge protocols
- Putting the online phase on a diet: covert security from short MACs
- MPClan: protocol suite for privacy-conscious computations
- Threshold linearly homomorphic encryption on \(\mathrm{Z}/2^k\mathrm{Z}\)
- Attaining GOD beyond honest majority with friends and foes
- Cryptanalysis of symmetric primitives over rings and a key recovery attack on \textsf{Rubato}
- 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}\)
- Vector commitments over rings and compressed -protocols
- Manticore: a framework for efficient multiparty computation supporting real number and Boolean arithmetic
- Secure Multiparty Matrix Multiplication Based on Strassen-Winograd Algorithm
- A new approach to efficient and secure fixed-point computation
- Lightweight asynchronous verifiable secret sharing with optimal resilience
- Amortized NISC over \(\mathbb{Z}_{2^k}\) from RMFE
- Degree-D reverse multiplication-friendly embeddings: constructions and applications
- ZK-for-Z2K: MPC-in-the-head zero-knowledge proofs for \(\mathbb{Z}_{2^k}\)
- MPC for \(\mathcal{Q}_2\) access structures over rings and fields
- Privacy-preserving edit distance computation using secret-sharing two-party computation
- The hardness of LPN over any integer ring and field for PCG applications
- Fully secure MPC and zk-FLIOP over rings: new constructions, improvements and extensions
- More efficient zero-knowledge protocols over \(\mathbb{Z}_{2^k}\) via Galois rings
- Efficient pseudorandom correlation generators over \(\mathbb{Z}/p^k\mathbb{Z} \)
- Hybrid zero-knowledge from garbled circuits
- Dishonest majority multiparty computation over matrix rings
- Correction to: ``Actively secure setup for SPDZ
- Pseudorandom correlation functions from Ring-LWR
- XorSHAP: privacy-preserving explainable AI for decision tree models
- Tunable zero-knowledge proof of inference in machine learning via protocols over \(\mathbb{Z}_{2^k} \)
- Multi-committee MPC: from unanimous to identifiable abort
- Overdrive2k: efficient secure MPC over \(\mathbb{Z}_{2^k}\) from somewhat homomorphic encryption
- Compilation of function representations for secure computing paradigms
This page was built for publication: \(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1784115)
