Efficient secure two-party computation using symmetric cut-and-choose (Q2849384)
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: Efficient secure two-party computation using symmetric cut-and-choose |
scientific article; zbMATH DE number 6208909
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient secure two-party computation using symmetric cut-and-choose |
scientific article; zbMATH DE number 6208909 |
Statements
Efficient Secure Two-Party Computation Using Symmetric Cut-and-Choose (English)
0 references
17 September 2013
0 references
0.8620396256446838
0 references
0.857361912727356
0 references
0.8567155599594116
0 references
0.8566678166389465
0 references
0.8536630868911743
0 references
