Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party (Q6070449)

From MaRDI portal
Revision as of 15:07, 26 April 2024 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7768549
Language Label Description Also known as
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
    0 references
    0 references
    0 references
    0 references
    21 November 2023
    0 references
    0 references
    Byzantine agreement
    0 references
    communication complexity
    0 references
    distributed signatures
    0 references