MArBLed circuits: mixing arithmetic and Boolean circuits with active security
From MaRDI portal
Publication:2179391
DOI10.1007/978-3-030-35423-7_12zbMath1453.68082OpenAlexW2933303456MaRDI QIDQ2179391
Publication date: 12 May 2020
Full work available at URL: https://doi.org/10.1007/978-3-030-35423-7_12
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62) Networks and circuits as models of computation; circuit complexity (68Q06)
Related Items (13)
Compilation of function representations for secure computing paradigms ⋮ \( \mathsf{Rabbit} \): efficient comparison for secure multi-party computation ⋮ Full-threshold actively-secure multiparty arithmetic circuit garbling ⋮ The cost of IEEE arithmetic in secure computation ⋮ Short signatures from regular syndrome decoding in the head ⋮ Mixed-technique multi-party computations composed of two-party computations ⋮ MPClan: protocol suite for privacy-conscious 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 ⋮ Actively secure setup for SPDZ ⋮ Improved primitives for MPC over mixed arithmetic-binary circuits
Cites Work
- Unnamed Item
- Efficient maliciously secure multiparty computation for RAM
- Overdrive: making SPDZ great again
- On multiparty garbling of arithmetic circuits
- \(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority
- Error detection in monotone span programs with application to communication-efficient multi-party computation
- EPIC: efficient private image classification (or: learning from the masters)
- 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
- Semi-homomorphic Encryption and Multiparty Computation
- Efficient Constant Round Multi-party Computation Combining BMR and SPDZ
- Constant-Overhead Secure Computation of Boolean Circuits using Preprocessing
- Automatic Protocol Selection in Secure Two-Party Computations
- TinyKeys: a new approach to efficient multi-party computation
- Low cost constant round MPC combining BMR and oblivious transfer
This page was built for publication: MArBLed circuits: mixing arithmetic and Boolean circuits with active security
