Improved primitives for MPC over mixed arithmetic-binary circuits
From MaRDI portal
Publication:2096551
DOI10.1007/978-3-030-56880-1_29OpenAlexW3014044251MaRDI QIDQ2096551
Marcel Keller, Rahul Rachuri, Peter Scholl, Satrajit Ghosh, Daniel E. Escudero
Publication date: 9 November 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-56880-1_29
Related Items (9)
Sok: vector OLE-based zero-knowledge protocols ⋮ Short signatures from regular syndrome decoding in the head ⋮ Mixed-technique multi-party computations composed of two-party computations ⋮ Prio+: privacy preserving aggregate statistics via Boolean shares ⋮ \textsf{Through the looking-glass}: benchmarking secure multi-party computation comparisons for \textsf{ReLU}'s ⋮ Manticore: a framework for efficient multiparty computation supporting real number and Boolean arithmetic ⋮ Circuit amortization friendly encodingsand their application to statistically secure multiparty computation ⋮ Improved primitives for MPC over mixed arithmetic-binary circuits ⋮ P2DEX: privacy-preserving decentralized cryptocurrency exchange
Cites Work
- \(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority
- Actively secure setup for SPDZ
- Improved primitives for MPC over mixed arithmetic-binary circuits
- Secure computation with preprocessing via function secret sharing
- MArBLed circuits: mixing arithmetic and Boolean circuits with active security
- Efficient pseudorandom correlation generators: silent OT extension and more
- A Unified Approach to MPC with Preprocessing Using OT
- Multiparty Computation from Somewhat Homomorphic Encryption
- A New Approach to Practical Active-Secure Two-Party Computation
- Practical Covertly Secure MPC for Dishonest Majority – Or: Breaking the SPDZ Limits
- Function Secret Sharing
- Binary AMD Circuits from Secure Multiparty Computation
- Improved Primitives for Secure Multiparty Integer Computation
- Circuits resilient to additive attacks with applications to secure computation
- Advances in Cryptology - CRYPTO 2003
- 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
This page was built for publication: Improved primitives for MPC over mixed arithmetic-binary circuits