On linear communication complexity for (maximally) fluid MPC

DOI10.1007/978-3-031-38557-5_9MaRDI QIDQ6186594zbMATH OpenOpenAlexFDO

Authors Alexander Bienstock, Daniel E. Escudero, Antigoni Polychroniadou

Publication date 2 February 2024

Published in Advances in Cryptology – CRYPTO 2023 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-38557-5_9

zbMATH Keywords

large scale distributed protocolsmaximal fluiditymultiparty computation protocols

Mathematics Subject Classification ID

Communication theory (94A05) Cryptography (94A60) Network protocols (68M12)

Recommendations

• Le Mans: dynamic and fluid MPC for dishonest majority
• Communication-efficient proactive MPC for dynamic groups with dishonest majorities
• Perfectly-Secure MPC with Linear Communication Complexity
• Best of both worlds in secure computation, with low communication overhead
• Simple and Efficient Perfectly-Secure Asynchronous MPC

Cites work

• scientific article; zbMATH DE number 176564 (Why is no real title available?)
• scientific article; zbMATH DE number 3605770 (Why is no real title available?)
• scientific article; zbMATH DE number 1302842 (Why is no real title available?)
• ATLAS: efficient and scalable MPC in the honest majority setting
• Circuits resilient to additive attacks with applications to secure computation
• Efficient fully secure computation via distributed zero-knowledge proofs
• Fast large-scale honest-majority MPC for malicious adversaries
• Fluid MPC: secure multiparty computation with dynamic participants
• Le Mans: dynamic and fluid MPC for dishonest majority
• Multiparty Computation from Somewhat Homomorphic Encryption
• Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
• Scalable and Unconditionally Secure Multiparty Computation
• Secure MPC: laziness leads to GOD
• Semi-homomorphic encryption and multiparty computation
• Synchronous, with a chance of partition tolerance
• Turbospeedz: double your online SPDZ! Improving SPDZ using function dependent preprocessing
• YOSO: You only speak once. Secure MPC with stateless ephemeral roles
• \textsc{SuperPack}: dishonest majority MPC with constant online communication

Cited in

(1)

• On information-theoretic secure multiparty computation with local repairability

This page was built for publication: On linear communication complexity for (maximally) fluid MPC

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