Le Mans: dynamic and fluid MPC for dishonest majority
From MaRDI portal
Publication:6097268
DOI10.1007/978-3-031-15802-5_25zbMath1516.94049OpenAlexW4312847366MaRDI QIDQ6097268
Publication date: 12 June 2023
Published in: Advances in Cryptology – CRYPTO 2022 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-15802-5_25
Related Items (3)
\textsc{SuperPack}: dishonest majority MPC with constant online communication ⋮ SCALES. MPC with small clients and larger ephemeral servers ⋮ On linear communication complexity for (maximally) fluid MPC
Cites Work
- Unnamed Item
- Fast large-scale honest-majority MPC for malicious adversaries
- Overdrive: making SPDZ great again
- When it's all just too much: outsourcing MPC-preprocessing
- Can a public blockchain keep a secret?
- The more the merrier: reducing the cost of large scale MPC
- Efficient pseudorandom correlation generators from ring-LPN
- YOSO: You only speak once. Secure MPC with stateless ephemeral roles
- Fluid MPC: secure multiparty computation with dynamic participants
- Secure multiparty computation with sublinear preprocessing
- Efficient pseudorandom correlation generators: silent OT extension and more
- Multiparty Computation from Somewhat Homomorphic Encryption
- Practical Covertly Secure MPC for Dishonest Majority – Or: Breaking the SPDZ Limits
- Semi-homomorphic Encryption and Multiparty Computation
- The vectorization of ITPACK 2C
- Scalable and Unconditionally Secure Multiparty Computation
- An O (log n ) expected rounds randomized byzantine generals protocol
- Storing and Retrieving Secrets on a Blockchain
- Low cost constant round MPC combining BMR and oblivious transfer
This page was built for publication: Le Mans: dynamic and fluid MPC for dishonest majority
