Cheater detection in SPDZ multiparty computation
From MaRDI portal
Recommendations
Cites work
- Efficient secure multiparty computation with identifiable abort
- Multiparty Computation from Somewhat Homomorphic Encryption
- Practical covertly secure MPC for dishonest majority -- or: breaking the SPDZ limits
- Secure multi-party computation with identifiable abort
- Semi-homomorphic encryption and multiparty computation
Cited in
(10)- Pipelined algorithms to detect cheating in long-term grid computations
- Your reputation's safe with me: framing-free distributed zero-knowledge proofs
- Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols
- Your reputation's safe with me: framing-free distributed zero-knowledge proofs
- Round-optimal multi-party computation with identifiable abort
- Efficient constant-round MPC with identifiable abort and public verifiability
- MPC with publicly identifiable abort from pseudorandomness and homomorphic encryption
- Cheater identification on a budget: MPC with identifiable abort from pairwise MACs
- Secure multiparty computation with identifiable abort via vindicating release
- Catching MPC cheaters: identification and openability
This page was built for publication: Cheater detection in SPDZ multiparty computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2953814)
