Constant-Round Asynchronous MPC with Optimal Resilience and Linear Communication
Open Access
- 17 August 2025
- book chapter
- Published by Springer Nature
- p. 36-69
Abstract
No abstract availableKeywords
This publication has 53 references indexed in Scilit:
- Sharing Transformation and Dishonest Majority MPC with Packed Secret Sharing2022
- On Communication-Efficient Asynchronous MPC with Adaptive Security2021
- Unconditional Communication-Efficient MPC via Hall’s Marriage Theorem2021
- Large Scale, Actively Secure Computation from LPN and Free-XOR Garbled Circuits2021
- Concretely Efficient Large-Scale MPC with Active Security (or, TinyKeys for TinyOT)2018
- Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields2006
- Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator2005
- Cryptographic Asynchronous Multi-party Computation with Optimal Resilience2005
- Asynchronous Verifiable Information Dispersal2005
- Multiparty Protocols Tolerating Half Faulty Processors2001