Pages that link to "Item:Q1749303"
From MaRDI portal
The following pages link to Committed MPC -- maliciously secure multiparty computation from homomorphic commitments (Q1749303):
Displaying 9 items.
- Highly efficient OT-based multiplication protocols (Q2169999) (← links)
- Squares of matrix-product codes (Q2302565) (← links)
- Attacks on the basic cMix design: on the necessity of commitments and randomized partial checking (Q2412244) (← links)
- Brief announcement: On secure m-party computation, commuting permutation systems and unassisted non-interactive MPC (Q5002786) (← links)
- Low cost constant round MPC combining BMR and oblivious transfer (Q5919016) (← links)
- Function-Dependent Commitments for Verifiable Multi-party Computation (Q6108843) (← links)
- More efficient dishonest majority secure computation over \(\mathbb{Z}_{2^k}\) via Galois rings (Q6155261) (← links)
- Non-interactive commitment from non-transitive group actions (Q6595925) (← links)
- Solving the tensor isomorphism problem for special orbits with low rank points: cryptanalysis and repair of an Asiacrypt 2023 commitment scheme (Q6648191) (← links)
