A note on the communication complexity of multiparty computation in the correlated randomness model (Q2292882)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on the communication complexity of multiparty computation in the correlated randomness model |
scientific article |
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
