Beyond honest majority: the round complexity of fair and robust multi-party computation (Q2181890)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Beyond honest majority: the round complexity of fair and robust multi-party computation |
scientific article |
Statements
Beyond honest majority: the round complexity of fair and robust multi-party computation (English)
0 references
20 May 2020
0 references
fairness
0 references
guaranteed output delivery
0 references
MPC
0 references
round complexity
0 references
dynamic
0 references
boundary
0 references
