Perfectly-Secure MPC with Linear Communication Complexity (Q5445508): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 11:23, 9 February 2024
scientific article; zbMATH DE number 5242856
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
