On the round complexity of black-box secure MPC (Q2128561)
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: On the round complexity of black-box secure MPC |
scientific article; zbMATH DE number 7511732
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the round complexity of black-box secure MPC |
scientific article; zbMATH DE number 7511732 |
Statements
On the round complexity of black-box secure MPC (English)
0 references
22 April 2022
0 references
round complexity of secure multiparty computation
0 references
black-box protocols
0 references
semi-malicious security
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8738902807235718
0 references
0.8702951073646545
0 references
0.8701822757720947
0 references
0.8681578636169434
0 references
0.8658432364463806
0 references
