论文标题
如何在分散的加密货币中驯服多重支出
How to Tame Multiple Spending in Decentralized Cryptocurrencies
论文作者
论文摘要
在过去的十年中，为分散环境设计了各种资产转移系统。为了解决双重支出的问题，这些系统固有地做出了强大的模型假设并花费大量资源。在本文中，我们采用了一种非东正教方法来解决双期消费问题，该方法可能适合部署这些系统的更好的现实环境。我们考虑分散的信任设置，每个用户可以通过形成其本地法定人数独立选择信任的人。在这种情况下，我们定义了$ k $支出资产传输，这是一种放松的资产传输版本，该版本可以花费相同资产的次数。我们建立了分散的信任假设与$ k $（系统的最佳支出数量）之间的精确关系。
The last decade has seen a variety of Asset-Transfer systems designed for decentralized environments. To address the problem of double-spending, these systems inherently make strong model assumptions and spend a lot of resources. In this paper, we take a non-orthodox approach to the double-spending problem that might suit better realistic environments in which these systems are to be deployed. We consider the decentralized trust setting, where each user may independently choose who to trust by forming its local quorums. In this setting, we define $k$-Spending Asset Transfer, a relaxed version of asset transfer which bounds the number of times the same asset can be spent. We establish a precise relationship between the decentralized trust assumptions and $k$, the optimal spending number of the system.
