Publicly auditable secure multi-party computation
From MaRDI portal
Recommendations
- Verifiable multi-party computation with perfectly private audit trail
- Crowd verifiable zero-knowledge and end-to-end verifiable multiparty computation
- Catching MPC cheaters: identification and openability
- Practical covertly secure MPC for dishonest majority -- or: breaking the SPDZ limits
- Fast large-scale honest-majority MPC for malicious adversaries
Cited in
(16)- Catching MPC cheaters: identification and openability
- Efficient constant-round MPC with identifiable abort and public verifiability
- MPC-in-multi-heads: a multi-prover zero-knowledge proof system (or: how to jointly prove any NP statements in ZK)
- Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols
- Absentia: secure multiparty computation on ethereum
- Crowd verifiable zero-knowledge and end-to-end verifiable multiparty computation
- Universally verifiable multiparty computation from threshold homomorphic cryptosystems
- Better preprocessing for secure multiparty computation
- Trinocchio: privacy-preserving outsourcing by distributed verifiable computation
- Verifiable multi-party computation with perfectly private audit trail
- Function-Dependent Commitments for Verifiable Multi-party Computation
- (Public) verifiability for composable protocols without adaptivity or zero-knowledge
- SCRAPE: scalable randomness attested by public entities
- Malicious security in collaborative zk-SNARKs: more than meets the eye
- MPC with publicly identifiable abort from pseudorandomness and homomorphic encryption
- Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols
This page was built for publication: Publicly auditable secure multi-party computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2922659)
