Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation (Q5451065)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation |
scientific article; zbMATH DE number 5250408
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8344282507896423
0 references
0.813347578048706
0 references
0.8116257786750793
0 references
0.8040391206741333
0 references
