Perfectly-Secure MPC with Linear Communication Complexity (Q5445508): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-540-78524-8_13 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W48039395 / rank | |||
Normal rank | |||
Latest revision as of 02:21, 20 March 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
