MPC with friends and foes

DOI10.1007/978-3-030-56880-1_24zbMATH Open1504.94091OpenAlexW3037076805MaRDI QIDQ2096545FDOQ2096545

Authors: Bar Alon, Eran Omri, Anat Paskin-Cherniavsky 

Publication date: 9 November 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-56880-1_24

Recommendations

• Attaining GOD beyond honest majority with friends and foes
• Multi-Party Computation with Omnipresent Adversary
• \(1/p\)-secure multiparty computation without an honest majority and the best of both worlds

zbMATH Keywords

secure multiparty computationFaF-security

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• How to share a secret
• Security and composition of multiparty cryptographic protocols
• Title not available (Why is that?)
• Foundations of Cryptography
• Complete fairness in secure two-party computation
• Theory of Cryptography
• The round complexity of verifiable secret sharing and secure multicast
• Complete Fairness in Multi-party Computation without an Honest Majority
• Adaptively secure multi-party computation with dishonest majority
• Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
• Title not available (Why is that?)
• Title not available (Why is that?)
• Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority
• Nonmalleable Cryptography
• Realistic Failures in Secure Multi-party Computation
• Two-round adaptively secure multiparty computation from standard assumptions
• Best possible information-theoretic MPC
• Secure multiparty computation with minimal interaction
• Title not available (Why is that?)
• Equivocating Yao: constant-round adaptively secure multiparty computation in the plain model
• Secure computation on the web: computing without simultaneous interaction
• Designing fully secure protocols for secure two-party computation of constant-domain functions
• MPC with friends and foes
• Universally composable security with local adversaries
• Collusion-preserving computation
• On the classification of finite Boolean functions up to fairness
• On achieving the ``best of both worlds in secure multiparty computation
• Collusion-Free Multiparty Computation in the Mediated Model
• Minimal-latency secure function evaluation
• Collusion-Free Protocols in the Mediated Model
• MPC vs. SFE : Unconditional and Computational Security
• Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions
• MPC vs. SFE: Perfect Security in a Unified Corruption Model
• Theory of Cryptography

Cited In (6)

• Attaining GOD beyond honest majority with friends and foes
• Three party secure computation with friends and foes
• Just how fair is an unreactive world?
• Best of both worlds. Revisiting the spymasters double agent problem
• Threshold-optimal MPC with friends and foes
• MPC with friends and foes

This page was built for publication: MPC with friends and foes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2096545)