On fully-secure honest majority MPC without \(n^2\) round overhead (Q6619922)
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 7927366
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On fully-secure honest majority MPC without \(n^2\) round overhead |
scientific article; zbMATH DE number 7927366 |
Statements
On fully-secure honest majority MPC without \(n^2\) round overhead (English)
0 references
16 October 2024
0 references
secure multiparty computation
0 references
quadratic communication
0 references
0 references
0 references
0.8547565937042236
0 references
0.8307539224624634
0 references
0.8297135829925537
0 references
0.8222796320915222
0 references
