Beyond honest majority: the round complexity of fair and robust multi-party computation

DOI10.1007/978-3-030-34578-5_17zbMath1456.94104OpenAlexW2990232060MaRDI QIDQ2181890

Divya Ravi, Arpita Patra

Publication date: 20 May 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-34578-5_17

zbMATH Keywords

dynamicfairnessboundaryMPCround complexityguaranteed output delivery

Mathematics Subject Classification ID

Cryptography (94A60) Distributed systems (68M14) Network protocols (68M12)

Related Items (4)

On the exact round complexity of best-of-both-worlds multi-party computation ⋮ Information-theoretically secure MPC against mixed dynamic adversaries ⋮ On the exact round complexity of secure three-party computation ⋮ Broadcast-optimal two-round MPC

This page was built for publication: Beyond honest majority: the round complexity of fair and robust multi-party computation