Aardvark: A Concurrent Authenticated Dictionary with Short Proofs
Aardvark: A Concurrent Authenticated Dictionary with Short Proofs
复制标题
Aardvark：带有简短证明的并发认证字典
DOI：
--
复制
发表时间：
2020
期刊：
影响因子：
--
通讯作者：
Nickolai Zeldovich
中科院分区：
文献类型：
--
作者：
Derek Leung;Y. Gilad;S. Gorbunov;Leonid Reyzin;Nickolai Zeldovich
—我们设计了 Aardvark，一种新颖的经过验证的字典，由带有简短证明的矢量承诺支持。 Aardvark 通过提供查找和修改的证据来保证外包数据的完整性，即使存储数据的服务器不受信任。为了支持高吞吐量、高度并行的应用程序，Aardvark 包含一个版本控制机制，允许字典在有限的时间内接受过时的证明。我们将 Aardvark 应用于解决加密货币中存储与交易验证的解耦问题。在这里，网络资源非常宝贵，并且由于多个用户同时读写，长证明的传输很容易成为主要成本。我们实现 Aardvark 并将其作为独立的经过身份验证的字典进行评估。我们表明，Aardvark 节省了大量的存储资源，同时产生有限的额外带宽和处理成本。
—We design Aardvark, a novel authenticated dictionary backed by vector commitments with short proofs. Aardvark guarantees the integrity of outsourced data by providing proofs for lookups and modifications, even when the servers storing the data are untrusted. To support high-throughput, highly-parallel applications, Aardvark includes a versioning mechanism that allows the dictionary to accept stale proofs for a limited time. We apply Aardvark to the problem of decoupling storage from transaction verification in cryptocurrencies. Here networking resources are at a premium and transmission of long proofs can easily become the dominant cost, with multiple users reading and writing concurrently. We implement Aardvark and evaluate it as a standalone authenticated dictionary. We show that Aardvark saves substantial storage resources while incurring limited extra bandwidth and processing costs.