Constant-overhead secure computation of Boolean circuits using preprocessing
From MaRDI portal
Recommendations
- A secret-sharing based MPC protocol for Boolean circuits with good amortized complexity
- Communication lower bounds for statistically secure MPC, with or without preprocessing
- Multiparty Computation from Somewhat Homomorphic Encryption
- Secure Arithmetic Computation with No Honest Majority
- Unconditionally Secure Homomorphic Pre-distributed Bit Commitment and Secure Two-Party Computations
Cited in
(29)- Squares of matrix-product codes
- A univariate attack against the limited-data instance of Ciminion
- Efficient set intersection with simulation-based security
- Communication optimal Tardos-based asymmetric fingerprinting
- A secret-sharing based MPC protocol for Boolean circuits with good amortized complexity
- Faster secure multi-party computation of AES and DES using lookup tables
- Sublinear GMW-style compiler for MPC with preprocessing
- MArBLed circuits: mixing arithmetic and Boolean circuits with active security
- Secure computation with minimal interaction, revisited
- Overlaying conditional circuit clauses for secure computation
- Secure multiparty computation with sublinear preprocessing
- BooLigero: improved sublinear zero knowledge proofs for Boolean circuits
- Laconic cryptography with preprocessing
- Sok: vector OLE-based zero-knowledge protocols
- High-performance multi-party computation for binary circuits based on oblivious transfer
- Encryption switching protocols
- Efficient secure multiparty computation with identifiable abort
- Putting the online phase on a diet: covert security from short MACs
- Constant-overhead unconditionally secure multiparty computation over binary fields
- Low cost constant round MPC combining BMR and oblivious transfer
- More efficient dishonest majority secure computation over \(\mathbb{Z}_{2^k}\) via Galois rings
- Algebraic geometric secret sharing schemes over large fields are asymptotically threshold
- High dimensional affine codes whose square has a designed minimum distance
- More efficient zero-knowledge protocols over \(\mathbb{Z}_{2^k}\) via Galois rings
- More efficient oblivious transfer extensions
- Better preprocessing for secure multiparty computation
- On the computational overhead of MPC with dishonest majority
- Secret Sharing Schemes with Algebraic Properties and Applications
- Robust transforming combiners from indistinguishability obfuscation to functional encryption
This page was built for publication: Constant-overhead secure computation of Boolean circuits using preprocessing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4910302)
