Statistical MPC with a Constant Communication Overhead (Extended Abstract)
- 6 November 2026
- book chapter
- Published by Springer Nature
- p. 242-277
Abstract
No abstract availableThis publication has 36 references indexed in Scilit:
- Perfect (Parallel) Broadcast in Constant Expected Rounds via Statistical VSS2024
- Detect, Pack and Batch: Perfectly-Secure MPC with Linear Communication and Constant Expected Time2023
- Sharing Transformation and Dishonest Majority MPC with Packed Secret Sharing2022
- Unconditional Communication-Efficient MPC via Hall’s Marriage Theorem2021
- Guaranteed Output Delivery Comes Free in Honest Majority MPC2020
- Communication-Efficient Unconditional MPC with Guaranteed Output Delivery2019
- Communication Lower Bounds for Statistically Secure MPC, With or Without Preprocessing2019
- Efficient Multi-party Computation with Dispute Control2006
- Efficient Secure Multi-party Computation2000
- Multiparty Unconditionally Secure Protocols (Abstract)1988