Player-Centric Byzantine Agreement

DOI10.1007/978-3-642-22006-7_24zbMath1332.68010OpenAlexW1881014145MaRDI QIDQ3012813

Martin Hirt, Vassilis Zikas

Publication date: 6 July 2011

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22006-7_24

Mathematics Subject Classification ID

Distributed systems (68M14) Network protocols (68M12) Authentication, digital signatures and secret sharing (94A62)

Related Items (1)

Authenticated broadcast with a partially compromised public-key infrastructure

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Shifting gears: Changing algorithms on the fly to expedite Byzantine agreement
• Efficient player-optimal protocols for strong and differential consensus
• Authenticated Byzantine Generals in Dual Failure Model
• Efficient Byzantine Agreement with Faulty Minority
• MPC vs. SFE : Unconditional and Computational Security
• Fast Distributed Agreement
• Reaching Agreement in the Presence of Faults
• The Byzantine Generals Problem
• An efficient algorithm for byzantine agreement without authentication
• Fully polynomial Byzantine agreement in t + 1 rounds
• Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract)
• MPC vs. SFE: Perfect Security in a Unified Corruption Model
• Secure Computation Without Authentication
• On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation

This page was built for publication: Player-Centric Byzantine Agreement