Two of the most sought-after properties of Multi-party Computation (MPC) protocols are fairness and guaranteed output delivery (GOD), the latter also referred to as robustness. Achieving both, however, brings in the necessary requirement of malicious-minority. In a generalised adversarial setting where the adversary is allowed to corrupt both actively and passively, the necessary bound for a n-party fair or robust protocol turns out to be ta+tp
CITATION STYLE
Patra, A., & Ravi, D. (2019). Beyond honest majority: The round complexity of fair and robust multi-party Computation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11921 LNCS, pp. 456–487). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-030-34578-5_17
Mendeley helps you to discover research relevant for your work.