Signed quorum systems

DOI10.1007/S00446-005-0133-8MaRDI QIDQ2375298zbMATH OpenOpenAlexFDO

Authors Haifeng Yu

Publication date 13 June 2013

Published in Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00446-005-0133-8

zbMATH Keywords

tradeoffloadavailabilityquorum systemsprobe complexity

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14)

Recommendations

• Signed quorum systems
• The Load, Capacity, and Availability of Quorum Systems
• scientific article; zbMATH DE number 1559572
• Byzantine quorum systems
• Optimal availability quorum systems: theory and practice

Cites work

• scientific article; zbMATH DE number 1559572 (Why is no real title available?)
• Average probe complexity in quorum systems
• How to assign votes in a distributed system
• How to be an efficient snoop, or the probe complexity of quorum systems (extended abstract)
• Load Balancing in Quorum Systems
• Planar quorums
• Probabilistic quorum systems
• Scalable and dynamic quorum systems
• The Load, Capacity, and Availability of Quorum Systems
• The availability of quorum systems

Cited in

(4)

• Signed quorum systems
• Signatures of indirect majority systems
• Refined quorum systems
• Applied Cryptography and Network Security

This page was built for publication: Signed quorum systems

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