On the correlation complexity of MPC with cheater identification (Q6573954)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7882506
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the correlation complexity of MPC with cheater identification |
scientific article; zbMATH DE number 7882506 |
Statements
On the correlation complexity of MPC with cheater identification (English)
0 references
17 July 2024
0 references
composable protocols for multi-party computation
0 references
0 references
0.8168664574623108
0 references
0.8093670010566711
0 references
0.7854093313217163
0 references
0.7768754959106445
0 references
0.7765651345252991
0 references
