论文标题
在拜占庭分布式分类帐中原子上附加
Appending Atomically in Byzantine Distributed Ledgers
论文作者
论文摘要
分布式分类帐对象（DLO）是一个并发对象，可维护完全有序的记录序列，并支持两个基本操作：附加操作，该操作在序列结束时附加记录并获取，并返回记录的顺序。在这项工作中，我们提供了拜占庭式分布式分类帐（BDLO）的适当形式化，该对象（BDLO）是分布式系统中的DLO，过程可以任意偏离其凹痕行为，即它们可能是拜占庭式行为。我们的正式定义伴随着算法来实现BDLOS，利用基本的拜占庭原子广播服务。 然后，我们利用BDLO实现来解决拜占庭过程的原子附加问题。当几个客户的记录附加记录时，就会出现原子附加问题，每个客户的记录必须附加到另一个BDLO上，并且必须保证所有记录都已附加或无记录。我们提出了分布式算法，用于实施原子附加问题的解决方案，当客户（涉及附加物）和服务器（维护BDLOS）可能是拜占庭的问题时。
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.
