On the round complexity of fully secure solitary MPC with honest majority (Q6582169)
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 7891013
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the round complexity of fully secure solitary MPC with honest majority |
scientific article; zbMATH DE number 7891013 |
Statements
On the round complexity of fully secure solitary MPC with honest majority (English)
0 references
2 August 2024
0 references
broadcast
0 references
point-to-point communication
0 references
secure multiparty computation
0 references
solitary output
0 references
0 references
0 references
0.8455116152763367
0 references
0.8159533739089966
0 references
0.8068833351135254
0 references
