Honest Majority MPC with $\tilde{O}(|C|)$ Communication in Minicrypt
- 28 April 2025
- book chapter
- Published by Springer Nature
- p. 453-483
Abstract
No abstract availableKeywords
This publication has 33 references indexed in Scilit:
- Towards Achieving Asynchronous MPC with Linear Communication and Optimal Resilience2024
- Sharing Transformation and Dishonest Majority MPC with Packed Secret Sharing2022
- ATLAS: Efficient and Scalable MPC in the Honest Majority Setting2021
- Unconditional Communication-Efficient MPC via Hall’s Marriage Theorem2021
- Efficient Fully Secure Computation via Distributed Zero-Knowledge Proofs2020
- Communication Lower Bounds for Statistically Secure MPC, With or Without Preprocessing2019
- Zero-Knowledge Proofs on Secret-Shared Data via Fully Linear PCPs2019
- Minimising Communication in Honest-Majority MPC by Batchwise Multiplication Verification2018
- The Price of Low Communication in Secure Multi-party Computation2017
- Multiparty Protocols Tolerating Half Faulty Processors2001