Computational hardness of optimal fair computation: beyond Minicrypt (Q2128555)
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 7511726
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computational hardness of optimal fair computation: beyond Minicrypt |
scientific article; zbMATH DE number 7511726 |
Statements
Computational hardness of optimal fair computation: beyond Minicrypt (English)
0 references
22 April 2022
0 references
fair computation
0 references
optimal fair coin-tossing
0 references
cryptomania
0 references
black-box separation
0 references
hardness of computation results
0 references
secure function evaluation functionalities
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8542672395706177
0 references
0.8484272360801697
0 references
0.8433695435523987
0 references
0.833634078502655
0 references
0.8324093818664551
0 references
