Improved primitives for MPC over mixed arithmetic-binary circuits
From MaRDI portal
Publication:2096551
DOI10.1007/978-3-030-56880-1_29OpenAlexW3014044251MaRDI QIDQ2096551FDOQ2096551
Marcel Keller, Rahul Rachuri, Peter Scholl, Daniel E. Escudero, Satrajit Ghosh
Publication date: 9 November 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-56880-1_29
Cites Work
- Multiparty Computation from Somewhat Homomorphic Encryption
- A New Approach to Practical Active-Secure Two-Party Computation
- Advances in Cryptology - CRYPTO 2003
- Circuits resilient to additive attacks with applications to secure computation
- Practical Covertly Secure MPC for Dishonest Majority – Or: Breaking the SPDZ Limits
- \(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority
- MArBLed circuits: mixing arithmetic and Boolean circuits with active security
- Improved Primitives for Secure Multiparty Integer Computation
- High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority
- Theory of Cryptography
- Low cost constant round MPC combining BMR and oblivious transfer
- Function Secret Sharing
- Binary AMD Circuits from Secure Multiparty Computation
- A Unified Approach to MPC with Preprocessing Using OT
- Secure computation with preprocessing via function secret sharing
- Efficient pseudorandom correlation generators: silent OT extension and more
- Actively secure setup for SPDZ
- Improved primitives for MPC over mixed arithmetic-binary circuits
Cited In (15)
- 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
- \textsf{Through the looking-glass}: benchmarking secure multi-party computation comparisons for \textsf{ReLU}'s
- ZK-for-Z2K: MPC-in-the-head zero-knowledge proofs for \(\mathbb{Z}_{2^k}\)
- Circuit amortization friendly encodingsand their application to statistically secure multiparty computation
- 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
- A new approach to efficient and secure fixed-point computation
- Improved primitives for MPC over mixed arithmetic-binary circuits
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)
