Threshold-optimal MPC with friends and foes

DOI10.1007/978-3-031-56235-8_1MaRDI QIDQ6623341

Sophia Yakoubov, Nikolas Melissaris, Divya Ravi

Publication date: 23 October 2024

zbMATH Keywords

round complexitysecure computationguaranteed output deliveryfriends and foes

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Threshold cryptosystems from threshold fully homomorphic encryption
• Advances in cryptology -- CRYPTO 2020. 40th annual international cryptology conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17--21, 2020. Proceedings. Part II
• Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
• Adaptive versus Static Security in the UC Model
• Constant-Round MPC with Fairness and Guarantee of Output Delivery
• Secure Computation with Minimal Interaction, Revisited
• Universally composable two-party and multi-party secure computation
• Secure Multiparty Computation with Minimal Interaction
• On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation
• On the exact round complexity of secure three-party computation
• Attaining GOD beyond honest majority with friends and foes

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

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