Cheater identification on a budget: MPC with identifiable abort from pairwise MACs
From MaRDI portal
Publication:6653036
Recommendations
Cites work
- A Framework for Efficient and Composable Oblivious Transfer
- Broadcast-optimal two round MPC with an honest majority
- Broadcast-optimal two-round MPC
- Catching MPC cheaters: identification and openability
- Cheater detection in SPDZ multiparty computation
- Efficient compiler to covert security with public verifiability for honest majority MPC
- Efficient constant-round MPC with identifiable abort and public verifiability
- Efficient pseudorandom correlation generators from ring-LPN
- Efficient secure multiparty computation with identifiable abort
- Generic compiler for publicly verifiable covert multi-party computation
- Identifying cheaters without an honest majority
- Le Mans: dynamic and fluid MPC for dishonest majority
- Minimizing setup in broadcast-optimal two round MPC
- Multiparty Computation from Somewhat Homomorphic Encryption
- On sufficient oracles for secure computation with identifiable abort
- Protecting distributed primitives against leakage: equivocal secret sharing and more
- Round-optimal multi-party computation with identifiable abort
- Secure multi-party computation with identifiable abort
- Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
- Semi-homomorphic encryption and multiparty computation
- Sok: vector OLE-based zero-knowledge protocols
- Universally composable synchronous computation
This page was built for publication: Cheater identification on a budget: MPC with identifiable abort from pairwise MACs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6653036)