Asynchronous computational VSS with reduced communication complexity (Q4910244)
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 6145695
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Asynchronous computational VSS with reduced communication complexity |
scientific article; zbMATH DE number 6145695 |
Statements
Asynchronous Computational VSS with Reduced Communication Complexity (English)
0 references
18 March 2013
0 references
verifiable secret sharing
0 references
asynchronous communication model
0 references
communication complexity
0 references
polynomial commitments
0 references
0.8972396850585938
0 references
0.8919146656990051
0 references
0.8469056487083435
0 references
0.8438959717750549
0 references
0.8320564031600952
0 references
