Detectable Byzantine agreement secure against faulty majorities

DOI10.1145/571825.571841MaRDI QIDQ5170873zbMATH OpenOpenAlexFDO

Authors

Publication date 25 July 2014

Published in Proceedings of the twenty-first annual symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/571825.571841

zbMATH Keywords

broadcastByzantine agreementmulti-party computationpublic-key infrastructurequantum signatures

Mathematics Subject Classification ID

Network protocols (68M12) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• scientific article; zbMATH DE number 2086726
• scientific article; zbMATH DE number 176512
• An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
• Byzantine agreement given partial broadcast
• On the composition of authenticated Byzantine Agreement

Cited in

(27)

• Fairness versus guaranteed output delivery in secure multiparty computation
• Characterization of secure multiparty computation without broadcast
• Mutual information agreement in multicomputer systems with the detection and identification of Byzantine faults
• Yet another compiler for active security or: efficient MPC over arbitrary rings
• The sum of its parts: analysis of federated Byzantine agreement systems
• Always have a backup plan: fully secure synchronous MPC with asynchronous fallback
• Practical quantum Byzantine protocol via nearly optimal entanglement resources
• Broadcast-optimal two-round MPC
• Quantum Byzantine agreement with tripartite entangled states
• MPC with synchronous security and asynchronous responsiveness
• Characterization of secure multiparty computation without broadcast
• Broadcast (and round) efficient verifiable secret sharing
• Secure Protocols with Asymmetric Trust
• A New Solution to Detectable Byzantine Agreement Problem
• scientific article; zbMATH DE number 2009948 (Why is no real title available?)
• Distributed Detection in the Presence of Byzantine Attacks
• scientific article; zbMATH DE number 2086726 (Why is no real title available?)
• Strong Separations Between Broadcast and Authenticated Channels
• Efficient Byzantine Sequential Change Detection
• On the power of an honest majority in three-party computation without broadcast
• Quantum detectable Byzantine agreement for distributed data trust management in blockchain
• Network-agnostic security comes (almost) for free in DKG and MPC
• Resource fairness and composability of cryptographic protocols
• Secure computation without authentication
• New upper and lower bounds for perfectly secure MPC
• Efficient quantum detectable weak Byzantine agreement with optimal fault-tolerant bound
• Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority

This page was built for publication: Detectable Byzantine agreement secure against faulty majorities

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