Verifiable computation in multiparty protocols with honest majority
From MaRDI portal
Publication:2948147
Recommendations
- Efficient compiler to covert security with public verifiability for honest majority MPC
- Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
- Security against covert adversaries: Efficient protocols for realistic adversaries
- Universally verifiable multiparty computation from threshold homomorphic cryptosystems
- Efficient Two Party and Multi Party Computation Against Covert Adversaries
Cited in
(15)- scientific article; zbMATH DE number 6829278 (Why is no real title available?)
- Crowd verifiable zero-knowledge and end-to-end verifiable multiparty computation
- Manticore: a framework for efficient multiparty computation supporting real number and Boolean arithmetic
- Verifiable partial escrow of integer factors.
- Efficient compiler to covert security with public verifiability for honest majority MPC
- Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority
- Proving Correctness and Security of Two-Party Computation Implemented in Java in Presence of a Semi-honest Sender
- scientific article; zbMATH DE number 1941258 (Why is no real title available?)
- Collusion-Free Multiparty Computation in the Mediated Model
- Function-Dependent Commitments for Verifiable Multi-party Computation
- Committed MPC -- maliciously secure multiparty computation from homomorphic commitments
- Proactive secure multiparty computation with a dishonest majority
- Realizable Rational Multiparty Cryptographic Protocols
- More efficient dishonest majority secure computation over \(\mathbb{Z}_{2^k}\) via Galois rings
- Robust multiparty computation with faster verification time
This page was built for publication: Verifiable computation in multiparty protocols with honest majority
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2948147)
