Linear-communication asynchronous complete secret sharing with optimal resilience (Q6653035)
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: Linear-communication asynchronous complete secret sharing with optimal resilience |
scientific article; zbMATH DE number 7958294
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Linear-communication asynchronous complete secret sharing with optimal resilience |
scientific article; zbMATH DE number 7958294 |
Statements
Linear-communication asynchronous complete secret sharing with optimal resilience (English)
0 references
13 December 2024
0 references
secure multiparty computation
0 references
verifiable secret sharing
0 references
asynchronous network
0 references
UC security
0 references
unbounded adversary
0 references
communication complexity
0 references
0 references
0 references
0.9186352491378784
0 references
0.8977230787277222
0 references
0.8975074291229248
0 references
0.8843159079551697
0 references
