Abstract
Authenticated dictionaries are a widely discussed paradigm to enable verifiable integrity for data storage on untrusted servers, such as today’s widely used “cloud computing” resources, allowing a server to provide a “proof,” typically in the form of a slice through a cryptographic data structure, that the results of any given query are the correct answer, including that the absence of a query result is correct. Persistent authenticated dictionaries (PADs) further allow queries against older versions of the structure. This research presents implementations of a variety of different PAD algorithms, some based on Merkle tree-style data structures and others based on individually signed “tuple” statements (with and without RSA accumulators). We present system throughput benchmarks, indicating costs in terms of time, storage, and bandwidth as well as considering how much money would be required given standard cloud computing costs. We conclude that Merkle tree PADs are preferable in cases with frequent updates, while tuple-based PADs are preferable with higher query rates. For Merkle tree PADs, red-black trees outperform treaps and skiplists. Applying Sarnak-Tarjan’s versioned node strategy, with a cache of old hashes at every node, to red-black trees yields the fastest Merkle tree PAD implementation, notably using half the memory of the more commonly used mutation-free path copying strategy. For tuple PADs, although we designed and implemented an algorithm using RSA accumulators that offers constant update size, constant storage per update, constant proof size, and sublinear computation per update, we found that RSA accumulators are so expensive that they are never worthwhile. We find that other optimizations in the literature for tuple PADs are more cost-effective.
Funder
Division of Computer and Network Systems
Publisher
Association for Computing Machinery (ACM)
Subject
Safety, Risk, Reliability and Quality,General Computer Science
Reference45 articles.
1. An algorithm for the organization of information;Adelson-Velskii G.;Proc. USSR Acad. Sci.,1962
2. Faster uniquely represented dictionaries
3. Randomized search trees
Cited by
21 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Decentralized Identity Authentication with Auditability and Privacy;Algorithms;2022-12-21
2. LVQ: A Lightweight Verifiable Query Approach for Transaction History in Bitcoin;2020 IEEE 40th International Conference on Distributed Computing Systems (ICDCS);2020-11
3. Transparency Logs via Append-Only Authenticated Dictionaries;Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security;2019-11-06
4. Towards an End-User Layer for Data Integrity;IEEE/WIC/ACM International Conference on Web Intelligence;2019-10-14
5. ClaimChain;Proceedings of the 2018 Workshop on Privacy in the Electronic Society;2018-01-15