Improved primitives for MPC over mixed arithmetic-binary circuits
From MaRDI portal
Publication:2096551
Recommendations
- MArBLed circuits: mixing arithmetic and Boolean circuits with active security
- Probabilistically correct secure arithmetic computation for modular conversion, zero test, comparison, MOD and exponentiation
- Improved primitives for secure multiparty integer computation
- On multiparty garbling of arithmetic circuits
- Secure Arithmetic Computation with No Honest Majority
Cites work
- A Unified Approach to MPC with Preprocessing Using OT
- A new approach to practical active-secure two-party computation
- Actively secure setup for SPDZ
- Advances in Cryptology - CRYPTO 2003
- Binary AMD circuits from secure multiparty computation
- Circuits resilient to additive attacks with applications to secure computation
- Efficient pseudorandom correlation generators: silent OT extension and more
- Function secret sharing
- High-throughput secure three-party computation for malicious adversaries and an honest majority
- Improved primitives for MPC over mixed arithmetic-binary circuits
- Improved primitives for secure multiparty integer computation
- Low cost constant round MPC combining BMR and oblivious transfer
- MArBLed circuits: mixing arithmetic and Boolean circuits with active security
- Multiparty Computation from Somewhat Homomorphic Encryption
- Practical covertly secure MPC for dishonest majority -- or: breaking the SPDZ limits
- Secure computation with preprocessing via function secret sharing
- Theory of Cryptography
- \(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority
Cited in
(17)- Prio+: privacy preserving aggregate statistics via Boolean shares
- Efficient secure multi-party computation for proof of custody in Ethereum sharding
- P2DEX: privacy-preserving decentralized cryptocurrency exchange
- MArBLed circuits: mixing arithmetic and Boolean circuits with active security
- \textsf{Through the looking-glass}: benchmarking secure multi-party computation comparisons for \textsf{ReLU}'s
- Circuit amortization friendly encodingsand their application to statistically secure multiparty computation
- ZK-for-Z2K: MPC-in-the-head zero-knowledge proofs for \(\mathbb{Z}_{2^k}\)
- Sok: vector OLE-based zero-knowledge protocols
- Privacy-preserving edit distance computation using secret-sharing two-party computation
- Short signatures from regular syndrome decoding in the head
- Compressing unit-vector correlations via sparse pseudorandom generators
- Hybrid zero-knowledge from garbled circuits and circuit-based composition of \(\Sigma \)-protocols
- Mixed-technique multi-party computations composed of two-party computations
- Manticore: a framework for efficient multiparty computation supporting real number and Boolean arithmetic
- Efficient Binary Conversion for Paillier Encrypted Values
- Improved primitives for MPC over mixed arithmetic-binary circuits
- A new approach to efficient and secure fixed-point computation
This page was built for publication: Improved primitives for MPC over mixed arithmetic-binary circuits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2096551)
