Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party (Q6070449)
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 7768549
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party |
scientific article; zbMATH DE number 7768549 |
Statements
Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party (English)
0 references
21 November 2023
0 references
Byzantine agreement
0 references
communication complexity
0 references
distributed signatures
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.830212414264679
0 references
0.8145175576210022
0 references
0.8025271892547607
0 references
0.7977687120437622
0 references
0.7931470274925232
0 references
