Lower bounds on the bottleneck complexity of secure multiparty computation
From MaRDI portal
Cites work
- ATLAS: efficient and scalable MPC in the honest majority setting
- Communication lower bounds for statistically secure MPC, with or without preprocessing
- Fast large-scale honest-majority MPC for malicious adversaries
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Foundations of Cryptography
- Fully homomorphic encryption over the integers
- Fully homomorphic encryption using ideal lattices
- 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 7706034 (Why is no real title available?)
- MPC with low bottleneck-complexity: information-theoretic security and more
- Multiparty Computation from Somewhat Homomorphic Encryption
- Non-interactive secure multiparty computation
- On the bottleneck complexity of MPC with correlated randomness
- On the communication complexity of secure computation
- On the communication required for unconditionally secure multiplication
- Scalable and Unconditionally Secure Multiparty Computation
- Scalable leader election
- Secure multi-party computation in large networks
- Secure multiparty computation of symmetric functions with polylogarithmic bottleneck complexity and correlated randomness
- The bottleneck complexity of secure multiparty computation
- Unconditionally secure computation with reduced interaction
- Unconditionally secure multiparty computation for symmetric functions with low bottleneck complexity
This page was built for publication: Lower bounds on the bottleneck complexity of secure multiparty computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7391820)
