A note on the communication complexity of multiparty computation in the correlated randomness model (Q2292882)
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 7164006
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on the communication complexity of multiparty computation in the correlated randomness model |
scientific article; zbMATH DE number 7164006 |
Statements
A note on the communication complexity of multiparty computation in the correlated randomness model (English)
0 references
6 February 2020
0 references
multiparty computation
0 references
correlated randomness model
0 references
information-theoretic security
0 references
sublinear communication
0 references
0.8319975733757019
0 references
0.8245860934257507
0 references
0.8165090084075928
0 references
0.8153932094573975
0 references
