Three party secure computation with friends and foes
From MaRDI portal
Publication:6582170
DOI10.1007/978-3-031-48618-0_6zbMATH Open1544.94216MaRDI QIDQ6582170FDOQ6582170
Authors: Bar Alon, Amos Beimel, Eran Omri 
Publication date: 2 August 2024
Recommendations
Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Network protocols (68M12)
Cites Work
- How to share a secret
- Security and composition of multiparty cryptographic protocols
- Foundations of Cryptography
- Title not available (Why is that?)
- Complete fairness in secure two-party computation
- Complete Fairness in Multi-party Computation without an Honest Majority
- Title not available (Why is that?)
- Protocols for multiparty coin toss with a dishonest majority
- Secure multiparty computation with minimal interaction
- Designing fully secure protocols for secure two-party computation of constant-domain functions
- Towards characterizing complete fairness in secure two-party computation
- On fully secure MPC with solitary output
- \(1/p\)-secure multiparty computation without an honest majority and the best of both worlds
- MPC with friends and foes
- On the classification of finite Boolean functions up to fairness
- On achieving the ``best of both worlds in secure multiparty computation
- Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions
- Revisiting fairness in MPC: polynomial number of parties and general adversarial structures
- On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation
Cited In (1)
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)
