Perfectly-Secure MPC with Linear Communication Complexity (Q5445508)
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 5242856
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Perfectly-Secure MPC with Linear Communication Complexity |
scientific article; zbMATH DE number 5242856 |
Statements
Perfectly-Secure MPC with Linear Communication Complexity (English)
0 references
5 March 2008
0 references
Multi-party computation
0 references
efficiency
0 references
perfect security
0 references
hyper-invertible matrix
0 references
0.884059727191925
0 references
0.8650447130203247
0 references
0.8621375560760498
0 references
0.8603120446205139
0 references
0.8602889776229858
0 references
