Towards characterizing complete fairness in secure two-party computation (Q5746342)
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: Towards characterizing complete fairness in secure two-party computation |
scientific article; zbMATH DE number 6258855
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Towards characterizing complete fairness in secure two-party computation |
scientific article; zbMATH DE number 6258855 |
Statements
Towards Characterizing Complete Fairness in Secure Two-Party Computation (English)
0 references
18 February 2014
0 references
complete fairness
0 references
secure two-party computation
0 references
foundations
0 references
malicious adversaries
0 references
0.9496033191680908
0 references
0.9440582990646362
0 references
0.9440188407897948
0 references
0.89864182472229
0 references
0.8908531665802002
0 references
