On the exact round complexity of best-of-both-worlds multi-party computation (Q2691581)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the exact round complexity of best-of-both-worlds multi-party computation |
scientific article |
Statements
On the exact round complexity of best-of-both-worlds multi-party computation (English)
0 references
29 March 2023
0 references
0 references
0 references
0 references
0 references
0 references
0 references
