Signed quorum systems

DOI10.1145/1011767.1011803MaRDI QIDQ5501504zbMATH OpenOpenAlexFDO

Authors Haifeng Yu

Publication date 3 August 2015

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

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

zbMATH Keywords

availabilityloadprobe complexityquorum systemstradeoff

Mathematics Subject Classification ID

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

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

Cited in

(5)

• Signed quorum systems
• Signatures of indirect majority systems
• Refined quorum systems
• Average probe complexity in 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 Q5501504)