Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation (Q5451065)
From MaRDI portal
scientific article; zbMATH DE number 5250408
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation |
scientific article; zbMATH DE number 5250408 |
Statements
Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation (English)
0 references
18 March 2008
0 references
