On the complexity of verifiable secret sharing and multiparty computation (Q3192000)
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: On the complexity of verifiable secret sharing and multiparty computation |
scientific article; zbMATH DE number 6348000
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of verifiable secret sharing and multiparty computation |
scientific article; zbMATH DE number 6348000 |
Statements
On the complexity of verifiable secret sharing and multiparty computation (English)
0 references
26 September 2014
0 references
0.9438196
0 references
0.9435204
0 references
0.9356512
0 references
0.9298661
0 references
0 references
0.9208776
0 references
0.9205248
0 references
