Perfect asynchronous MPC with linear communication overhead
From MaRDI portal
Publication:6637548
DOI10.1007/978-3-031-58740-5_10MaRDI QIDQ6637548FDOQ6637548
Authors: Ittai Abraham, Gilad Asharov, Shravani Patil, Arpita Patra 
Publication date: 13 November 2024
Recommendations
- Towards achieving asynchronous MPC with linear communication and optimal resilience
- Simple and Efficient Perfectly-Secure Asynchronous MPC
- Linear-communication asynchronous complete secret sharing with optimal resilience
- On the communication efficiency of statistically secure asynchronous MPC with optimal resilience
- scientific article; zbMATH DE number 1583939
Cites Work
- Perfectly-Secure MPC with Linear Communication Complexity
- Title not available (Why is that?)
- Asynchronous secure computations with optimal resilience (extended abstract)
- Simple and Efficient Perfectly-Secure Asynchronous MPC
- Communication efficient perfectly secure VSS and MPC in asynchronous networks with optimal resilience
- Title not available (Why is that?)
- Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
- Asynchronous byzantine agreement protocols
- Title not available (Why is that?)
- A simpler variant of universally composable security for standard multiparty computation
- Revisiting asynchronous fault tolerant computation with optimal resilience
- An Efficient Framework for Unconditionally Secure Multiparty Computation
- Efficient asynchronous verifiable secret sharing and multiparty computation
- Communication-efficient unconditional MPC with guaranteed output delivery
- Detect, pack and batch: perfectly-secure MPC with linear communication and constant expected time
Cited In (2)
This page was built for publication: Perfect asynchronous MPC with linear communication overhead
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6637548)
