Fast optimistically fair cut-and-choose 2PC (Q5857776)
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 7331309
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast optimistically fair cut-and-choose 2PC |
scientific article; zbMATH DE number 7331309 |
Statements
Fast Optimistically Fair Cut-and-Choose 2PC (English)
0 references
7 April 2021
0 references
secure two-party computation
0 references
covert adversaries
0 references
cut-and-choose
0 references
garbled circuits
0 references
fair secure computation
0 references
optimistic fair exchange
0 references
0.8611580729484558
0 references
0.8164272904396057
0 references
0.8158861398696899
0 references
0.809051513671875
0 references
0.8059508800506592
0 references
