Tight bounds on the randomness complexity of secure multiparty computation (Q6166963)
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: Tight bounds on the randomness complexity of secure multiparty computation |
scientific article; zbMATH DE number 7708484
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tight bounds on the randomness complexity of secure multiparty computation |
scientific article; zbMATH DE number 7708484 |
Statements
Tight bounds on the randomness complexity of secure multiparty computation (English)
0 references
7 July 2023
0 references
randomness complexity of protocols
0 references
small probability spaces
0 references
privacy
0 references
xor function
0 references
0.8678227066993713
0 references
0.8591034412384033
0 references
0.8591033220291138
0 references
0.852340579032898
0 references
0.8509697914123535
0 references
