On linear communication complexity for (maximally) fluid MPC
From MaRDI portal
Publication:6186594
DOI10.1007/978-3-031-38557-5_9OpenAlexW4385654378MaRDI QIDQ6186594FDOQ6186594
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
Cites Work
- Multiparty Computation from Somewhat Homomorphic Encryption
- Semi-homomorphic encryption and multiparty computation
- Scalable and Unconditionally Secure Multiparty Computation
- Circuits resilient to additive attacks with applications to secure computation
- Title not available (Why is that?)
- Title not available (Why is that?)
- Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
- ATLAS: efficient and scalable MPC in the honest majority setting
- Fast large-scale honest-majority MPC for malicious adversaries
- Title not available (Why is that?)
- 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
- Synchronous, with a chance of partition tolerance
- YOSO: You only speak once. Secure MPC with stateless ephemeral roles
- Fluid MPC: secure multiparty computation with dynamic participants
- \textsc{SuperPack}: dishonest majority MPC with constant online communication
- Le Mans: dynamic and fluid MPC for dishonest majority
Cited In (1)
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)
