Broadcast from Minicast Secure Against General Adversaries
From MaRDI portal
Publication:3449517
DOI10.1007/978-3-662-47666-6_56zbMath1440.68021MaRDI QIDQ3449517
Publication date: 4 November 2015
Published in: Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-47666-6_56
Related Items
Strong Separations Between Broadcast and Authenticated Channels, Broadcast from Minicast Secure Against General Adversaries
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Modular construction of a Byzantine agreement protocol with optimal message bit complexity
- Byzantine agreement given partial broadcast
- Efficient Multiparty Protocols via Log-Depth Threshold Formulae
- Efficient General-Adversary Multi-Party Computation
- Communication-Efficient MPC for General Adversary Structures
- On the price of equivocation in byzantine agreement
- Multi-valued Byzantine Broadcast: The t < n Case
- Asynchronous MPC with a strict honest majority using non-equivocation
- Authenticated Algorithms for Byzantine Agreement
- From partial consistency to global broadcast
- Broadcast from Minicast Secure Against General Adversaries
- MPC vs. SFE : Unconditional and Computational Security
- Reaching Agreement in the Presence of Faults
- Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract)
- On Byzantine Agreement over (2,3)-Uniform Hypergraphs
- Broadcast Amplification
