Completeness for symmetric two-party functionalities: revisited (Q2413612)
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 6936481
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Completeness for symmetric two-party functionalities: revisited |
scientific article; zbMATH DE number 6936481 |
Statements
Completeness for symmetric two-party functionalities: revisited (English)
0 references
14 September 2018
0 references
secure computation
0 references
hardness assumptions
0 references
completeness
0 references
non-black-box reductions
0 references
0 references
0 references
0 references
0.9856900572776794
0 references
0.8017522692680359
0 references
0.7988152503967285
0 references
0.7925554513931274
0 references
0.7877811789512634
0 references
