On linear communication complexity for (maximally) fluid MPC

DOI10.1007/978-3-031-38557-5_9OpenAlexW4385654378MaRDI QIDQ6186594

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

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

Cites Work

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

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