Revisiting the efficiency of perfectly secure asynchronous multi-party computation against general adversaries (Q6169465)
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 7726566
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Revisiting the efficiency of perfectly secure asynchronous multi-party computation against general adversaries |
scientific article; zbMATH DE number 7726566 |
Statements
Revisiting the efficiency of perfectly secure asynchronous multi-party computation against general adversaries (English)
0 references
14 August 2023
0 references
Byzantine faults
0 references
secret-sharing
0 references
unconditional-security
0 references
Byzantine agreement
0 references
privacy
0 references
multi-party computation
0 references
non-threshold adversary
0 references
0 references
