Financial Cryptography and Data Security - 23rd International Conference, FC 2019, Frigate Bay, St. Kitts and Nevis, February 18-22, 2019, Revised Selected Papers
Financial Cryptography and Data Security - 23rd International Conference, FC 2019, Frigate Bay, St. Kitts and Nevis, February 18-22, 2019, Revised Selected Papers
复制标题
金融密码学和数据安全 - 第 23 届国际会议，FC 2019，圣基茨和尼维斯护卫舰湾，2019 年 2 月 18-22 日，修订后的精选论文
DOI：
10.1007/978-3-030-32101-7_26
复制
发表时间：
2019
期刊：
影响因子：
--
通讯作者：
Arapinis M
中科院分区：
文献类型：
--
作者：
Arapinis M
比特币作为最成功的加密货币，一再受到攻击，许多用户损失了他们的资金。业界对保护用户资产的反应是提供防篡改的硬件钱包。尽管这样的钱包被认为是管理账户最安全的手段，但之前还没有正式尝试过识别、建模和正式验证它们的属性。本文首次给出了比特币硬件钱包操作的形式化模型。我们确定了比特币钱包的属性和安全参数，并在通用合成(UC)框架中对其进行了正式定义。我们提出了一种硬件钱包生态系统的模块化处理，通过在一组协议定义的混合设置中实现钱包功能。这种方法使我们能够详细地捕获Wallet的组件、它们的交互以及潜在的威胁。在协议执行过程中没有偏差的情况下，我们通过证明钱包在常见的密码假设下是安全的，从而推导出钱包的安全性。最后，我们定义了在协议偏差下成功的攻击，并分析了商业钱包的安全性。
Bitcoin, being the most successful cryptocurrency, has been repeatedly attacked with many users losing their funds. The industry’s response to securing the user’s assets is to offer tamper-resistant hardware wallets. Although such wallets are considered to be the most secure means for managing an account, no formal attempt has been previously done to identify, model and formally verify their properties. This paper provides the first formal model of the Bitcoin hardware wallet operations. We identify the properties and security parameters of a Bitcoin wallet and formally define them in the Universal Composition (UC) Framework. We present a modular treatment of a hardware wallet ecosystem, by realizing the wallet functionality in a hybrid setting defined by a set of protocols. This approach allows us to capture in detail the wallet’s components, their interaction and the potential threats. We deduce the wallet’s security by proving that it is secure under common cryptographic assumptions, provided that there is no deviation in the protocol execution. Finally, we define the attacks that are successful under a protocol deviation, and analyze the security of commercially available wallets.