Asymmetric Distributed Trust

arXiv:1906.09314v2 Announce Type: replace-cross
Abstract: Quorum systems are a key abstraction in distributed fault-tolerant computing for capturing trust assumptions. They can be found at the core of many algorithms for implementing reliable broadcasts, shared memory, consensus and other problems. This paper introduces asymmetric Byzantine quorum systems that model subjective trust. Every process is free to choose which combinations of other processes it trusts and which ones it considers faulty. Asymmetric quorum systems strictly generalize standard Byzantine quorum systems, which have …

abstraction algorithms arxiv can computing cs.cr cs.dc distributed found free key memory problems process systems trust