invited-talk

Asymmetric Distributed Trust

Author:

Christian CachinAuthors Info & Claims

ICDCN '21: Proceedings of the 22nd International Conference on Distributed Computing and Networking

Page 3

https://doi.org/10.1145/3427796.3433933

Published: 05 January 2021 Publication History

Get Access

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 talk 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 only one global trust assumption for all processes. The talk presents also several protocols that tolerate Byzantine faults with asymmetric trust, such as shared-register implementations and reliable Byzantine broadcasts.

Consensus is arguably one of the most important notions in distributed computing and also relevant for practical systems. We also show how to realize consensus protocols with asymmetric trust, illustrating our approach for protocols in partially synchronous systems and for asynchronous protocols that use randomization with asymmetric trust.

Asymmetric quorum systems offer a way to understand some ideas behind the Ripple and Stellar blockchain protocols, which aim at relaxing symmetric trust assumptions and permit flexible trust.

The presentation is based on joint work with Björn Tackmann and Luca Zanolini [1, 2].

References

[1]

Christian Cachin and Björn Tackmann. 2019. Asymmetric Distributed Trust. In Proc. 23rd International Conference on Principles of Distributed Systems (OPODIS)(Leibniz International Proceedings in Informatics (LIPIcs), Vol. 153), Pascal Felber, Roy Friedman, Seth Gilbert, and Avery Miller (Eds.). Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, 7:1–7:16. https://doi.org/10.4230/LIPIcs.OPODIS.2019.7

Crossref

Google Scholar

[2]

Christian Cachin and Luca Zanolini. 2020. Asymmetric Byzantine Consensus. e-print, arXiv:2005.08795 [cs.DC]. https://arxiv.org/abs/2005.08795

Google Scholar

Cited By

View all

Yu QLosa GWang XKuznetsov PGelles ROlivetti D(2024)TetraBFT: Reducing Latency of Unauthenticated, Responsive BFT ConsensusProceedings of the 43rd ACM Symposium on Principles of Distributed Computing10.1145/3662158.3662783(257-267)Online publication date: 17-Jun-2024
https://dl.acm.org/doi/10.1145/3662158.3662783
Heydari HVassantlal RBessani A(2024)Knowledge Connectivity Requirements for Solving BFT Consensus with Unknown Participants and Fault Threshold2024 IEEE 44th International Conference on Distributed Computing Systems (ICDCS)10.1109/ICDCS60910.2024.00029(221-231)Online publication date: 23-Jul-2024
https://doi.org/10.1109/ICDCS60910.2024.00029
Das SCamacho PXiang ZNieto JBünz BRen LMeng WJensen CCremers CKirda E(2023)Threshold Signatures from Inner Product Argument: Succinct, Weighted, and Multi-thresholdProceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security10.1145/3576915.3623096(356-370)Online publication date: 15-Nov-2023
https://dl.acm.org/doi/10.1145/3576915.3623096
Show More Cited By

Recommendations

Asymmetric distributed trust
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 ...
BFT in Blockchains: From Protocols to Use Cases
A blockchain is a distributed system that achieves strong security guarantees in storing, managing, and processing data. All blockchains achieve a common goal: building a decentralized system that provides a trustworthy service in an untrustworthy ...
Synchronous Byzantine quorum systems

Quorum systems have been used to implement many coordination problems in distributed systems such as mutual exclusion, data replication, distributed consensus, and commit protocols. Malkhi and Reiter recently proposed quorum systems that can tolerate ...

Comments

Information & Contributors

Information

Published In

ICDCN '21: Proceedings of the 22nd International Conference on Distributed Computing and Networking

January 2021

252 pages

ISBN:9781450389334

DOI:10.1145/3427796

Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 05 January 2021

Check for updates

Author Tags

Qualifiers

Invited-talk
Research
Refereed limited

Conference

ICDCN '21

ICDCN '21: International Conference on Distributed Computing and Networking 2021

January 5 - 8, 2021

Nara, Japan

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

7
Total Citations
View Citations
186
Total Downloads

Downloads (Last 12 months)26
Downloads (Last 6 weeks)0

Reflects downloads up to 19 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Yu QLosa GWang XKuznetsov PGelles ROlivetti D(2024)TetraBFT: Reducing Latency of Unauthenticated, Responsive BFT ConsensusProceedings of the 43rd ACM Symposium on Principles of Distributed Computing10.1145/3662158.3662783(257-267)Online publication date: 17-Jun-2024
https://dl.acm.org/doi/10.1145/3662158.3662783
Heydari HVassantlal RBessani A(2024)Knowledge Connectivity Requirements for Solving BFT Consensus with Unknown Participants and Fault Threshold2024 IEEE 44th International Conference on Distributed Computing Systems (ICDCS)10.1109/ICDCS60910.2024.00029(221-231)Online publication date: 23-Jul-2024
https://doi.org/10.1109/ICDCS60910.2024.00029
Das SCamacho PXiang ZNieto JBünz BRen LMeng WJensen CCremers CKirda E(2023)Threshold Signatures from Inner Product Argument: Succinct, Weighted, and Multi-thresholdProceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security10.1145/3576915.3623096(356-370)Online publication date: 15-Nov-2023
https://dl.acm.org/doi/10.1145/3576915.3623096
Sheng PWang XKannan SNayak KViswanath PMeng WJensen CCremers CKirda E(2023)TrustBoost: Boosting Trust among Interoperable BlockchainsProceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security10.1145/3576915.3623080(1571-1584)Online publication date: 15-Nov-2023
https://dl.acm.org/doi/10.1145/3576915.3623080
Vassantlal RHeydari HBessani A(2023)On the Minimal Knowledge Required for Solving Stellar Consensus2023 IEEE 43rd International Conference on Distributed Computing Systems (ICDCS)10.1109/ICDCS57875.2023.00016(682-691)Online publication date: Jul-2023
https://doi.org/10.1109/ICDCS57875.2023.00016
Ahuja A(2023)SightsTeeple: Agreeing to Disagree with Functional Blockchain Consensus2023 IEEE International Conference on Blockchain and Cryptocurrency (ICBC)10.1109/ICBC56567.2023.10174951(1-9)Online publication date: 1-May-2023
https://doi.org/10.1109/ICBC56567.2023.10174951
Ma CZhang YFang BZhang HJin YZhou D(2022)Ripple+: An Improved Scheme of Ripple Consensus Protocol in Deployability, Liveness and Timing AssumptionComputer Modeling in Engineering & Sciences10.32604/cmes.2022.016838130:1(463-481)Online publication date: 2022
https://doi.org/10.32604/cmes.2022.016838
Bezerra JKuznetsov PMilani AWoelfel P(2022)Brief Announcement: How to Tame Multiple Spending in Decentralized CryptocurrenciesProceedings of the 2022 ACM Symposium on Principles of Distributed Computing10.1145/3519270.3538465(427-429)Online publication date: 20-Jul-2022
https://dl.acm.org/doi/10.1145/3519270.3538465

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

HTML Format

View this article in HTML Format.

HTML Format

Abstract

References

Cited By

Recommendations