Committed MPC -- maliciously secure multiparty computation from homomorphic commitments
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1583776
- scientific article; zbMATH DE number 1754645
- An Efficient Framework for Unconditionally Secure Multiparty Computation
- Bounded-concurrent secure multi-party computation with a dishonest majority
- Adaptive and concurrent secure computation from new adaptive, non-malleable commitments
- The bottleneck complexity of secure multiparty computation
- Secure multiparty computation with sublinear preprocessing
- Verifiable computation in multiparty protocols with honest majority
Cited in
(12)- Highly efficient OT-based multiplication protocols
- Commodity-based 2PC for arithmetic circuits
- Squares of matrix-product codes
- Attacks on the basic cMix design: on the necessity of commitments and randomized partial checking
- Brief announcement: On secure m-party computation, commuting permutation systems and unassisted non-interactive MPC
- Low cost constant round MPC combining BMR and oblivious transfer
- Function-Dependent Commitments for Verifiable Multi-party Computation
- More efficient dishonest majority secure computation over \(\mathbb{Z}_{2^k}\) via Galois rings
- Non-interactive commitment from non-transitive group actions
- Solving the tensor isomorphism problem for special orbits with low rank points: cryptanalysis and repair of an Asiacrypt 2023 commitment scheme
- Doubly efficient cryptography: commitments, arguments and RAM MPC
- Re-randomize and extract: a novel commitment construction framework based on group actions
This page was built for publication: Committed MPC -- maliciously secure multiparty computation from homomorphic commitments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1749303)
