On the exact round complexity of secure three-party computation (Q5916237)
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 6943913
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the exact round complexity of secure three-party computation |
scientific article; zbMATH DE number 6943913 |
Statements
On the exact round complexity of secure three-party computation (English)
0 references
26 September 2018
0 references
0.9891617894172668
0 references
0.8421816229820251
0 references
0.8415274620056152
0 references
0.824609100818634
0 references
0.8035627603530884
0 references
