论文标题
将私人信息检索到轻质比特币客户
Applying Private Information Retrieval to Lightweight Bitcoin Clients
论文作者
论文摘要
轻型比特币客户端执行简单的付款验证（SPV）协议，以验证与特定用户相关的交易的有效性。当前，轻型客户使用Bloom过滤器可显着减少验证特定交易所需的带宽量。尽管研究表明，Bloom过滤器不足以保留客户疑问的隐私，但这是事实。 在本文中，我们描述了我们的SPV协议的设计，该协议利用私人信息检索（PIR）创建了完全私人和表演的查询。我们证明我们的协议的带宽和延迟成本较低；使我们的协议成为具有类似SPV模型的轻质比特币客户端和其他加密货币的可行替代品。在与Bloom过滤器的合同中，我们基于PIR的方法为用户提供了确定性的隐私。 在我们的结果中，我们表明，在最坏的情况下，希望在过去一周中验证100次交易的客户在使用我们的协议时，带宽成本为33.54 MB，相关延迟约为4.8分钟。使用基于Bloom滤波器的SPV协议执行的相同查询产生的带宽成本为12.85 MB；考虑到其提供的隐私，这是一个适度的开销。
Lightweight Bitcoin clients execute a Simple Payment Verification (SPV) protocol to verify the validity of transactions related to a particular user. Currently, lightweight clients use Bloom filters to significantly reduce the amount of bandwidth required to validate a particular transaction. This is despite the fact that research has shown that Bloom filters are insufficient at preserving the privacy of clients' queries. In this paper we describe our design of an SPV protocol that leverages Private Information Retrieval (PIR) to create fully private and performant queries. We show that our protocol has a low bandwidth and latency cost; properties that make our protocol a viable alternative for lightweight Bitcoin clients and other cryptocurrencies with a similar SPV model. In contract to Bloom filters, our PIR-based approach offers deterministic privacy to the user. Among our results, we show that in the worst case, clients who would like to verify 100 transactions occurring in the past week incurs a bandwidth cost of 33.54 MB with an associated latency of approximately 4.8 minutes, when using our protocol. The same query executed using the Bloom-filter-based SPV protocol incurs a bandwidth cost of 12.85 MB; this is a modest overhead considering the privacy guarantees it provides.
