Unconditional communication-efficient MPC via Hall's marriage theorem (Q2128564)
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: Unconditional communication-efficient MPC via Hall's marriage theorem |
scientific article; zbMATH DE number 7511734
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Unconditional communication-efficient MPC via Hall's marriage theorem |
scientific article; zbMATH DE number 7511734 |
Statements
Unconditional communication-efficient MPC via Hall's marriage theorem (English)
0 references
22 April 2022
0 references
party unconditional multiparty computation protocols
0 references
communication complexity
0 references
0 references
0 references
