Efficient asynchronous verifiable secret sharing and multiparty computation (Q2018817)
From MaRDI portal
!
WARNING
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 6419544
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient asynchronous verifiable secret sharing and multiparty computation |
scientific article; zbMATH DE number 6419544 |
Statements
Efficient asynchronous verifiable secret sharing and multiparty computation (English)
0 references
25 March 2015
0 references
unconditional security
0 references
fault tolerance
0 references
communication complexity
0 references
0 references
0 references
0 references
0.9161601066589355
0 references
0.9136712551116944
0 references
0.9105378985404968
0 references
0.8909310102462769
0 references
0.8890969157218933
0 references
