Three party secure computation with friends and foes
From MaRDI portal
Publication:6582170
Recommendations
Cites work
- scientific article; zbMATH DE number 5485432 (Why is no real title available?)
- scientific article; zbMATH DE number 1418289 (Why is no real title available?)
- Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions
- Complete Fairness in Multi-party Computation without an Honest Majority
- Complete fairness in secure two-party computation
- Designing fully secure protocols for secure two-party computation of constant-domain functions
- Foundations of Cryptography
- How to share a secret
- MPC with friends and foes
- On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation
- On achieving the ``best of both worlds in secure multiparty computation
- On fully secure MPC with solitary output
- On the classification of finite Boolean functions up to fairness
- Protocols for multiparty coin toss with a dishonest majority
- Revisiting fairness in MPC: polynomial number of parties and general adversarial structures
- Secure multiparty computation with minimal interaction
- Security and composition of multiparty cryptographic protocols
- Towards characterizing complete fairness in secure two-party computation
- \(1/p\)-secure multiparty computation without an honest majority and the best of both worlds
This page was built for publication: Three party secure computation with friends and foes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6582170)
