Complexity and performance of secure floating-point polynomial evaluation protocols (Q2148764)
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 7547712
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity and performance of secure floating-point polynomial evaluation protocols |
scientific article; zbMATH DE number 7547712 |
Statements
Complexity and performance of secure floating-point polynomial evaluation protocols (English)
0 references
24 June 2022
0 references
secure multiparty computation
0 references
secret sharing
0 references
secure floating-point arithmetic
0 references
polynomial evaluation
0 references
0.8755676746368408
0 references
0.8012387156486511
0 references
0.7434059977531433
0 references
0.7422177791595459
0 references
0.7355088591575623
0 references
