Simple and Efficient Perfectly-Secure Asynchronous MPC
From MaRDI portal
Publication:3498387
DOI10.1007/978-3-540-76900-2_23zbMath1153.94347OpenAlexW1518294377MaRDI QIDQ3498387
Martin Hirt, Zuzana Beerliová-Trubíniová
Publication date: 15 May 2008
Published in: Advances in Cryptology – ASIACRYPT 2007 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-76900-2_23
Related Items (15)
Perfectly-secure asynchronous MPC for general adversaries (extended abstract) ⋮ Improving the efficiency of optimally-resilient statistically-secure asynchronous multi-party computation ⋮ High throughput secure MPC over small population in hybrid networks (extended abstract) ⋮ Secure multi-party computation in large networks ⋮ Constant-Round Asynchronous Multi-Party Computation Based on One-Way Functions ⋮ Reaching consensus for asynchronous distributed key generation ⋮ Revisiting the efficiency of asynchronous MPC with optimal resilience against general adversaries ⋮ Revisiting the efficiency of perfectly secure asynchronous multi-party computation against general adversaries ⋮ Almost-surely terminating asynchronous Byzantine agreement against general adversaries with optimal resilience ⋮ Secure message transmission in asynchronous networks ⋮ On the communication efficiency of statistically secure asynchronous MPC with optimal resilience ⋮ Efficient Statistical Asynchronous Verifiable Secret Sharing with Optimal Resilience ⋮ Efficient asynchronous verifiable secret sharing and multiparty computation ⋮ Efficient perfectly secure computation with optimal resilience ⋮ Always have a backup plan: fully secure synchronous MPC with asynchronous fallback
This page was built for publication: Simple and Efficient Perfectly-Secure Asynchronous MPC
