Communication Locality in Secure Multi-party Computation
From MaRDI portal
Recommendations
- Secure multiparty computation with sublinear preprocessing
- Robust Multiparty Computation with Linear Communication Complexity
- Round-optimal and communication-efficient multiparty computation
- scientific article; zbMATH DE number 1583776
- scientific article; zbMATH DE number 1754645
- The price of low communication in secure multi-party computation
- scientific article; zbMATH DE number 1583939
- Secure multiparty computation of approximations
- Generalizing efficient multiparty computation
Cited in
(28)- The more the merrier: reducing the cost of large scale MPC
- Spreading the privacy blanket: differentially oblivious shuffling for differential privacy
- Is information-theoretic topology-hiding computation possible?
- Secure multi-party computation in large networks
- High-capacity quantum summation with single photons in both polarization and spatial-mode degrees of freedom
- Secret-shared RAM indefinite private and secure RAM execution of perfectly unrevealed programs
- Towards efficiency-preserving round compression in MPC. Do fewer rounds mean more computation?
- Network-Hiding Communication and Applications to Multi-party Protocols
- Network oblivious transfer
- The hidden graph model: communication locality and optimal resiliency with adaptive faults
- Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs
- Secure Multi-party Shuffling
- scientific article; zbMATH DE number 6146451 (Why is no real title available?)
- The bottleneck complexity of secure multiparty computation
- On the bottleneck complexity of MPC with correlated randomness
- Three-party quantum summation without a trusted third party
- Sublinear-communication secure multiparty computation does not require FHE
- Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party
- Must the communication graph of MPC protocols be an expander?
- Sublinear secure computation from new assumptions
- Asymptotically optimal message dissemination with applications to blockchains
- MPC for tech giants (GMPC): enabling Gulliver and the Lilliputians to cooperate amicably
- Secured distributed algorithms without hardness assumptions
- Adaptive security, erasures, and network assumptions in communication-local MPC
- On the communication complexity of secure multi-party computation with aborts
- Communication lower bounds for cryptographic broadcast protocols
- Maintaining sublinear locality over time: adaptively secure MPC on a reusable hidden graph
- Limits of practical sublinear secure computation
This page was built for publication: Communication Locality in Secure Multi-party Computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4910288)
