Multi-valued Byzantine Broadcast: The t < n Case

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

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)

Cited In (6)

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

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)