Explicit lower bounds for communication complexity of PSM for concrete functions (Q6623345)
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: Explicit lower bounds for communication complexity of PSM for concrete functions |
scientific article; zbMATH DE number 7930952
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Explicit lower bounds for communication complexity of PSM for concrete functions |
scientific article; zbMATH DE number 7930952 |
Statements
Explicit lower bounds for communication complexity of PSM for concrete functions (English)
0 references
23 October 2024
0 references
secure multiparty computation
0 references
private simultaneous messages
0 references
communication complexity
0 references
lower bounds
0 references
concrete functions
0 references
