Perfect asynchronous MPC with linear communication overhead
From MaRDI portal
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
- A simpler variant of universally composable security for standard multiparty computation
- An Efficient Framework for Unconditionally Secure Multiparty Computation
- Asynchronous byzantine agreement protocols
- Asynchronous secure computations with optimal resilience (extended abstract)
- Communication efficient perfectly secure VSS and MPC in asynchronous networks with optimal resilience
- Communication-efficient unconditional MPC with guaranteed output delivery
- Detect, pack and batch: perfectly-secure MPC with linear communication and constant expected time
- Efficient asynchronous verifiable secret sharing and multiparty computation
- scientific article; zbMATH DE number 1583939 (Why is no real title available?)
- scientific article; zbMATH DE number 176564 (Why is no real title available?)
- scientific article; zbMATH DE number 1955785 (Why is no real title available?)
- Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
- Perfectly-Secure MPC with Linear Communication Complexity
- Revisiting asynchronous fault tolerant computation with optimal resilience
- Simple and Efficient Perfectly-Secure Asynchronous MPC
Cited in
(10)- Towards achieving asynchronous MPC with linear communication and optimal resilience
- Linear-communication asynchronous complete secret sharing with optimal resilience
- Computationally efficient asynchronous MPC with linear communication and low additive overhead
- Peeking into the future: MPC resilient to super-rushing adversaries
- Asynchronous agreement on a core set in constant expected time and more efficient asynchronous VSS and MPC
- Is it even possible? On the parallel composition of asynchronous MPC protocols
- Fast and efficient perfectly secure network-agnostic secure computation
- Information-theoretic network-agnostic MPC with polynomial communication
- Perfectly secure network-agnostic MPC comes for free
- New upper and lower bounds for perfectly secure MPC
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)
