Asynchronous MPC with a strict honest majority using non-equivocation

DOI10.1145/2611462.2611490zbMath1321.68039OpenAlexW1975596632MaRDI QIDQ2943607

Michael Backes, Fabian Bendun, Aniket Kate, Ashish Choudhury

Publication date: 3 September 2015

Published in: Proceedings of the 2014 ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2611462.2611490

zbMATH Keywords

asynchronyresiliencyverifiable secret sharing (VSS)non-equivocationmultiparty computation (MPC)reduced assumptions

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Network protocols (68M12) Authentication, digital signatures and secret sharing (94A62) Distributed algorithms (68W15)

Related Items (2)

Broadcast from Minicast Secure Against General Adversaries ⋮ Linear Overhead Optimally-Resilient Robust MPC Using Preprocessing

This page was built for publication: Asynchronous MPC with a strict honest majority using non-equivocation