On the exact round complexity of secure three-party computation (Q5918099)
From MaRDI portal
scientific article; zbMATH DE number 7393900
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the exact round complexity of secure three-party computation |
scientific article; zbMATH DE number 7393900 |
Statements
On the exact round complexity of secure three-party computation (English)
0 references
10 September 2021
0 references
MPC
0 references
round complexity
0 references
3PC
0 references
fairness
0 references
guaranteed output delivery
0 references
selective abort
0 references
unanimous abort
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
