Multi-valued Byzantine Broadcast: The t < n Case

DOI10.1007/978-3-662-45608-8_24zbMath1317.94112OpenAlexW2281754053MaRDI QIDQ2936623

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

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (6)

Information-theoretic broadcast with dishonest majority for long messages ⋮ Broadcast from Minicast Secure Against General Adversaries ⋮ Efficient Secure Multiparty Computation with Identifiable Abort ⋮ Optimal extension protocols for Byzantine broadcast and agreement ⋮ Minimizing setup in broadcast-optimal two round MPC ⋮ Efficient adaptively-secure Byzantine agreement for long messages

This page was built for publication: Multi-valued Byzantine Broadcast: The t < n Case