Beyond honest majority: the round complexity of fair and robust multi-party computation (Q6109085)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Beyond honest majority: the round complexity of fair and robust multi-party computation |
scientific article; zbMATH DE number 7719407
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Beyond honest majority: the round complexity of fair and robust multi-party computation |
scientific article; zbMATH DE number 7719407 |
Statements
Beyond honest majority: the round complexity of fair and robust multi-party computation (English)
0 references
26 July 2023
0 references
fairness
0 references
guaranteed output delivery
0 references
MPC
0 references
round complexity
0 references
dynamic
0 references
boundary
0 references
0 references
0 references
