Perfectly secure fluid MPC with abort and linear communication complexity
From MaRDI portal
Cites work
- Communication-efficient unconditional MPC with guaranteed output delivery
- Detect, pack and batch: perfectly-secure MPC with linear communication and constant expected time
- Efficient perfectly secure computation with optimal resilience
- Fluid MPC: secure multiparty computation with dynamic participants
- Guaranteed output delivery comes free in honest majority MPC
- scientific article; zbMATH DE number 176564 (Why is no real title available?)
- scientific article; zbMATH DE number 1302842 (Why is no real title available?)
- Le Mans: dynamic and fluid MPC for dishonest majority
- Multiparty Computation from Somewhat Homomorphic Encryption
- On linear communication complexity for (maximally) fluid MPC
- Perfect MPC over layered graphs
- Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
- Perfectly-Secure MPC with Linear Communication Complexity
- Scalable and Unconditionally Secure Multiparty Computation
- Secure MPC: laziness leads to GOD
- Synchronous, with a chance of partition tolerance
- Universally composable security: a new paradigm for cryptographic protocols
- YOSO: You only speak once. Secure MPC with stateless ephemeral roles
This page was built for publication: Perfectly secure fluid MPC with abort and linear communication complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7326440)
