Byzantine分布式分类账中的原子查询
Appending Atomically in Byzantine Distributed Ledgers
摘要：
分布式账本对象（DLO）是一个并发对象，它维护一个完全有序的记录序列，并支持两个基本操作：append，在序列的末尾追加一个记录，以及get，返回记录序列。在这项工作中，我们提供了一个适当的形式化的拜占庭容忍分布式账本对象（BDLO），这是一个分布式系统中的DLO，其中进程可以任意偏离其缩进行为，即它们可能是拜占庭的。我们的正式定义是伴随着算法来实现BDLO利用底层拜占庭原子广播服务。然后，我们利用BDLO实现来解决原子的拜占庭进程的问题。当多个客户端都有记录要附加时，就会出现原子数据库问题，每个客户端的记录都必须附加到不同的BDLO，并且必须保证所有记录都被附加或没有附加。我们提出了分布式算法实现解决方案的原子的附加问题时，客户端（其中涉及的追加）和服务器（维护BDLO）可能是拜占庭式的。
英文摘要：
A Distributed Ledger Object (DLO) is a concurrent object that maintains a totally ordered sequence of records, and supports two basic operations: append, which appends a record at the end of the sequence, and get, which returns the sequence of records. In this work we provide a proper formalization of a Byzantine-tolerant Distributed Ledger Object (BDLO), which is a DLO in a distributed system in which processes may deviate arbitrarily from their indented behavior, i.e. they may be Byzantine. Our formal definition is accompanied by algorithms to implement BDLOs by utilizing an underlying Byzantine Atomic Broadcast service. We then utilize the BDLO implementations to solve the Atomic Appends problem against Byzantine processes. The Atomic Appends problem emerges when several clients have records to append, the record of each client has to be appended to a different BDLO, and it must be guaranteed that either all records are appended or none. We present distributed algorithms implementing solutions for the Atomic Appends problem when the clients (which are involved in the appends) and the servers (which maintain the BDLOs) may be Byzantine.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
