On sufficient oracles for secure computation with identifiable abort
From MaRDI portal
Publication:6134836
Recommendations
- Secure multi-party computation with identifiable abort
- Efficient secure multiparty computation with identifiable abort
- Round-optimal multi-party computation with identifiable abort
- Identifying cheaters without an honest majority
- Round efficient secure multiparty quantum computation with identifiable abort
Cites work
- scientific article; zbMATH DE number 4195141 (Why is no real title available?)
- scientific article; zbMATH DE number 5485433 (Why is no real title available?)
- scientific article; zbMATH DE number 1030985 (Why is no real title available?)
- scientific article; zbMATH DE number 1848306 (Why is no real title available?)
- Identifying cheaters without an honest majority
- Secure multi-party computation with identifiable abort
Cited in
(7)- Cheater identification on a budget: MPC with identifiable abort from pairwise MACs
- Secure multiparty computation with identifiable abort via vindicating release
- Your reputation's safe with me: framing-free distributed zero-knowledge proofs
- On the correlation complexity of MPC with cheater identification
- Secure multi-party computation with identifiable abort
- Efficient secure multiparty computation with identifiable abort
- Oracles for structural properties: The isomorphism problem and public-key cryptography
This page was built for publication: On sufficient oracles for secure computation with identifiable abort
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6134836)