Concretely efficient fluid MPC with linear communication

DOI10.1007/978-3-032-26734-4_7MaRDI QIDQ7363453zbMATH OpenFDO

Authors Yubo Zeng, Kang Yang, Dengguo Feng, Min Zhang

Publication date 29 September 2026

Full work available at URL https://doi.org/10.1007/978-3-032-26734-4_7

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• ATLAS: efficient and scalable MPC in the honest majority setting
• Circuits resilient to additive attacks with applications to secure computation
• Fast large-scale honest-majority MPC for malicious adversaries
• Fluid MPC: secure multiparty computation with dynamic participants
• How to share a secret
• scientific article; zbMATH DE number 176564 (Why is no real title available?)
• Le Mans: dynamic and fluid MPC for dishonest majority
• Minimising communication in honest-majority MPC by batchwise multiplication verification
• On linear communication complexity for (maximally) fluid MPC
• Perfect MPC over layered graphs
• Perfectly secure fluid MPC with abort and linear communication complexity
• Public randomness extraction with ephemeral roles and worst-case corruptions
• Scalable and Unconditionally Secure Multiparty Computation
• Secure multiparty computation from threshold encryption based on class groups
• YOLO YOSO: fast and simple encryption and secret sharing in the YOSO model
• YOSO: You only speak once. Secure MPC with stateless ephemeral roles

This page was built for publication: Concretely efficient fluid MPC with linear communication

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