Multi-valued Byzantine broadcast: the t < n case

DOI10.1007/978-3-662-45608-8_24zbMATH Open1317.94112OpenAlexW2281754053MaRDI QIDQ2936623FDOQ2936623

Authors: Martin Hirt, Pavel Raykov 

Publication date: 6 January 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-45608-8_24

Recommendations

• Optimally efficient multi-valued byzantine agreement
• Information-theoretic broadcast with dishonest majority for long messages
• Byzantine agreement given partial broadcast
• Broadcast from minicast secure against general adversaries
• On the complexity of broadcast setup

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (14)

• Communication optimal multi-valued asynchronous broadcast protocol
• Efficient adaptively-secure Byzantine agreement for long messages
• Information-theoretic broadcast with dishonest majority for long messages
• On the complexity of broadcast setup
• Asymptotically free broadcast in constant expected time via packed VSS
• Optimal extension protocols for Byzantine broadcast and agreement
• Efficient secure multiparty computation with identifiable abort
• Asymptotically optimal message dissemination with applications to blockchains
• Perfect (parallel) broadcast in constant expected rounds via statistical VSS
• Broadcast amplification
• Broadcast from minicast secure against general adversaries
• From partial to global asynchronous reliable broadcast
• Minimizing setup in broadcast-optimal two round MPC
• Gossiping for communication-efficient broadcast

This page was built for publication: Multi-valued Byzantine broadcast: the \(t < n\) case

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2936623)